core.hpp 184 KB
Newer Older
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1
2
3
4
5
6
7
8
9
// Copyright (c) 2020 INRA Distributed under the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#ifndef ORG_VLEPROJECT_IRRITATOR_2020
#define ORG_VLEPROJECT_IRRITATOR_2020

#include <algorithm>
#include <limits>
Gauthier Quesnel's avatar
Gauthier Quesnel committed
10
11
12

#ifdef __has_include
#if __has_include(<numbers>)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
13
#include <numbers>
Gauthier Quesnel's avatar
Gauthier Quesnel committed
14
15
16
17
18
19
#define irt_have_numbers 1
#else
#define irt_have_numbers 0
#endif
#endif

Gauthier Quesnel's avatar
Gauthier Quesnel committed
20
21
22
23
24
#include <string_view>

#include <cmath>
#include <cstdint>
#include <cstring>
K-H-Ismail's avatar
K-H-Ismail committed
25

26
27
28
29
30
31
/*****************************************************************************
 *
 * Helper macros
 *
 ****************************************************************************/

32
33
34
35
36
#ifndef irt_assert
#include <cassert>
#define irt_assert(_expr) assert(_expr)
#endif

37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#ifndef NDEBUG
#if (defined(__i386__) || defined(__x86_64__)) && defined(__GNUC__) &&         \
  __GNUC__ >= 2
#define irt_breakpoint()                                                       \
    do {                                                                       \
        __asm__ __volatile__("int $03");                                       \
    } while (0)
#elif (defined(_MSC_VER) || defined(__DMC__)) && defined(_M_IX86)
#define irt_breakpoint()                                                       \
    do {                                                                       \
        __asm int 3h                                                           \
    } while (0)
#elif defined(_MSC_VER)
#define irt_breakpoint()                                                       \
    do {                                                                       \
        __debugbreak();                                                        \
    } while (0)
#elif defined(__alpha__) && !defined(__osf__) && defined(__GNUC__) &&          \
  __GNUC__ >= 2
#define irt_breakpoint()                                                       \
    do {                                                                       \
        __asm__ __volatile__("bpt");                                           \
    } while (0)
#elif defined(__APPLE__)
#define irt_breakpoint()                                                       \
    do {                                                                       \
        __builtin_trap();                                                      \
    } while (0)
#else /* !__i386__ && !__alpha__ */
#define irt_breakpoint()                                                       \
    do {                                                                       \
        raise(SIGTRAP);                                                        \
    } while (0)
#endif /* __i386__ */
#else
#define irt_breakpoint()                                                       \
    do {                                                                       \
    } while (0)
#endif

#define irt_bad_return(status__)                                               \
    do {                                                                       \
        irt_breakpoint();                                                      \
        return status__;                                                       \
    } while (0)

#define irt_return_if_bad(expr__)                                              \
    do {                                                                       \
        auto status__ = (expr__);                                              \
        if (status__ != status::success) {                                     \
            irt_breakpoint();                                                  \
            return status__;                                                   \
        }                                                                      \
    } while (0)

#define irt_return_if_fail(expr__, status__)                                   \
    do {                                                                       \
        if (!(expr__)) {                                                       \
            irt_breakpoint();                                                  \
            return status__;                                                   \
        }                                                                      \
    } while (0)

Gauthier Quesnel's avatar
Gauthier Quesnel committed
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
namespace irt {

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using sz = size_t;

/*****************************************************************************
 *
 * Return status of many function
 *
 ****************************************************************************/

enum class status
{
    success,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
122
123
    unknown_dynamics,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
124
125
126
127
128
129
130
131
132
133
134
135
136
137
    block_allocator_bad_capacity,
    block_allocator_not_enough_memory,

    head_allocator_bad_capacity,
    head_allocator_not_enough_memory,

    simulation_not_enough_model,
    simulation_not_enough_memory_message_list_allocator,
    simulation_not_enough_memory_input_port_list_allocator,
    simulation_not_enough_memory_output_port_list_allocator,

    data_array_init_capacity_error,
    data_array_not_enough_memory,

138
139
140
    data_array_archive_init_capacity_error,
    data_array_archive_not_enough_memory,

141
142
143
144
    array_init_capacity_zero,
    array_init_capacity_too_big,
    array_init_not_enough_memory,

145
146
147
148
    vector_init_capacity_zero,
    vector_init_capacity_too_big,
    vector_init_not_enough_memory,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
149
150
151
152
    dynamics_unknown_id,
    dynamics_unknown_port_id,
    dynamics_not_enough_memory,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
153
154
155
    model_connect_output_port_unknown,
    model_connect_input_port_unknown,
    model_connect_already_exist,
156
    model_connect_bad_dynamics,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
157

158
159
160
161
162
163
    model_adder_empty_init_message,
    model_adder_bad_init_message,

    model_mult_empty_init_message,
    model_mult_bad_init_message,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
164
165
166
    model_integrator_dq_error,
    model_integrator_X_error,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
167
168
169
170
    model_integrator_internal_error,
    model_integrator_output_error,
    model_integrator_running_without_x_dot,
    model_integrator_ta_with_bad_x_dot,
171

Gauthier Quesnel's avatar
Gauthier Quesnel committed
172
173
174
175
    model_quantifier_bad_quantum_parameter,
    model_quantifier_bad_archive_length_parameter,
    model_quantifier_shifting_value_neg,
    model_quantifier_shifting_value_less_1,
K-H-Ismail's avatar
K-H-Ismail committed
176
177

    model_time_func_bad_init_message,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
178

179
180
181
    model_flow_bad_samplerate,
    model_flow_bad_data,

182
    gui_not_enough_memory,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
183
184
185
186
187
188
189
190

    io_file_format_error,
    io_file_format_model_error,
    io_file_format_model_number_error,
    io_file_format_model_unknown,
    io_file_format_dynamics_unknown,
    io_file_format_dynamics_limit_reach,
    io_file_format_dynamics_init_error
Gauthier Quesnel's avatar
Gauthier Quesnel committed
191
192
};

193
194
195
196
197
198
constexpr size_t
status_size() noexcept
{
    return static_cast<int>(status::io_file_format_dynamics_init_error) + 1;
}

Gauthier Quesnel's avatar
Gauthier Quesnel committed
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
constexpr bool
is_success(status s) noexcept
{
    return s == status::success;
}

constexpr bool
is_bad(status s) noexcept
{
    return s != status::success;
}

template<typename... Args>
constexpr bool
is_status_equal(status s, Args... args) noexcept
{
    return ((s == args) || ... || false);
}

218
219
220
221
222
223
224
225
226
inline status
check_return(status s) noexcept
{
    if (s != status::success)
        irt_breakpoint();

    return s;
}

227
228
template<typename T, typename... Args>
constexpr bool
229
match(const T& s, Args... args) noexcept
230
231
232
233
{
    return ((s == args) || ... || false);
}

234
235
236
template<class T, class... Rest>
constexpr bool
are_all_same() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
237
{
238
    return (std::is_same_v<T, Rest> && ...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
239
240
}

Gauthier Quesnel's avatar
Gauthier Quesnel committed
241
242
243
244
245
246
247
248
249
template<class T>
typename std::enable_if<!std::numeric_limits<T>::is_integer, bool>::type
almost_equal(T x, T y, int ulp)
{
    return std::fabs(x - y) <=
             std::numeric_limits<T>::epsilon() * std::fabs(x + y) * ulp ||
           std::fabs(x - y) < std::numeric_limits<T>::min();
}

Gauthier Quesnel's avatar
Gauthier Quesnel committed
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
/*****************************************************************************
 *
 * Definition of Time
 *
 * TODO:
 * - enable template definition of float or [float|double,bool absolute]
 *   representation of time?
 *
 ****************************************************************************/

using time = double;

template<typename T>
struct time_domain
{};

template<>
struct time_domain<time>
{
    using time_type = time;

    static constexpr const double infinity =
      std::numeric_limits<double>::infinity();
    static constexpr const double negative_infinity =
      -std::numeric_limits<double>::infinity();
    static constexpr const double zero = 0;

277
    static constexpr bool is_infinity(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
278
279
280
281
    {
        return t == infinity || t == negative_infinity;
    }

282
    static constexpr bool is_zero(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
    {
        return t == zero;
    }
};

/*****************************************************************************
 *
 * Small string
 *
 ****************************************************************************/

template<size_t length = 8>
class small_string
{
    char buffer_[length];
    u8 size_;

public:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
301
302
    using iterator = char*;
    using const_iterator = const char*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
    using size_type = u8;

    static_assert(length > size_t{ 1 } && length < size_t{ 254 });

    constexpr small_string() noexcept
    {
        clear();
    }

    constexpr small_string(const small_string& str) noexcept
    {
        std::copy_n(str.buffer_, str.size_, buffer_);
        buffer_[str.size_] = '\0';
        size_ = str.size_;
    }

    constexpr small_string(small_string&& str) noexcept
    {
        std::copy_n(str.buffer_, str.size_, buffer_);
        buffer_[str.size_] = '\0';
        size_ = str.size_;
        str.clear();
    }

    constexpr small_string& operator=(const small_string& str) noexcept
    {
        if (&str != this) {
            std::copy_n(str.buffer_, str.size_, buffer_);
            buffer_[str.size_] = '\0';
            size_ = str.size_;
        }

        return *this;
    }

    constexpr small_string& operator=(small_string&& str) noexcept
    {
        if (&str != this) {
            std::copy_n(str.buffer_, str.size_, buffer_);
            buffer_[str.size_] = '\0';
            size_ = str.size_;
        }

        return *this;
    }

    constexpr small_string(const char* str) noexcept
    {
        std::strncpy(buffer_, str, length - 1);
        buffer_[length - 1] = '\0';
        size_ = static_cast<u8>(std::strlen(buffer_));
    }

    constexpr small_string(const std::string_view str) noexcept
    {
        assign(str);
    }

    constexpr bool empty() const noexcept
    {
        constexpr unsigned char zero{ 0 };

        return zero == size_;
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
368
369
    constexpr void size(std::size_t sz) noexcept
    {
370
371
        size_ = static_cast<u8>(std::min(sz, length - 1));
        buffer_[size_] = '\0';
Gauthier Quesnel's avatar
Gauthier Quesnel committed
372
373
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
374
375
376
377
378
379
380
    constexpr std::size_t size() const noexcept
    {
        return size_;
    }

    constexpr std::size_t capacity() const noexcept
    {
381
        return length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
382
383
384
385
    }

    constexpr void assign(const std::string_view str) noexcept
    {
386
        const size_t copy_length = std::min(str.size(), length - 1);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
387
388

        std::memcpy(buffer_, str.data(), copy_length);
389
390
391
        buffer_[copy_length] = '\0';

        size_ = static_cast<unsigned char>(copy_length);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
    }

    constexpr std::string_view sv() const noexcept
    {
        return { buffer_, size_ };
    }

    constexpr void append(const std::string_view str) noexcept
    {
        const size_t remaining = length - size_;

        if (remaining) {
            size_t copy = std::min(remaining - 1, str.size());
            std::strncpy(buffer_ + size_, str.data(), copy);
            copy += size_;
            size_ = static_cast<unsigned char>(copy);
            assert(size_ < length);

            buffer_[size_] = '\0';
        }
    }

    constexpr void clear() noexcept
    {
        std::fill_n(buffer_, length, '\0');
        size_ = 0;
    }

    constexpr const char* c_str() const noexcept
    {
        return buffer_;
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
    constexpr iterator begin() noexcept
    {
        return buffer_;
    }

    constexpr iterator end() noexcept
    {
        return buffer_ + size_;
    }

    constexpr const_iterator begin() const noexcept
    {
        return buffer_;
    }

    constexpr const_iterator end() const noexcept
    {
        return buffer_ + size_;
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
    constexpr bool operator==(const small_string& rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs.buffer_, length) == 0;
    }

    constexpr bool operator!=(const small_string& rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs.buffer_, length) != 0;
    }

    constexpr bool operator>(const small_string& rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs.buffer_, length) > 0;
    }

    constexpr bool operator<(const small_string& rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs.buffer_, length) < 0;
    }

    constexpr bool operator==(const char* rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs, length) == 0;
    }

    constexpr bool operator!=(const char* rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs, length) != 0;
    }

    constexpr bool operator>(const char* rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs, length) > 0;
    }

    constexpr bool operator<(const char* rhs) const noexcept
    {
        return std::strncmp(buffer_, rhs, length) < 0;
    }
};

/*****************************************************************************
 *
488
 * value
Gauthier Quesnel's avatar
Gauthier Quesnel committed
489
490
491
 *
 ****************************************************************************/

492
struct message
Gauthier Quesnel's avatar
Gauthier Quesnel committed
493
{
494
495
    using size_type = std::size_t;
    using difference_type = std::ptrdiff_t;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
496

497
498
    double real[3];
    i8 length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
499

500
501
    constexpr std::size_t size() const noexcept
    {
502
503
        assert(length >= 0);
        return static_cast<std::size_t>(length);
504
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
505

506
    constexpr message() noexcept
507
      : real{ 0.0, 0.0, 0.0 }
508
509
      , length{ 0 }
    {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
510

511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
    constexpr message(const double v) noexcept
      : real{ v, 0., 0. }
      , length{ 1 }
    {}

    constexpr message(const double v1, const double v2) noexcept
      : real{ v1, v2, 0. }
      , length{ 2 }
    {}

    constexpr message(const double v1,
                      const double v2,
                      const double v3) noexcept
      : real{ v1, v2, v3 }
      , length{ 3 }
    {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
527

528
    double operator[](const difference_type i) const noexcept
529
    {
530
        return real[i];
Gauthier Quesnel's avatar
Gauthier Quesnel committed
531
    }
532

533
    double& operator[](const difference_type i) noexcept
534
    {
535
        return real[i];
536
    }
537
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
538

539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
/*****************************************************************************
 *
 * Flat list
 *
 ****************************************************************************/

template<typename T>
class block_allocator
{
public:
    static_assert(std::is_trivially_destructible_v<T>,
                  "block_allocator is only for POD object");

    using value_type = T;

    union block
Gauthier Quesnel's avatar
Gauthier Quesnel committed
555
    {
556
557
558
        block* next;
        typename std::aligned_storage<sizeof(T), alignof(T)>::type storage;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
559

560
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
561
    block* blocks{ nullptr };    // contains all preallocated blocks
562
563
564
565
    block* free_head{ nullptr }; // a free list
    sz size{ 0 };                // number of active elements allocated
    sz max_size{ 0 }; // number of elements allocated (with free_head)
    sz capacity{ 0 }; // capacity of the allocator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
566

567
568
public:
    block_allocator() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
569

570
571
    block_allocator(const block_allocator&) = delete;
    block_allocator& operator=(const block_allocator&) = delete;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
572

573
574
575
576
    ~block_allocator() noexcept
    {
        if (blocks)
            std::free(blocks);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
577
578
    }

579
    status init(std::size_t new_capacity) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
580
    {
581
582
        if (new_capacity == 0)
            return status::block_allocator_bad_capacity;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
583

584
585
586
587
588
589
590
591
        if (new_capacity != capacity) {
            if (blocks)
                std::free(blocks);
            blocks =
              static_cast<block*>(std::malloc(new_capacity * sizeof(block)));
            if (blocks == nullptr)
                return status::block_allocator_not_enough_memory;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
592

593
594
595
596
        size = 0;
        max_size = 0;
        capacity = new_capacity;
        free_head = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
597

598
        return status::success;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
599
600
    }

601
    void reset() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
602
    {
603
604
605
606
607
        if (capacity > 0) {
            size = 0;
            max_size = 0;
            free_head = nullptr;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
608
609
    }

610
    std::pair<bool, T*> try_alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
611
    {
612
613
        if (free_head == nullptr && max_size >= capacity)
            return { false, nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
614

615
        return { true, alloc() };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
616
617
    }

618
    T* alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
619
    {
620
621
622
623
624
625
626
627
628
        ++size;
        block* new_block = nullptr;

        if (free_head != nullptr) {
            new_block = free_head;
            free_head = free_head->next;
        } else {
            assert(max_size < capacity);
            new_block = reinterpret_cast<block*>(&blocks[max_size++]);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
629
630
        }

631
        return reinterpret_cast<T*>(new_block);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
632
633
    }

634
    void free(T* n) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
635
    {
636
        assert(n);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
637

638
        block* ptr = reinterpret_cast<block*>(n);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
639

640
641
        ptr->next = free_head;
        free_head = ptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
642

643
        --size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
644

645
646
647
648
        if (size == 0) {         // A special part: if it no longer exists
            max_size = 0;        // we reset the free list and the number
            free_head = nullptr; // of elements allocated.
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
649
    }
650
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
651

652
653
654
655
656
template<typename T>
class flat_list
{
public:
    struct node_type
Gauthier Quesnel's avatar
Gauthier Quesnel committed
657
    {
658
659
660
        T value;
        node_type* next = nullptr;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
661

662
663
664
665
public:
    using allocator_type = block_allocator<node_type>;
    using value_type = T;
    using reference = T&;
666
    using const_reference = const T&;
667
    using pointer = T*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
668

669
    class iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
670
    {
671
672
    private:
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
673

674
675
676
677
678
679
    public:
        using iterator_category = std::forward_iterator_tag;
        using value_type = T;
        using pointer = T*;
        using reference = T&;
        using difference_type = std::ptrdiff_t;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
680

681
        iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
682

683
684
685
        iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
686

687
688
689
        iterator(const iterator& other) noexcept
          : node(other.node)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
690

691
692
693
694
695
        iterator& operator=(const iterator& other) noexcept
        {
            node = other.node;
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
696

697
698
699
700
        T& operator*() noexcept
        {
            return node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
701

702
703
704
705
        T* operator->() noexcept
        {
            return &node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
706

707
708
709
710
        iterator operator++() noexcept
        {
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
711

712
713
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
714

715
716
717
        iterator operator++(int) noexcept
        {
            iterator tmp(*this);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
718

719
720
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
721

722
723
            return tmp;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
724

725
726
727
728
        bool operator==(const iterator& other) const noexcept
        {
            return node == other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
729

730
731
732
733
        bool operator!=(const iterator& other) const noexcept
        {
            return node != other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
734

735
736
737
738
        void swap(iterator& other) noexcept
        {
            std::swap(node, other.node);
        }
739

Gauthier Quesnel's avatar
Gauthier Quesnel committed
740
        friend class flat_list<T>;
741
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
742

743
    class const_iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
744
    {
745
746
    private:
        const node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
747

748
749
750
751
752
753
    public:
        using iterator_category = std::forward_iterator_tag;
        using value_type = T;
        using pointer = T*;
        using reference = T&;
        using difference_type = std::ptrdiff_t;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
754

755
        const_iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
756

757
758
759
        const_iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
760

761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
        const_iterator(const const_iterator& other) noexcept
          : node(other.node)
        {}

        const_iterator& operator=(const const_iterator& other) noexcept
        {
            node = other.node;
            return *this;
        }

        const T& operator*() noexcept
        {
            return node->value;
        }

        const T* operator->() noexcept
        {
            return &node->value;
        }

        const_iterator operator++() noexcept
        {
            if (node != nullptr)
                node = node->next;

            return *this;
        }

        const_iterator operator++(int) noexcept
        {
            const_iterator tmp(*this);

            if (node != nullptr)
                node = node->next;

            return tmp;
        }

        bool operator==(const const_iterator& other) const noexcept
        {
            return node == other.node;
        }

        bool operator!=(const const_iterator& other) const noexcept
        {
            return node != other.node;
        }

        void swap(const_iterator& other) noexcept
        {
            std::swap(node, other.node);
        }
813

Gauthier Quesnel's avatar
Gauthier Quesnel committed
814
        friend class flat_list<T>;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
815
816
    };

817
818
819
private:
    allocator_type* allocator{ nullptr };
    node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
820

821
822
public:
    flat_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
823

824
825
    flat_list(allocator_type* allocator_new) noexcept
      : allocator(allocator_new)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
826
827
    {}

828
829
830
831
832
833
    flat_list(const flat_list& other) = delete;
    flat_list& operator=(const flat_list& other) = delete;

    flat_list(flat_list&& other) noexcept
      : allocator(other.allocator)
      , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
834
    {
835
836
        other.allocator = nullptr;
        other.node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
837
838
    }

839
    void set_allocator(allocator_type* allocator_new) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
840
    {
841
842
843
        clear();
        allocator = allocator_new;
        node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
844
845
    }

846
    flat_list& operator=(flat_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
847
    {
848
849
850
851
852
853
854
855
856
        if (this != &other) {
            clear();
            allocator = other.allocator;
            other.allocator = nullptr;
            node = other.node;
            other.node = nullptr;
        }

        return *this;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
857
858
    }

859
    ~flat_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
860
    {
861
        clear();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
862
863
    }

864
    void clear() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
865
    {
866
867
868
869
870
871
872
        node_type* prev = node;

        while (node != nullptr) {
            node = node->next;
            allocator->free(prev);
            prev = node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
873
874
    }

875
    bool empty() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
876
    {
877
        return node == nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
878
879
    }

880
    iterator begin() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
881
    {
882
883
        return iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
884

885
886
887
888
    iterator end() noexcept
    {
        return iterator(nullptr);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
889

890
891
892
893
    const_iterator begin() const noexcept
    {
        return const_iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
894

895
896
897
    const_iterator end() const noexcept
    {
        return const_iterator(nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
898
899
    }

900
901
902
903
904
905
906
907
908
909
910
911
912
913
    reference front() noexcept
    {
        assert(!empty());

        return node->value;
    }

    const_reference front() const noexcept
    {
        assert(!empty());

        return node->value;
    }

914
915
    template<typename... Args>
    iterator emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
916
    {
917
        node_type* new_node = allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
918

919
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
920

921
922
        new_node->next = node;
        node = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
923

924
        return begin();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
925
926
    }

927
928
    template<typename... Args>
    iterator emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
929
    {
930
931
        node_type* new_node = allocator->alloc();
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
932

933
934
        if (it->node == nullptr)
            return emplace_front(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
935

936
937
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
938

939
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
940
941
    }

942
943
    template<typename... Args>
    iterator try_emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
944
    {
945
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
946

947
948
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
949

950
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
951

952
953
954
955
        new_node->next = node;
        node = new_node;

        return begin();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
956
957
    }

958
959
    template<typename... Args>
    iterator try_emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
960
    {
961
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
962

963
964
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
965

966
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
967

968
969
        if (it->node == nullptr)
            return emplace_front(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
970

971
972
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
973

974
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
975
976
    }

977
    void pop_front() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
978
    {
979
980
        if (node == nullptr)
            return;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
981

982
983
        node_type* to_delete = node;
        node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
984

985
        if constexpr (!std::is_trivial_v<T>)
986
            to_delete->value.~T();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
987

988
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
989
990
    }

991
    iterator erase_after(iterator it) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
992
    {
993
        assert(allocator);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
994

995
996
        if (it.node == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
997

998
999
1000
        node_type* to_delete = it.node->next;
        if (to_delete == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1001

1002
1003
        node_type* next = to_delete->next;
        it.node->next = next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1004

1005
        if constexpr (!std::is_trivial_v<T>)
1006
            to_delete->value.~T();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1007

1008
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1009

1010
        return iterator(next);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1011
1012
1013
1014
    }
};

template<typename T>
1015
class flat_double_list
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1016
{
1017
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1018
1019
1020
1021
    struct node_type
    {
        T value;
        node_type* next = nullptr;
1022
        node_type* prev = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
    };

public:
    using allocator_type = block_allocator<node_type>;
    using value_type = T;
    using reference = T&;
    using pointer = T*;

    class iterator
    {
    private:
1034
        flat_double_list* list{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1035
1036
1037
        node_type* node{ nullptr };

    public:
1038
        using iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1039
1040
1041
1042
1043
1044
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        iterator() noexcept = default;

1045
1046
1047
        iterator(flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1048
1049
1050
        {}

        iterator(const iterator& other) noexcept
1051
1052
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1053
1054
1055
1056
        {}

        iterator& operator=(const iterator& other) noexcept
        {
1057
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1058
1059
1060
1061
1062
1063
1064
1065
1066
            node = other.node;
            return *this;
        }

        T& operator*() noexcept
        {
            return node->value;
        }

1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
        T* operator*() const noexcept
        {
            return node->value;
        }

        pointer operator->() noexcept
        {
            return &(node->value);
        }

        pointer operator->() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1078
1079
1080
1081
1082
1083
        {
            return &node->value;
        }

        iterator operator++() noexcept
        {
1084
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1085
1086
1087
1088
1089
1090
1091
1092

            return *this;
        }

        iterator operator++(int) noexcept
        {
            iterator tmp(*this);

1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
            node = (node == nullptr) ? list->m_front : node->next;

            return tmp;
        }

        iterator operator--() noexcept
        {
            node = (node == nullptr) ? list->m_back : node->prev;

            return *this;
        }

        iterator operator--(int) noexcept
        {
            iterator tmp(*this);

            node = (node == nullptr) ? list->m_back : node->prev;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125

            return tmp;
        }

        bool operator==(const iterator& other) const noexcept
        {
            return node == other.node;
        }

        bool operator!=(const iterator& other) const noexcept
        {
            return node != other.node;
        }

        void swap(iterator& other) noexcept
        {
1126
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1127
1128
1129
1130
1131
1132
1133
            std::swap(node, other.node);
        }
    };

    class const_iterator
    {
    private:
1134
1135
        const flat_double_list* list{ nullptr };
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1136
1137

    public:
1138
        using const_iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1139
1140
1141
1142
1143
1144
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        const_iterator() noexcept = default;

1145
1146
1147
        const_iterator(const flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1148
1149
1150
        {}

        const_iterator(const const_iterator& other) noexcept
1151
1152
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1153
1154
1155
1156
        {}

        const_iterator& operator=(const const_iterator& other) noexcept
        {
1157
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
            node = other.node;
            return *this;
        }

        const T& operator*() noexcept
        {
            return node->value;
        }

        const T* operator->() noexcept
        {
1169
            return &(node->value);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1170
1171
1172
1173
        }

        const_iterator operator++() noexcept
        {
1174
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1175
1176
1177
1178
1179
1180
1181
1182

            return *this;
        }

        const_iterator operator++(int) noexcept
        {
            const_iterator tmp(*this);

1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
            node = (node == nullptr) ? list->m_front : node->next;

            return tmp;
        }

        const_iterator operator--() noexcept
        {
            node = (node == nullptr) ? list->m_back : node->prev;

            return *this;
        }

        const_iterator operator--(int) noexcept
        {
            const_iterator tmp(*this);

            node = (node == nullptr) ? list->m_back : node->prev;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215

            return tmp;
        }

        bool operator==(const const_iterator& other) const noexcept
        {
            return node == other.node;
        }

        bool operator!=(const const_iterator& other) const noexcept
        {
            return node != other.node;
        }

        void swap(const_iterator& other) noexcept
        {
1216
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1217
1218
1219
1220
1221
            std::swap(node, other.node);
        }
    };

private:
1222
1223
1224
1225
    allocator_type* m_allocator{ nullptr };
    node_type* m_front{ nullptr };
    node_type* m_back{ nullptr };
    i64 m_size{ 0 };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1226
1227

public:
1228
    flat_double_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1229

1230
1231
    flat_double_list(allocator_type* allocator)
      : m_allocator(allocator)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1232
1233
    {}

1234
1235
    flat_double_list(const flat_double_list& other) = delete;
    flat_double_list& operator=(const flat_double_list& other) = delete;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1236

1237
1238
1239
1240
1241
    flat_double_list(flat_double_list&& other) noexcept
      : m_allocator(other.m_allocator)
      , m_front(other.m_front)
      , m_back(other.m_back)
      , m_size(other.m_size)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1242
    {
1243
1244
1245
1246
        other.m_allocator = nullptr;
        other.m_front = nullptr;
        other.m_back = nullptr;
        other.m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1247
1248
    }

1249
    void set_allocator(allocator_type* allocator) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1250
1251
    {
        clear();
1252
1253
1254
1255
        m_allocator = allocator;
        m_front = nullptr;
        m_back = nullptr;
        m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1256
1257
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
1258
1259
1260
1261
1262
    allocator_type* get_allocator() const noexcept
    {
        return m_allocator;
    }

1263
    flat_double_list& operator=(flat_double_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1264
1265
1266
    {
        if (this != &other) {
            clear();
1267
1268
1269
1270
1271
1272
1273
1274
            m_allocator = other.m_allocator;
            other.m_allocator = nullptr;
            m_front = other.m_front;
            other.m_front = nullptr;
            m_back = other.m_back;
            other.m_back = nullptr;
            m_size = other.m_size;
            other.m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1275
1276
1277
1278
1279
        }

        return *this;
    }

1280
    ~flat_double_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1281
1282
1283
1284
1285
1286
    {
        clear();
    }

    void clear() noexcept
    {
1287
        node_type* prev = m_front;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1288

1289
1290
1291
1292
        while (m_front != nullptr) {
            m_front = m_front->next;
            m_allocator->free(prev);
            prev = m_front;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1293
1294
        }

1295
1296
        m_size = 0;
        m_back = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1297
1298
1299
1300
    }

    iterator begin() noexcept
    {
1301
        return iterator(this, m_front);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1302
1303
1304
1305
    }

    iterator end() noexcept
    {
1306
        return iterator(this, nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1307
1308
1309
1310
    }

    const_iterator begin() const noexcept
    {
1311
        return const_iterator(this, m_front);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1312
1313
1314
1315
    }

    const_iterator end() const noexcept
    {
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
        return const_iterator(this, nullptr);
    }

    reference front() noexcept
    {
        return m_front->value;
    }

    reference back() noexcept
    {
        return m_back->value;
    }

    reference front() const noexcept
    {
        return m_front->value;
    }

    reference back() const noexcept
    {
        return m_back->value;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1337
1338
1339
1340
1341
    }

    template<typename... Args>
    iterator emplace_front(Args&&... args) noexcept
    {
1342
        node_type* new_node = m_allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1343
        new (&new_node->value) T(std::forward<Args>(args)...);
1344
        ++m_size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1345

1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
        if (m_front) {
            new_node->prev = nullptr;
            new_node->next = m_front;
            m_front->prev = new_node;
            m_front = new_node;
        } else {
            new_node->prev = nullptr;
            new_node->next = nullptr;
            m_front = new_node;
            m_back = new_node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1357
1358
1359
1360
1361

        return begin();
    }

    template<typename... Args>
1362
    iterator emplace_back(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1363
    {
1364
        node_type* new_node = m_allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1365
        new (&new_node->value) T(std::forward<Args>(args)...);
1366
        ++m_size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1367

1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
        if (m_back) {
            new_node->prev = m_back;
            new_node->next = nullptr;
            m_back->next = new_node;
            m_back = new_node;
        } else {
            new_node->prev = nullptr;
            new_node->next = nullptr;
            m_front = new_node;
            m_back = new_node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1379

1380
        return iterator(this, new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1381
1382
1383
1384
1385
    }

    template<typename... Args>
    iterator try_emplace_front(Args&&... args) noexcept
    {
1386
        auto [success, new_node] = m_allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1387
1388
1389
1390
1391

        if (!success)
            return end();

        new (&new_node->value) T(std::forward<Args>(args)...);
1392
        ++m_size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1393