Lines Matching full:nodes
169 * registerNode() and registerFinalValue() take ownership of their input nodes,
170 * and only return owned nodes.
175 * NULL Node pointers can be safely passed into other Nodes because
183 // Hash set of nodes, maps from nodes to integer 1.
185 UHashtable *nodes;
202 * Branch nodes in this trie data structure are not symmetric.
203 * Most branch edges "jump" to other nodes but the rightmost branch edges
211 * offset field which gets positive values when nodes are written.
218 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
221 * @param edgeNumber The first edge number for this node and its sub-nodes.
223 * of the input edge number and the numbers of this node and all of its sub-nodes.
232 // If offset>0 then this node and its sub-nodes have been written already
248 // (stack-allocated so that we don't unnecessarily create lots of duplicate nodes)
