EmbeddedModules/datastruct/ctl/ctl_map.h at master · ElluIFX/EmbeddedModules · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/* red-black tree from set.h with a key-value struct as T
   SPDX-License-Identifier: MIT */

#ifndef T
#error "Template struct type T undefined for <ctl_map.h>"
#endif

#include "ctl.h"

// TODO C++17: emplace, try_emplace, extract, merge

#define CTL_MAP
#define HOLD
#define C map
#define set map
#define _set _map
#include <./ctl_set.h>

static inline I JOIN(A, insert_or_assign)(A* self, T key) {
    B* insert = JOIN(B, init)(key, 0);
    if (self->root) {
        B* node = self->root;
        while (1) {
            int diff = self->compare(&key, &node->value);
            if (diff == 0) {
                JOIN(A, free_node)(self, node);
                *node = *insert;
                return JOIN(I, iter)(self, node);
            } else if (diff < 0) {
                if (node->l)
                    node = node->l;
                else {
                    node->l = insert;
                    break;
                }
            } else {
                if (node->r)
                    node = node->r;
                else {
                    node->r = insert;
                    break;
                }
            }
        }
        insert->p = node;
    } else
        self->root = insert;
    JOIN(A, insert_1)(self, insert);
    self->size++;
#ifdef USE_INTERNAL_VERIFY
    JOIN(A, verify)(self);
#endif
    return JOIN(I, iter)(self, insert);
}

static inline I JOIN(A, insert_or_assign_found)(A* self, T key, int* foundp) {
    B* insert = JOIN(B, init)(key, 0);
    if (self->root) {
        B* node = self->root;
        while (1) {
            int diff = self->compare(&key, &node->value);
            if (diff == 0) {
                JOIN(A, free_node)(self, node);
                *node = *insert;
                *foundp = 1;
                return JOIN(I, iter)(self, node);
            } else if (diff < 0) {
                if (node->l)
                    node = node->l;
                else {
                    node->l = insert;
                    break;
                }
            } else {
                if (node->r)
                    node = node->r;
                else {
                    node->r = insert;
                    break;
                }
            }
        }
        insert->p = node;
    } else
        self->root = insert;
    JOIN(A, insert_1)(self, insert);
    self->size++;
#ifdef USE_INTERNAL_VERIFY
    JOIN(A, verify)(self);
#endif
    *foundp = 0;
    return JOIN(I, iter)(self, insert);
}

#undef _set
#undef set
#undef T
#undef A
#undef B
#undef I
#undef GI
#undef CTL_MAP