Lines Matching refs:tnode
14 trie node or tnode
15 An internal node, holding an array of child (leaf or tnode) pointers,
20 Bits (tnode)
24 Pos (tnode)
29 Any given tnode is linked to from the child array of its parent, using
31 In certain cases, this tnode's own "pos" will not be immediately
42 instead of a pure binary tree, each internal node ("tnode") may
44 Conversely, a tnode with a mostly empty child array (see empty_children)
49 the number of positions in the child array of a given tnode that are
53 the number of children of a given tnode that aren't path compressed.
55 to this tnode's "pos"+"bits").
81 towards the root from a given tnode, doing a resize() at each step
85 Analyzes a tnode and optimizes the child array size by either inflating
91 Doubles the size of the child array within a tnode. Used by resize().
94 Halves the size of the child array within a tnode - the inverse of
135 Inside each tnode, the search for longest matching prefix consists of searching