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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
|
/*
Copyright 2015-2016 Alexander Borisov
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Author: lex.borisov@gmail.com (Alexander Borisov)
*/
#include "myhtml/utils/resources.h"
#include "myhtml/utils/mctree.h"
mctree_t * mctree_create(size_t start_size)
{
mctree_t* mctree = (mctree_t*)mymalloc(sizeof(mctree_t));
mctree->nodes_size = start_size + 4096;
mctree->nodes_length = start_size + 1;
mctree->nodes = (mctree_node_t*)mycalloc(mctree->nodes_size, sizeof(mctree_node_t));
mctree->start_size = start_size;
return mctree;
}
mctree_t * mctree_destroy(mctree_t* mctree)
{
if(mctree == NULL)
return NULL;
if(mctree->nodes)
free(mctree->nodes);
free(mctree);
return NULL;
}
mctree_index_t __mtree_search_lowercase_to_start(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size)
{
mctree_node_t* nodes = mctree->nodes;
while (idx)
{
if(key_size == nodes[idx].str_size) {
if(myhtml_strncasecmp(key, nodes[idx].str, key_size) == 0) {
return idx;
}
idx = nodes[idx].child;
}
else if(key_size > nodes[idx].str_size)
{
if(key_size < nodes[ nodes[idx].next ].str_size) {
return 0;
}
idx = nodes[idx].next;
}
else {
if(key_size > nodes[ nodes[idx].prev ].str_size) {
return 0;
}
idx = nodes[idx].prev;
}
}
return 0;
}
mctree_index_t __mtree_search_to_start(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size)
{
mctree_node_t* nodes = mctree->nodes;
while (idx)
{
if(key_size == nodes[idx].str_size) {
if(memcmp((const void *)key, (const void *)(nodes[idx].str), key_size) == 0) {
return idx;
}
idx = nodes[idx].child;
}
else if(key_size > nodes[idx].str_size)
{
if(key_size < nodes[ nodes[idx].next ].str_size) {
return 0;
}
idx = nodes[idx].next;
}
else {
if(key_size > nodes[ nodes[idx].prev ].str_size) {
return 0;
}
idx = nodes[idx].prev;
}
}
return 0;
}
mctree_index_t mctree_insert_child(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size, void* value)
{
mctree_node_t* nodes = mctree->nodes;
mctree_index_t new_idx = mctree_node_get_free_id(mctree);
nodes[idx].child = new_idx;
nodes[new_idx].str = key;
nodes[new_idx].str_size = key_size;
nodes[new_idx].value = value;
mctree_node_add(mctree);
return new_idx;
}
mctree_index_t mctree_insert_after(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size, void* value)
{
mctree_node_t* nodes = mctree->nodes;
mctree_index_t new_idx = mctree_node_get_free_id(mctree);
if(nodes[idx].next) {
nodes[ nodes[idx].next ].prev = new_idx;
nodes[new_idx].next = nodes[idx].next;
}
nodes[idx].next = new_idx;
nodes[new_idx].prev = idx;
nodes[new_idx].str = key;
nodes[new_idx].str_size = key_size;
nodes[new_idx].value = value;
mctree_node_add(mctree);
return new_idx;
}
mctree_index_t mctree_insert_before(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size, void* value)
{
mctree_node_t* nodes = mctree->nodes;
mctree_index_t new_idx = mctree_node_get_free_id(mctree);
if(nodes[idx].prev) {
nodes[ nodes[idx].prev ].next = new_idx;
nodes[new_idx].prev = nodes[idx].prev;
}
nodes[idx].prev = new_idx;
nodes[new_idx].next = idx;
nodes[new_idx].str = key;
nodes[new_idx].str_size = key_size;
nodes[new_idx].value = value;
mctree_node_add(mctree);
return new_idx;
}
mctree_index_t __mtree_insert_to_start(mctree_t* mctree, mctree_index_t idx, const char* key, size_t key_size, void* value, mctree_before_insert_f b_insert)
{
mctree_node_t* nodes = mctree->nodes;
while (idx)
{
if(key_size == nodes[idx].str_size) {
if(memcmp((const void *)key, (const void *)nodes[idx].str, key_size) == 0)
{
if(value)
nodes[idx].value = value;
return idx;
}
if(nodes[idx].child == 0) {
if(b_insert)
b_insert(key, key_size, &value);
return mctree_insert_child(mctree, idx, key, key_size, value);
}
idx = nodes[idx].child;
}
else if(key_size > nodes[idx].str_size)
{
if(nodes[idx].next == 0 || key_size < nodes[ nodes[idx].next ].str_size) {
if(b_insert)
b_insert(key, key_size, &value);
return mctree_insert_after(mctree, idx, key, key_size, value);
}
idx = nodes[idx].next;
}
else {
if(nodes[idx].prev == 0 || key_size > nodes[ nodes[idx].prev ].str_size) {
if(b_insert)
b_insert(key, key_size, &value);
return mctree_insert_before(mctree, idx, key, key_size, value);
}
idx = nodes[idx].prev;
}
}
return 0;
}
mctree_index_t mctree_insert(mctree_t* mctree, const char* key, size_t key_size, void* value, mctree_before_insert_f b_insert)
{
mctree_node_t* start = mctree->nodes;
if(key_size > 0) {
mctree_index_t idx = mctree_make_first_idx(mctree, key, key_size);
if(start[idx].child) {
return __mtree_insert_to_start(mctree, start[idx].child, key, key_size, value, b_insert);
}
else {
if(b_insert)
b_insert(key, key_size, &value);
return mctree_insert_child(mctree, idx, key, key_size, value);
}
}
return 0;
}
mctree_index_t mctree_search(mctree_t* mctree, const char* key, size_t key_size)
{
mctree_node_t* start = mctree->nodes;
if(key_size > 0) {
mctree_index_t idx = mctree_make_first_idx(mctree, key, key_size);
if(start[idx].child) {
return __mtree_search_to_start(mctree, start[idx].child, key, key_size);
}
}
return 0;
}
mctree_index_t mctree_search_lowercase(mctree_t* mctree, const char* key, size_t key_size)
{
mctree_node_t* start = mctree->nodes;
if(key_size > 0) {
mctree_index_t idx = mctree_make_first_idx(mctree, key, key_size);
if(start[idx].child) {
return __mtree_search_lowercase_to_start(mctree, start[idx].child, key, key_size);
}
}
return 0;
}
|
