Lines Matching refs:trie
4 LC-trie implementation notes
14 trie node or tnode
40 the trie is kept level balanced moving, under certain conditions, the
68 straightforward trie lookup.
71 Inserts a new leaf node in the trie. This is bit more complicated than
73 level compression algorithm on part of the trie.
79 The key function for the dynamic trie after any change in the trie
80 it is run to optimize and reorganize. It will walk the trie upwards
102 This walks the full trie (using nextleaf()) and searches for empty
108 entire trie for each prefix length. In comparison, fib_hash is organized
124 trie, key segment by key segment, until we find a leaf. check_leaf() does
131 and we backtrack upwards through the trie trying to find a longest matching
140 At this point we backtrack (t->stats.backtrack++) up the trie, continuing to