src/base/trie.hh

60         Node *kids[2];
66             kids[0] = NULL;
67             kids[1] = NULL;
73             if (kids[1]) {
74                 kids[1]->clear();
75                 delete kids[1];
76                 kids[1] = NULL;
78             if (kids[0]) {
79                 kids[0]->clear();
80                 delete kids[0];
81                 kids[0] = NULL;
97             if (kids[0])
98                 kids[0]->dump(os, level + 1);
99             if (kids[1])
100                 kids[1]->dump(os, level + 1);
168             if (node->kids[0] && node->kids[0]->matches(key))
169                 node = node->kids[0];
170             else if (node->kids[1] && node->kids[1]->matches(key))
171                 node = node->kids[1];
204         while (goesAfter(&node, node->kids[0], key, new_mask) ||
205                goesAfter(&node, node->kids[1], key, new_mask))
218             Node *&kid = node->kids[i];
248             new_node->kids[0] = kid;
260             kid->kids[1] = new_node;
293         if (node->kids[1]) {
304         if (node->kids[0])
305             node->kids[0]->parent = parent;
307         if (parent->kids[0] == node)
308             parent->kids[0] = node->kids[0];
309         else if (parent->kids[1] == node)
310             parent->kids[1] = node->kids[0];
314         if (parent->kids[1] && !parent->kids[0]) {
315             parent->kids[0] = parent->kids[1];
316             parent->kids[1] = NULL;
319         // If the parent has less than two kids and no cargo and isn't the
321         if (!parent->kids[1] && !parent->value && parent->parent)