ICU 52.1 52.1
|Node (int32_t initialHash)|
|int32_t||hashCode () const|
|virtual UBool||operator== (const Node &other) const|
|UBool||operator!= (const Node &other) const|
|virtual int32_t||markRightEdgesFirst (int32_t edgeNumber)|
|Traverses the Node graph and numbers branch edges, with rightmost edges first. |
|virtual void||write (StringTrieBuilder &builder)=0|
|void||writeUnlessInsideRightEdge (int32_t firstRight, int32_t lastRight, StringTrieBuilder &builder)|
|int32_t||getOffset () const|
|static int32_t||hashCode (const Node *node)|
This API is for internal use only.
|virtual int32_t icu::StringTrieBuilder::Node::markRightEdgesFirst||(||int32_t||edgeNumber||)||
Traverses the Node graph and numbers branch edges, with rightmost edges first.
This is to avoid writing a duplicate node twice.
Branch nodes in this trie data structure are not symmetric. Most branch edges "jump" to other nodes but the rightmost branch edges just continue without a jump. Therefore, write() must write the rightmost branch edge last (trie units are written backwards), and must write it at that point even if it is a duplicate of a node previously written elsewhere.
This function visits and marks right branch edges first. Edges are numbered with increasingly negative values because we share the offset field which gets positive values when nodes are written. A branch edge also remembers the first number for any of its edges.
When a further-left branch edge has a number in the range of the rightmost edge's numbers, then it will be written as part of the required right edge and we can avoid writing it first.
After root.markRightEdgesFirst(-1) the offsets of all nodes are negative edge numbers.
|edgeNumber||The first edge number for this node and its sub-nodes.|
Reimplemented in icu::StringTrieBuilder::BranchHeadNode, icu::StringTrieBuilder::SplitBranchNode, icu::StringTrieBuilder::ListBranchNode, icu::StringTrieBuilder::LinearMatchNode, and icu::StringTrieBuilder::IntermediateValueNode.