core.hpp 157 KB
Newer Older
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
// 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>
#include <string_view>

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

K-H-Ismail's avatar
K-H-Ismail committed
16
17
#include <vector>

18
19
20
21
22
23
/*****************************************************************************
 *
 * Helper macros
 *
 ****************************************************************************/

24
25
26
27
28
#ifndef irt_assert
#include <cassert>
#define irt_assert(_expr) assert(_expr)
#endif

29
30
31
32
33
34
35
36
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
#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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
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
114
115
    unknown_dynamics,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
116
117
118
119
120
121
122
123
124
125
126
127
128
129
    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,

130
131
132
    data_array_archive_init_capacity_error,
    data_array_archive_not_enough_memory,

133
134
135
136
    array_init_capacity_zero,
    array_init_capacity_too_big,
    array_init_not_enough_memory,

137
138
139
140
    vector_init_capacity_zero,
    vector_init_capacity_too_big,
    vector_init_not_enough_memory,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
141
142
143
144
    dynamics_unknown_id,
    dynamics_unknown_port_id,
    dynamics_not_enough_memory,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
145
146
147
    model_connect_output_port_unknown,
    model_connect_input_port_unknown,
    model_connect_already_exist,
148
    model_connect_bad_dynamics,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
149

150
151
152
153
154
155
    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
156
157
158
    model_integrator_dq_error,
    model_integrator_X_error,

Gauthier Quesnel's avatar
Gauthier Quesnel committed
159
160
161
162
    model_integrator_internal_error,
    model_integrator_output_error,
    model_integrator_running_without_x_dot,
    model_integrator_ta_with_bad_x_dot,
163

Gauthier Quesnel's avatar
Gauthier Quesnel committed
164
165
166
167
    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
168
169

    model_time_func_bad_init_message,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
170

171
    gui_not_enough_memory,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
172
173
174
175
176
177
178
179

    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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
};

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);
}

201
202
203
204
205
206
207
208
209
inline status
check_return(status s) noexcept
{
    if (s != status::success)
        irt_breakpoint();

    return s;
}

210
211
template<typename T, typename... Args>
constexpr bool
212
match(const T& s, Args... args) noexcept
213
214
215
216
{
    return ((s == args) || ... || false);
}

217
218
219
template<class T, class... Rest>
constexpr bool
are_all_same() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
220
{
221
    return (std::is_same_v<T, Rest> && ...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
}

/*****************************************************************************
 *
 * 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;

251
    static constexpr bool is_infinity(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
252
253
254
255
    {
        return t == infinity || t == negative_infinity;
    }

256
    static constexpr bool is_zero(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
    {
        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
275
276
    using iterator = char*;
    using const_iterator = const char*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
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
    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
342
343
    constexpr void size(std::size_t sz) noexcept
    {
344
345
        size_ = static_cast<u8>(std::min(sz, length - 1));
        buffer_[size_] = '\0';
Gauthier Quesnel's avatar
Gauthier Quesnel committed
346
347
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
348
349
350
351
352
353
354
    constexpr std::size_t size() const noexcept
    {
        return size_;
    }

    constexpr std::size_t capacity() const noexcept
    {
355
        return length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
356
357
358
359
    }

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

        std::memcpy(buffer_, str.data(), copy_length);
363
364
365
        buffer_[copy_length] = '\0';

        size_ = static_cast<unsigned char>(copy_length);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
    }

    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
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
    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
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
    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;
    }
};

/*****************************************************************************
 *
462
 * value
Gauthier Quesnel's avatar
Gauthier Quesnel committed
463
464
465
 *
 ****************************************************************************/

466
struct message
Gauthier Quesnel's avatar
Gauthier Quesnel committed
467
{
468
469
    using size_type = std::size_t;
    using difference_type = std::ptrdiff_t;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
470

471
472
    double real[3];
    i8 length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
473

474
475
    constexpr std::size_t size() const noexcept
    {
476
477
        assert(length >= 0);
        return static_cast<std::size_t>(length);
478
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
479

480
    constexpr message() noexcept
481
      : real{ 0.0, 0.0, 0.0 }
482
483
      , length{ 0 }
    {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
484

485
486
    template<typename... T>
    constexpr message(T... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
487
    {
488
489
        if constexpr (are_all_same<double, T...>()) {
            static_assert(sizeof...(args) <= 3, "double message limited to 3");
490
491
            using unused = double[];
            length = 0;
492
            (void)unused{ 0.0, (real[length++] = args, 0.0)... };
493
494
        }
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
495

496
    double operator[](const difference_type i) const noexcept
497
    {
498
499
        irt_assert(i < static_cast<std::ptrdiff_t>(length));
        return real[i];
Gauthier Quesnel's avatar
Gauthier Quesnel committed
500
    }
501

502
    double& operator[](const difference_type i) noexcept
503
    {
504
505
        irt_assert(i < static_cast<std::ptrdiff_t>(length));
        return real[i];
506
    }
507
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
508

509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
/*****************************************************************************
 *
 * 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
525
    {
526
527
528
        block* next;
        typename std::aligned_storage<sizeof(T), alignof(T)>::type storage;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
529

530
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
531
    block* blocks{ nullptr };    // contains all preallocated blocks
532
533
534
535
    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
536

537
538
public:
    block_allocator() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
539

540
541
    block_allocator(const block_allocator&) = delete;
    block_allocator& operator=(const block_allocator&) = delete;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
542

543
544
545
546
    ~block_allocator() noexcept
    {
        if (blocks)
            std::free(blocks);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
547
548
    }

549
    status init(std::size_t new_capacity) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
550
    {
551
552
        if (new_capacity == 0)
            return status::block_allocator_bad_capacity;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
553

554
555
556
557
558
559
560
561
        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
562

563
564
565
566
        size = 0;
        max_size = 0;
        capacity = new_capacity;
        free_head = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
567

568
        return status::success;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
569
570
    }

571
    void reset() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
572
    {
573
574
575
576
577
        if (capacity > 0) {
            size = 0;
            max_size = 0;
            free_head = nullptr;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
578
579
    }

580
    std::pair<bool, T*> try_alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
581
    {
582
583
        if (free_head == nullptr && max_size >= capacity)
            return { false, nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
584

585
        return { true, alloc() };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
586
587
    }

588
    T* alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
589
    {
590
591
592
593
594
595
596
597
598
        ++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
599
600
        }

601
        return reinterpret_cast<T*>(new_block);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
602
603
    }

604
    void free(T* n) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
605
    {
606
        assert(n);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
607

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

610
611
        ptr->next = free_head;
        free_head = ptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
612

613
        --size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
614

615
616
617
618
        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
619
    }
620
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
621

622
623
624
625
626
template<typename T>
class flat_list
{
public:
    struct node_type
Gauthier Quesnel's avatar
Gauthier Quesnel committed
627
    {
628
629
630
        T value;
        node_type* next = nullptr;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
631

632
633
634
635
public:
    using allocator_type = block_allocator<node_type>;
    using value_type = T;
    using reference = T&;
636
    using const_reference = const T&;
637
    using pointer = T*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
638

639
    class iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
640
    {
641
642
    private:
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
643

644
645
646
647
648
649
    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
650

651
        iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
652

653
654
655
        iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
656

657
658
659
        iterator(const iterator& other) noexcept
          : node(other.node)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
660

661
662
663
664
665
        iterator& operator=(const iterator& other) noexcept
        {
            node = other.node;
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
666

667
668
669
670
        T& operator*() noexcept
        {
            return node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
671

672
673
674
675
        T* operator->() noexcept
        {
            return &node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
676

677
678
679
680
        iterator operator++() noexcept
        {
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
681

682
683
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
684

685
686
687
        iterator operator++(int) noexcept
        {
            iterator tmp(*this);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
688

689
690
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
691

692
693
            return tmp;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
694

695
696
697
698
        bool operator==(const iterator& other) const noexcept
        {
            return node == other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
699

700
701
702
703
        bool operator!=(const iterator& other) const noexcept
        {
            return node != other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
704

705
706
707
708
        void swap(iterator& other) noexcept
        {
            std::swap(node, other.node);
        }
709

Gauthier Quesnel's avatar
Gauthier Quesnel committed
710
        friend class flat_list<T>;
711
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
712

713
    class const_iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
714
    {
715
716
    private:
        const node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
717

718
719
720
721
722
723
    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
724

725
        const_iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
726

727
728
729
        const_iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
730

731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
        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);
        }
783

Gauthier Quesnel's avatar
Gauthier Quesnel committed
784
        friend class flat_list<T>;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
785
786
    };

787
788
789
private:
    allocator_type* allocator{ nullptr };
    node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
790

791
792
public:
    flat_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
793

794
795
    flat_list(allocator_type* allocator_new) noexcept
      : allocator(allocator_new)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
796
797
    {}

798
799
800
801
802
803
    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
804
    {
805
806
        other.allocator = nullptr;
        other.node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
807
808
    }

809
    void set_allocator(allocator_type* allocator_new) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
810
    {
811
812
813
        clear();
        allocator = allocator_new;
        node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
814
815
    }

816
    flat_list& operator=(flat_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
817
    {
818
819
820
821
822
823
824
825
826
        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
827
828
    }

829
    ~flat_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
830
    {
831
        clear();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
832
833
    }

834
    void clear() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
835
    {
836
837
838
839
840
841
842
        node_type* prev = node;

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

845
    bool empty() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
846
    {
847
        return node == nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
848
849
    }

850
    iterator begin() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
851
    {
852
853
        return iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
854

855
856
857
858
    iterator end() noexcept
    {
        return iterator(nullptr);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
859

860
861
862
863
    const_iterator begin() const noexcept
    {
        return const_iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
864

865
866
867
    const_iterator end() const noexcept
    {
        return const_iterator(nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
868
869
    }

870
871
872
873
874
875
876
877
878
879
880
881
882
883
    reference front() noexcept
    {
        assert(!empty());

        return node->value;
    }

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

        return node->value;
    }

884
885
    template<typename... Args>
    iterator emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
886
    {
887
        node_type* new_node = allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
888

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

891
892
        new_node->next = node;
        node = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
893

894
        return begin();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
895
896
    }

897
898
    template<typename... Args>
    iterator emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
899
    {
900
901
        node_type* new_node = allocator->alloc();
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
902

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

906
907
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
908

909
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
910
911
    }

912
913
    template<typename... Args>
    iterator try_emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
914
    {
915
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
916

917
918
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
919

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

922
923
924
925
        new_node->next = node;
        node = new_node;

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

928
929
    template<typename... Args>
    iterator try_emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
930
    {
931
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
932

933
934
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
935

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

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

941
942
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
943

944
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
945
946
    }

947
    void pop_front() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
948
    {
949
950
        if (node == nullptr)
            return;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
951

952
953
        node_type* to_delete = node;
        node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
954

955
        if constexpr (!std::is_trivial_v<T>)
956
            to_delete->value.~T();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
957

958
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
959
960
    }

961
    iterator erase_after(iterator it) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
962
    {
963
        assert(allocator);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
964

965
966
        if (it.node == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
967

968
969
970
        node_type* to_delete = it.node->next;
        if (to_delete == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
971

972
973
        node_type* next = to_delete->next;
        it.node->next = next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
974

975
        if constexpr (!std::is_trivial_v<T>)
976
            to_delete->value.~T();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
977

978
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
979

980
        return iterator(next);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
981
982
983
984
    }
};

template<typename T>
985
class flat_double_list
Gauthier Quesnel's avatar
Gauthier Quesnel committed
986
{
987
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
988
989
990
991
    struct node_type
    {
        T value;
        node_type* next = nullptr;
992
        node_type* prev = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
993
994
995
996
997
998
999
1000
1001
1002
1003
    };

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

    class iterator
    {
    private:
1004
        flat_double_list* list{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1005
1006
1007
        node_type* node{ nullptr };

    public:
1008
        using iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1009
1010
1011
1012
1013
1014
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        iterator() noexcept = default;

1015
1016
1017
        iterator(flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1018
1019
1020
        {}

        iterator(const iterator& other) noexcept
1021
1022
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1023
1024
1025
1026
        {}

        iterator& operator=(const iterator& other) noexcept
        {
1027
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1028
1029
1030
1031
1032
1033
1034
1035
1036
            node = other.node;
            return *this;
        }

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

1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
        T* operator*() const noexcept
        {
            return node->value;
        }

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

        pointer operator->() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1048
1049
1050
1051
1052
1053
        {
            return &node->value;
        }

        iterator operator++() noexcept
        {
1054
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1055
1056
1057
1058
1059
1060
1061
1062

            return *this;
        }

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

1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
            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
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095

            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
        {
1096
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1097
1098
1099
1100
1101
1102
1103
            std::swap(node, other.node);
        }
    };

    class const_iterator
    {
    private:
1104
1105
        const flat_double_list* list{ nullptr };
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1106
1107

    public:
1108
        using const_iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1109
1110
1111
1112
1113
1114
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        const_iterator() noexcept = default;

1115
1116
1117
        const_iterator(const flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1118
1119
1120
        {}

        const_iterator(const const_iterator& other) noexcept
1121
1122
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1123
1124
1125
1126
        {}

        const_iterator& operator=(const const_iterator& other) noexcept
        {
1127
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
            node = other.node;
            return *this;
        }

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

        const T* operator->() noexcept
        {
1139
            return &(node->value);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1140
1141
1142
1143
        }

        const_iterator operator++() noexcept
        {
1144
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1145
1146
1147
1148
1149
1150
1151
1152

            return *this;
        }

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

1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
            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
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185

            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
        {
1186
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1187
1188
1189
1190
1191
            std::swap(node, other.node);
        }
    };

private:
1192
1193
1194
1195
    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
1196
1197

public:
1198
    flat_double_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1199

1200
1201
    flat_double_list(allocator_type* allocator)
      : m_allocator(allocator)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1202
1203
    {}

1204
1205
    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
1206

1207
1208
1209
1210
1211
    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
1212
    {
1213
1214
1215
1216
        other.m_allocator = nullptr;
        other.m_front = nullptr;
        other.m_back = nullptr;
        other.m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1217
1218
    }

1219
    void set_allocator(allocator_type* allocator) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1220
1221
    {
        clear();
1222
1223
1224
1225
        m_allocator = allocator;
        m_front = nullptr;
        m_back = nullptr;
        m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1226
1227
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
1228
1229
1230
1231
1232
    allocator_type* get_allocator() const noexcept
    {
        return m_allocator;
    }

1233
    flat_double_list& operator=(flat_double_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1234
1235
1236
    {
        if (this != &other) {
            clear();
1237
1238
1239
1240
1241
1242
1243
1244
            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
1245
1246
1247
1248
1249
        }

        return *this;
    }

1250
    ~flat_double_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1251
1252
1253
1254
1255
1256
    {
        clear();
    }

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

1259
1260
1261
1262
        while (m_front != nullptr) {
            m_front = m_front->next;
            m_allocator->free(prev);
            prev = m_front;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1263
1264
        }

1265
1266
        m_size = 0;
        m_back = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1267
1268
1269
1270
    }

    iterator begin() noexcept
    {
1271
        return iterator(this, m_front);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1272
1273
1274
1275
    }

    iterator end() noexcept
    {
1276
        return iterator(this, nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1277
1278
1279
1280
    }

    const_iterator begin() const noexcept
    {
1281
        return const_iterator(this, m_front);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1282
1283
1284
1285
    }

    const_iterator end() const noexcept
    {
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
        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
1307
1308
1309
1310
1311
    }

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

1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
        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
1327
1328
1329
1330
1331

        return begin();
    }

    template<typename... Args>
1332
    iterator emplace_back(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1333
    {
1334
        node_type* new_node = m_allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1335
        new (&new_node->value) T(std::forward<Args>(args)...);
1336
        ++m_size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1337

1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
        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
1349

1350
        return iterator(this, new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1351
1352
1353
1354
1355
    }

    template<typename... Args>
    iterator try_emplace_front(Args&&... args) noexcept
    {
1356
        auto [success, new_node] = m_allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1357
1358
1359
1360
1361

        if (!success)
            return end();

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

1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
        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
1375
1376
1377
1378
1379

        return begin();
    }

    template<typename... Args>
1380
    iterator try_emplace_back(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1381
    {
1382
        auto [success, new_node] = m_allocator->try_alloc();