Lines Matching refs:of

6 	An end node with data. This has a copy of the relevant key, along
11 	An internal node, holding an array of child (leaf or tnode) pointers,
12 	indexed	through a subset of the key. See Level Compression.
17 	The number of bits in the key segment used for indexing into the
21 	The position (in the key) of the key segment used for indexing into
25 	Any given tnode is linked to from the child array of its parent, using
26 	a segment of the key specified by the parent's "pos" and "bits" 
37 	children of a full child (see "full_children") up one level, so that
38 	instead of a pure binary tree, each internal node ("tnode") may
39 	contain an arbitrarily large array of links to several children.
41 	may be "halved", having some of its children moved downwards one level,
45 	the number of positions in the child array of a given tnode that are
49 	the number of children of a given tnode that aren't path compressed.
53 	(The word "full" here is used more in the sense of "complete" than
54 	as the opposite of "empty", which might be a tad confusing.)
59 We have tried to keep the structure of the code as close to fib_hash as 
69 	level compression algorithm on part of the trie.
87 	Doubles the size of the child array within a tnode. Used by resize().
90 	Halves the size of the child array within a tnode - the inverse of
131 Inside each tnode, the search for longest matching prefix consists of searching
132 through the child array, chopping off (zeroing) the least significant "1" of
133 the child index until we find a match or the child index consists of nothing but
137 chop off part of the key in order to find the longest matching prefix.
143 To alleviate any doubts about the correctness of the route selection process,