Lines Matching refs:tnode
10 trie node or tnode
11 An internal node, holding an array of child (leaf or tnode) pointers,
16 Bits (tnode)
20 Pos (tnode)
25 Any given tnode is linked to from the child array of its parent, using
27 In certain cases, this tnode's own "pos" will not be immediately
38 instead of a pure binary tree, each internal node ("tnode") may
40 Conversely, a tnode with a mostly empty child array (see empty_children)
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.
51 to this tnode's "pos"+"bits").
77 towards the root from a given tnode, doing a resize() at each step
81 Analyzes a tnode and optimizes the child array size by either inflating
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