Lines Matching full:branch
140 // Maximum number of nested split-branch levels for a branch on all 2^16 possible UChar units.
202 * Traverses the Node graph and numbers branch edges, with rightmost edges first.
205 * Branch nodes in this trie data structure are not symmetric.
206 * Most branch edges "jump" to other nodes but the rightmost branch edges
208 * Therefore, write() must write the rightmost branch edge last
212 * This function visits and marks right branch edges first.
215 * A branch edge also remembers the first number for any of its edges.
217 * When a further-left branch edge has a number in the range of the rightmost
237 // If this node is part of the unwritten right branch edge,
380 // Branch head node, for writing the actual node lead unit.
392 Node *next; // A branch sub-node.
