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
|
// #include "trie.h"
// #ifndef TYPE
// #error "Set TYPE before including this file"
// #else
#include <stdarg.h>
#include "err.h"
#include "macro.h"
// INIT_F ( TRIE(TYPE) ) {
template <class T>
trie<T>::trie () {
// NEW(TRIE_NODE(TYPE), t, '\0');
auto t = new trie_node<T>('\0');
this->root = t;
}
// INIT_F (TRIE_NODE(TYPE), char c) {
template <class T>
trie_node<T>::trie_node (char c) {
this->c = c;
this->value = NULL;
this->next = NULL;
this->child = NULL;
}
// INIT_F (TRIE_NODE(TYPE),
// char c,
// TRIE_NODE(TYPE)* next,
// TRIE_NODE(TYPE)* child )
template <class T>
trie_node<T>::trie_node (
char c,
trie_node<T>* next,
trie_node<T>* child )
{
this->c = c;
this->next = next;
this->child = child;
}
// int PUSH(TRIE(TYPE)) ( TRIE(TYPE)* trie, char* key, TYPE* val ) {
template <class T>
int trie<T>::push (char* key, T* val) {
trie_node<T> *cur, *last;
last = this->root;
cur = last->child;
char* subkey = key;
while (1) {
if (cur == NULL) {
/* Build direct LL for remaining subkey */
for (char* c = subkey; c[0] != '\0'; c++) {
// NEW(TRIE_NODE(TYPE), t, *c);
auto t = new trie_node<T>(*c);
last->child = t;
last = t;
}
// last->value = RESOLVE(TYPE)(last->value, val);
last->value = last->value->resolve(val);
return 0;
} else if (cur->c == subkey[0]) {
/* This node belongs to the key,
* Decend further */
last = cur;
cur = cur->child;
subkey++;
} else if (subkey[0] == '\0') {
/* Key finished */
// last->value = RESOLVE(TYPE)(last->value, val);
last->value->resolve(val);
return 0;
} else if (cur->next != NULL) {
/* This node was not part of the set, but it's sibling might */
cur = cur->next;
/* `last` not set since we aren't moving down */
} else {
/* No node on this level was part of the set, create a new__
* sibling and follow down that parse */
// NEW(TRIE_NODE(TYPE), t, *subkey);
auto t = new trie_node<T>(*subkey);
cur->next = t;
last = cur;
cur = t;
}
}
return 0;
}
/*
* TODO what happens when I give an invalid key?
*/
template <class T>
T* trie<T>::get (char* key) {
// TYPE* GET(TRIE(TYPE)) ( TRIE(TYPE)* trie, char* key ) {
// TRIE_NODE(TYPE)* n = trie->root->child;
trie_node<T>* n = this->root->child;
char* subkey = key;
while (n != NULL) {
if (subkey[1] == '\0') {
return n->value;
} else if (subkey[0] == n->c) {
n = n->child;
subkey++;
} else {
n = n->next;
}
}
ERR("Position not found");
return 0;
}
// FREE_F(TRIE_NODE(TYPE)) {
template <class T>
trie_node<T>::~trie_node () {
// if (this == NULL) return 0;
if (this->value != NULL) free (this->value); // FFREE(TYPE, this->value);
if (this->next != NULL) free (this->next);
if (this->child != NULL) free (this->child);
// free (this);
}
// FREE_F(TRIE(TYPE)) {
template <class T>
trie<T>::~trie () {
if (this->root->c != '\0') {
// ERR("Invalid trie");
// return 1;
return; // error
}
// free (this->root);
delete this->root;
}
template <class T>
int trie<T>::empty () {
//int EMPTY(TRIE(TYPE))(TRIE(TYPE)* this) {
return this->root->child == NULL;
}
#if 0
FMT_F(TRIE_NODE(TYPE)) {
va_list ap;
va_start(ap, buf);
int argc = va_arg(ap, int);
int depth = argc >= 1
? va_arg(ap, int)
: 0;
va_end(ap);
int seek = 0;
TRIE_NODE(TYPE)* n = this;
if (n == NULL) { fmtf("\n"); }
while (n != NULL) {
fmtf("|");
// FOR(int, i, depth) fmtf(" ");
for (int i = 0; i < depth; i++) fmtf(" ");
fmtf("%c ", n->c == '\0' ? '0' : n->c);
if (n->value != NULL) {
seek += FMT(TYPE)(n->value, buf + seek);
fmtf("\n");
}
if (n->child != NULL) {
fmtf("\n");
seek += FMT(TRIE_NODE(TYPE))(n->child, buf + seek, depth + 1);
}
n = n->next;
}
return seek;
}
FMT_F(TRIE(TYPE)) {
int seek = 0;
fmtf("Trie: %p: {\n", this);
seek += FMT(TRIE_NODE(TYPE))(self->root->child, buf + seek);
fmtf("}");
return seek;
}
#endif /* TYPE */
|
