Lines Matching defs:nodes
176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes;
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes.
234 * of the input edge number and the numbers of this node and all of its sub-nodes.
243 // If offset>0 then this node and its sub-nodes have been written already
260 // (stack-allocated so that we don't unnecessarily create lots of duplicate nodes)