core.hpp 173 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
#include <numbers>
Gauthier Quesnel's avatar
Gauthier Quesnel committed
11
12
13
14
15
#include <string_view>

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

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

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

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

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
92
#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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
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
115
116
    unknown_dynamics,

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

131
132
133
    data_array_archive_init_capacity_error,
    data_array_archive_not_enough_memory,

134
135
136
137
    array_init_capacity_zero,
    array_init_capacity_too_big,
    array_init_not_enough_memory,

138
139
140
141
    vector_init_capacity_zero,
    vector_init_capacity_too_big,
    vector_init_not_enough_memory,

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

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

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

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

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

    model_time_func_bad_init_message,
Gauthier Quesnel's avatar
Gauthier Quesnel committed
171

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

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

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

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

    return s;
}

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

218
219
220
template<class T, class... Rest>
constexpr bool
are_all_same() noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
221
{
222
    return (std::is_same_v<T, Rest> && ...);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
251
}

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

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

257
    static constexpr bool is_zero(time t) noexcept
Gauthier Quesnel's avatar
Gauthier Quesnel committed
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
    {
        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
276
277
    using iterator = char*;
    using const_iterator = const char*;
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
342
    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
343
344
    constexpr void size(std::size_t sz) noexcept
    {
345
346
        size_ = static_cast<u8>(std::min(sz, length - 1));
        buffer_[size_] = '\0';
Gauthier Quesnel's avatar
Gauthier Quesnel committed
347
348
    }

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

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

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

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

        size_ = static_cast<unsigned char>(copy_length);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
399
    }

    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
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
    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
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
462
    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;
    }
};

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

728
729
730
        const_iterator(node_type* n) noexcept
          : node(n)
        {}
Gauthier Quesnel's avatar
Gauthier Quesnel committed
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
783
        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);
        }
784

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return node->value;
    }

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

        return node->value;
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

973
974
        node_type* next = to_delete->next;
        it.node->next = 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
        return iterator(next);
Gauthier Quesnel's avatar
Gauthier Quesnel committed
982
983
984
985
    }
};

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

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

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

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

        iterator() noexcept = default;

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

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

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

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

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

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

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

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

            return *this;
        }

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

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

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

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

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

        const_iterator() noexcept = default;

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

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

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

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

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

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

            return *this;
        }

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

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

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

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

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

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

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

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

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

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

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

        return *this;
    }

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

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

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

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

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

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

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

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

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

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

        return begin();
    }

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

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

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

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

        if (!success)
            return end();

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

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

        return begin();
    }

    template<typename... Args>
1381
    iterator try_emplace_back(Args&&... args) noexcept
Gauthier Quesnel's avatar