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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
/* SPDX-License-Identifier: BSD-3-Clause */
/*
* Copyright © 2010, Zed A. Shaw.
* Copyright © 2020 rsiddharth <s@ricketyspace.net>
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <dbg.h>
#include <tstree.h>
static inline TSTree *TSTree_insert_base(TSTree *root, TSTree *node,
const char *key, size_t len,
void *value)
{
if (node == NULL) {
node = (TSTree *) calloc(1, sizeof(TSTree));
if (root == NULL) {
root = node;
}
node->splitchar = *key;
}
if (*key < node->splitchar) {
node->low = TSTree_insert_base(root,
node->low, key, len, value);
} else if (*key == node->splitchar) {
if (len > 1) {
node->equal = TSTree_insert_base(root, node->equal,
key + 1, len -1 , value);
} else {
assert(node->value == NULL && "Duplicate insert into tst.");
node->value = value;
}
} else {
node->high = TSTree_insert_base(root, node->high,
key, len, value);
}
return node;
}
TSTree *TSTree_insert(TSTree *node, const char *key, size_t len,
void *value)
{
return TSTree_insert_base(node, node, key, len, value);
}
void *TSTree_search(TSTree *root, const char *key, size_t len)
{
TSTree *node = root;
size_t i = 0;
while (i < len && node) {
if (key[i] < node->splitchar) {
node = node->low;
} else if (key[i] == node->splitchar) {
i++;
if (i < len)
node = node->equal;
} else {
node = node->high;
}
}
if (node) {
return node->value;
} else {
return NULL;
}
}
void *TSTree_search_prefix(TSTree *root, const char *key, size_t len)
{
if (len == 0)
return NULL;
TSTree *node = root;
TSTree *last = NULL;
size_t i = 0;
while (i < len && node) {
if (key[i] < node->splitchar) {
node = node->low;
} else if (key[i] == node->splitchar) {
i++;
if (i < len) {
if (node->value) {
last = node->value;
}
node = node->equal;
}
} else {
node = node->high;
}
}
return last;
}
void TSTree_collect_keys(TSTree *node, char *key, size_t key_sz, DArray *array)
{
if (!node) {
return;
}
strcat(key, &node->splitchar);
key_sz += 2;
key = (char *) realloc(key, key_sz);
if (node->value) {
char *key_cpy = (char *) calloc(key_sz, sizeof(char));
strcpy(key_cpy, key);
DArray_push(array, key_cpy);
}
if (node->low) {
TSTree_collect_keys(node->low, key, key_sz, array);
}
if (node->equal) {
TSTree_collect_keys(node->equal, key, key_sz, array);
}
if (node->high) {
TSTree_collect_keys(node->high, key, key_sz, array);
}
}
size_t TSTree_collect_keycat(char *key, size_t key_sz, char *c) {
// Expand key.
key_sz += 2;
key = (char *) realloc(key, key_sz);
check(key != NULL, "Unable to expand key");
// Concat.
key = strcat(key, c);
check(key != NULL, "key cat failed");
return key_sz;
error:
if (key) {
free(key);
}
return 0;
}
DArray *TSTree_collect(TSTree *root, const char *key, size_t len)
{
char *ckey = NULL;
DArray *array = DArray_create(sizeof(void), 1);
check(array != NULL, "Unable to initialize DArray");
if (len == 0)
return array;
TSTree *node = root;
TSTree *last = NULL;
size_t i = 0;
size_t ckey_sz = 4;
ckey = (char *) calloc(ckey_sz, sizeof(char));
check(ckey != NULL, "Unable to initialize ckey");
ckey[0] = '\0';
while (i < len && node) {
if (key[i] < node->splitchar) {
node = node->low;
} else if (key[i] == node->splitchar) {
i++;
if (i < len) {
ckey_sz = TSTree_collect_keycat(ckey, ckey_sz,
&node->splitchar);
check(ckey_sz > 0, "keycat failed");
if (node->value) {
last = node;
}
node = node->equal;
}
} else {
node = node->high;
}
}
node = node ? node : last;
while (node && !node->value) {
ckey_sz = TSTree_collect_keycat(ckey, ckey_sz,
&node->splitchar);
check(ckey_sz > 0, "keycat failed");
node = node->equal;
}
if (node) {
TSTree_collect_keys(node, ckey, ckey_sz, array);
}
// Clean up.
free(ckey);
return array;
error:
// Clean up.
if (array) {
DArray_destroy(array);
}
if (ckey) {
free(ckey);
}
return NULL;
}
void TSTree_traverse(TSTree *node, TSTree_traverse_cb cb, void *data)
{
if (!node)
return;
if (node->low)
TSTree_traverse(node->low, cb, data);
if (node->equal) {
TSTree_traverse(node->equal, cb, data);
}
if (node->high)
TSTree_traverse(node->high, cb, data);
if (node->value)
cb(node->value, data);
}
void TSTree_destroy(TSTree *node)
{
if (node == NULL)
return;
if (node->low)
TSTree_destroy(node->low);
if (node->equal) {
TSTree_destroy(node->equal);
}
if (node->high)
TSTree_destroy(node->high);
free(node);
}
|
