Lines Matching refs:trie

1 			LC-trie implementation notes.
10 trie node or tnode
36 	the trie is kept level balanced moving, under certain conditions, the
64 	straightforward trie lookup.
67 	Inserts a new leaf node in the trie. This is bit more complicated than
69 	level compression algorithm on part of the trie.
75 	The key function for the dynamic trie after any change in the trie
76 	it is run to optimize and reorganize. Tt will walk the trie upwards 
98 	This walks the full trie (using nextleaf()) and searches for empty
104 	entire trie for each prefix length. In comparison, fib_hash is organized
120 trie, key segment by key segment, until we find a leaf. check_leaf() does
127 and we backtrack upwards through the trie trying to find a longest matching
136 At this point we backtrack (t->stats.backtrack++) up the trie, continuing to