core.hpp 182 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
199
constexpr i8
status_last() noexcept
{
    return static_cast<i8>(status::io_file_format_dynamics_init_error);
}

constexpr sz
200
201
status_size() noexcept
{
202
    return static_cast<sz>(status_last() + 1);
203
204
}

Gauthier Quesnel's avatar
Gauthier Quesnel committed
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
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);
}

224
225
226
227
228
229
230
231
232
inline status
check_return(status s) noexcept
{
    if (s != status::success)
        irt_breakpoint();

    return s;
}

233
234
template<typename T, typename... Args>
constexpr bool
235
match(const T& s, Args... args) noexcept
236
237
238
239
{
    return ((s == args) || ... || false);
}

240
241
242
template<class T, class... Rest>
constexpr bool
are_all_same() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
243
{
244
    return (std::is_same_v<T, Rest> && ...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
245
246
}

Gauthier Quesnel's avatar
Gauthier Quesnel committed
247
248
249
250
251
252
253
254
255
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
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
/*****************************************************************************
 *
 * 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;

283
    static constexpr bool is_infinity(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
284
285
286
287
    {
        return t == infinity || t == negative_infinity;
    }

288
    static constexpr bool is_zero(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
    {
        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
307
308
    using iterator = char*;
    using const_iterator = const char*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
368
369
370
371
372
373
    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
374
375
    constexpr void size(std::size_t sz) noexcept
    {
376
377
        size_ = static_cast<u8>(std::min(sz, length - 1));
        buffer_[size_] = '\0';
Gauthier Quesnel's avatar
Gauthier Quesnel committed
378
379
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
380
381
382
383
384
385
386
    constexpr std::size_t size() const noexcept
    {
        return size_;
    }

    constexpr std::size_t capacity() const noexcept
    {
387
        return length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
388
389
390
391
    }

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

        std::memcpy(buffer_, str.data(), copy_length);
395
396
397
        buffer_[copy_length] = '\0';

        size_ = static_cast<unsigned char>(copy_length);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
    }

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

    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
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
    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
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
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
    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;
    }
};

/*****************************************************************************
 *
479
 * value
Gauthier Quesnel's avatar
Gauthier Quesnel committed
480
481
482
 *
 ****************************************************************************/

483
struct message
Gauthier Quesnel's avatar
Gauthier Quesnel committed
484
{
485
486
    using size_type = std::size_t;
    using difference_type = std::ptrdiff_t;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
487

488
489
    double real[3];
    i8 length;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
490

491
492
    constexpr std::size_t size() const noexcept
    {
493
494
        assert(length >= 0);
        return static_cast<std::size_t>(length);
495
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
496

497
    constexpr message() noexcept
498
      : real{ 0.0, 0.0, 0.0 }
499
500
      , length{ 0 }
    {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
501

502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
    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
518

519
    double operator[](const difference_type i) const noexcept
520
    {
521
        return real[i];
Gauthier Quesnel's avatar
Gauthier Quesnel committed
522
    }
523

524
    double& operator[](const difference_type i) noexcept
525
    {
526
        return real[i];
527
    }
528
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
529

530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
/*****************************************************************************
 *
 * 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
546
    {
547
548
549
        block* next;
        typename std::aligned_storage<sizeof(T), alignof(T)>::type storage;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
550

551
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
552
    block* blocks{ nullptr };    // contains all preallocated blocks
553
554
555
556
    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
557

558
559
public:
    block_allocator() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
560

561
562
    block_allocator(const block_allocator&) = delete;
    block_allocator& operator=(const block_allocator&) = delete;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
563

564
565
566
567
    ~block_allocator() noexcept
    {
        if (blocks)
            std::free(blocks);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
568
569
    }

570
    status init(std::size_t new_capacity) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
571
    {
572
573
        if (new_capacity == 0)
            return status::block_allocator_bad_capacity;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
574

575
576
577
578
579
580
581
582
        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
583

584
585
586
587
        size = 0;
        max_size = 0;
        capacity = new_capacity;
        free_head = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
588

589
        return status::success;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
590
591
    }

592
    void reset() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
593
    {
594
595
596
597
598
        if (capacity > 0) {
            size = 0;
            max_size = 0;
            free_head = nullptr;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
599
600
    }

601
    std::pair<bool, T*> try_alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
602
    {
603
604
        if (free_head == nullptr && max_size >= capacity)
            return { false, nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
605

606
        return { true, alloc() };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
607
608
    }

609
    T* alloc() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
610
    {
611
612
613
614
615
616
617
618
619
        ++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
620
621
        }

622
        return reinterpret_cast<T*>(new_block);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
623
624
    }

625
    void free(T* n) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
626
    {
627
        assert(n);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
628

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

631
632
        ptr->next = free_head;
        free_head = ptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
633

634
        --size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
635

636
637
638
639
        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
640
    }
641
};
Gauthier Quesnel's avatar
Gauthier Quesnel committed
642

643
644
645
646
647
template<typename T>
class flat_list
{
public:
    struct node_type
Gauthier Quesnel's avatar
Gauthier Quesnel committed
648
    {
649
650
651
        T value;
        node_type* next = nullptr;
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
652

653
654
655
656
public:
    using allocator_type = block_allocator<node_type>;
    using value_type = T;
    using reference = T&;
657
    using const_reference = const T&;
658
    using pointer = T*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
659

660
    class iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
661
    {
662
663
    private:
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
664

665
666
667
668
669
670
    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
671

672
        iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
673

674
675
676
        iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
677

678
679
680
        iterator(const iterator& other) noexcept
          : node(other.node)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
681

682
683
684
685
686
        iterator& operator=(const iterator& other) noexcept
        {
            node = other.node;
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
687

688
689
690
691
        T& operator*() noexcept
        {
            return node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
692

693
694
695
696
        T* operator->() noexcept
        {
            return &node->value;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
697

698
699
700
701
        iterator operator++() noexcept
        {
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
702

703
704
            return *this;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
705

706
707
708
        iterator operator++(int) noexcept
        {
            iterator tmp(*this);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
709

710
711
            if (node != nullptr)
                node = node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
712

713
714
            return tmp;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
715

716
717
718
719
        bool operator==(const iterator& other) const noexcept
        {
            return node == other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
720

721
722
723
724
        bool operator!=(const iterator& other) const noexcept
        {
            return node != other.node;
        }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
725

726
727
728
729
        void swap(iterator& other) noexcept
        {
            std::swap(node, other.node);
        }
730

Gauthier Quesnel's avatar
Gauthier Quesnel committed
731
        friend class flat_list<T>;
732
    };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
733

734
    class const_iterator
Gauthier Quesnel's avatar
Gauthier Quesnel committed
735
    {
736
737
    private:
        const node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
738

739
740
741
742
743
744
    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
745

746
        const_iterator() noexcept = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
747

748
749
750
        const_iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
        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);
        }
804

Gauthier Quesnel's avatar
Gauthier Quesnel committed
805
        friend class flat_list<T>;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
806
807
    };

808
809
810
private:
    allocator_type* allocator{ nullptr };
    node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
811

812
813
public:
    flat_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
814

815
816
    flat_list(allocator_type* allocator_new) noexcept
      : allocator(allocator_new)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
817
818
    {}

819
820
821
822
823
824
    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
825
    {
826
827
        other.allocator = nullptr;
        other.node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
828
829
    }

830
    void set_allocator(allocator_type* allocator_new) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
831
    {
832
833
834
        clear();
        allocator = allocator_new;
        node = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
835
836
    }

837
    flat_list& operator=(flat_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
838
    {
839
840
841
842
843
844
845
846
847
        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
848
849
    }

850
    ~flat_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
851
    {
852
        clear();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
853
854
    }

855
    void clear() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
856
    {
857
858
859
860
861
862
863
        node_type* prev = node;

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

866
    bool empty() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
867
    {
868
        return node == nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
869
870
    }

871
    iterator begin() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
872
    {
873
874
        return iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
875

876
877
878
879
    iterator end() noexcept
    {
        return iterator(nullptr);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
880

881
882
883
884
    const_iterator begin() const noexcept
    {
        return const_iterator(node);
    }
Gauthier Quesnel's avatar
Gauthier Quesnel committed
885

886
887
888
    const_iterator end() const noexcept
    {
        return const_iterator(nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
889
890
    }

891
892
893
894
895
896
897
898
899
900
901
902
903
904
    reference front() noexcept
    {
        assert(!empty());

        return node->value;
    }

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

        return node->value;
    }

905
906
    template<typename... Args>
    iterator emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
907
    {
908
        node_type* new_node = allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
909

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

912
913
        new_node->next = node;
        node = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
914

915
        return begin();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
916
917
    }

918
919
    template<typename... Args>
    iterator emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
920
    {
921
922
        node_type* new_node = allocator->alloc();
        new (&new_node->value) T(std::forward<Args>(args)...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
923

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

927
928
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
929

930
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
931
932
    }

933
934
    template<typename... Args>
    iterator try_emplace_front(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
935
    {
936
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
937

938
939
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
940

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

943
944
945
946
        new_node->next = node;
        node = new_node;

        return begin();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
947
948
    }

949
950
    template<typename... Args>
    iterator try_emplace_after(iterator it, Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
951
    {
952
        auto [success, new_node] = allocator->try_alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
953

954
955
        if (!success)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
956

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

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

962
963
        new_node->next = it->node->next;
        it->node->next = new_node;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
964

965
        return iterator(new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
966
967
    }

968
    void pop_front() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
969
    {
970
971
        if (node == nullptr)
            return;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
972

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

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

979
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
980
981
    }

982
    iterator erase_after(iterator it) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
983
    {
984
        assert(allocator);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
985

986
987
        if (it.node == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
988

989
990
991
        node_type* to_delete = it.node->next;
        if (to_delete == nullptr)
            return end();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
992

993
994
        node_type* next = to_delete->next;
        it.node->next = next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
995

996
        if constexpr (!std::is_trivial_v<T>)
997
            to_delete->value.~T();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
998

999
        allocator->free(to_delete);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1000

1001
        return iterator(next);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1002
1003
1004
1005
    }
};

template<typename T>
1006
class flat_double_list
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1007
{
1008
private:
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1009
1010
1011
1012
    struct node_type
    {
        T value;
        node_type* next = nullptr;
1013
        node_type* prev = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
    };

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

    class iterator
    {
    private:
1025
        flat_double_list* list{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1026
1027
1028
        node_type* node{ nullptr };

    public:
1029
        using iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1030
1031
1032
1033
1034
1035
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        iterator() noexcept = default;

1036
1037
1038
        iterator(flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1039
1040
1041
        {}

        iterator(const iterator& other) noexcept
1042
1043
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1044
1045
1046
1047
        {}

        iterator& operator=(const iterator& other) noexcept
        {
1048
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1049
1050
1051
1052
1053
1054
1055
1056
1057
            node = other.node;
            return *this;
        }

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

1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
        T* operator*() const noexcept
        {
            return node->value;
        }

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

        pointer operator->() const noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1069
1070
1071
1072
1073
1074
        {
            return &node->value;
        }

        iterator operator++() noexcept
        {
1075
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1076
1077
1078
1079
1080
1081
1082
1083

            return *this;
        }

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

1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
            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
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116

            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
        {
1117
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1118
1119
1120
1121
1122
1123
1124
            std::swap(node, other.node);
        }
    };

    class const_iterator
    {
    private:
1125
1126
        const flat_double_list* list{ nullptr };
        node_type* node{ nullptr };
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1127
1128

    public:
1129
        using const_iterator_category = std::bidirectional_iterator_tag;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1130
1131
1132
1133
1134
1135
        using value_type = T;
        using pointer = T*;
        using reference = T&;

        const_iterator() noexcept = default;

1136
1137
1138
        const_iterator(const flat_double_list* lst, node_type* n) noexcept
          : list(lst)
          , node(n)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1139
1140
1141
        {}

        const_iterator(const const_iterator& other) noexcept
1142
1143
          : list(other.list)
          , node(other.node)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1144
1145
1146
1147
        {}

        const_iterator& operator=(const const_iterator& other) noexcept
        {
1148
            list = other.list;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
            node = other.node;
            return *this;
        }

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

        const T* operator->() noexcept
        {
1160
            return &(node->value);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1161
1162
1163
1164
        }

        const_iterator operator++() noexcept
        {
1165
            node = (node == nullptr) ? list->m_front : node->next;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1166
1167
1168
1169
1170
1171
1172
1173

            return *this;
        }

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

1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
            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
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206

            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
        {
1207
            std::swap(list, other.list);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1208
1209
1210
1211
1212
            std::swap(node, other.node);
        }
    };

private:
1213
1214
1215
1216
    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
1217
1218

public:
1219
    flat_double_list() = default;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1220

1221
1222
    flat_double_list(allocator_type* allocator)
      : m_allocator(allocator)
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1223
1224
    {}

1225
1226
    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
1227

1228
1229
1230
1231
1232
    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
1233
    {
1234
1235
1236
1237
        other.m_allocator = nullptr;
        other.m_front = nullptr;
        other.m_back = nullptr;
        other.m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1238
1239
    }

1240
    void set_allocator(allocator_type* allocator) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1241
1242
    {
        clear();
1243
1244
1245
1246
        m_allocator = allocator;
        m_front = nullptr;
        m_back = nullptr;
        m_size = 0;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1247
1248
    }

Gauthier Quesnel's avatar
Gauthier Quesnel committed
1249
1250
1251
1252
1253
    allocator_type* get_allocator() const noexcept
    {
        return m_allocator;
    }

1254
    flat_double_list& operator=(flat_double_list&& other) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1255
1256
1257
    {
        if (this != &other) {
            clear();
1258
1259
1260
1261
1262
1263
1264
1265
            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
1266
1267
1268
1269
1270
        }

        return *this;
    }

1271
    ~flat_double_list() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1272
1273
1274
1275
1276
1277
    {
        clear();
    }

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

1280
1281
1282
1283
        while (m_front != nullptr) {
            m_front = m_front->next;
            m_allocator->free(prev);
            prev = m_front;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1284
1285
        }

1286
1287
        m_size = 0;
        m_back = nullptr;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1288
1289
1290
1291
    }

    iterator begin() noexcept
    {
1292
        return iterator(this, m_front);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1293
1294
1295
1296
    }

    iterator end() noexcept
    {
1297
        return iterator(this, nullptr);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1298
1299
1300
1301
    }

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

    const_iterator end() const noexcept
    {
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
        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
1328
1329
1330
1331
1332
    }

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

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

        return begin();
    }

    template<typename... Args>
1353
    iterator emplace_back(Args&&... args) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1354
    {
1355
        node_type* new_node = m_allocator->alloc();
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1356
        new (&new_node->value) T(std::forward<Args>(args)...);
1357
        ++m_size;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1358

1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
        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
1370

1371
        return iterator(this, new_node);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
1372
1373
1374
1375
1376
    }

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

        if (!success)
            return end();

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