80     void createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode);
85     void build(UStringTrieBuildOption buildOption, int32_t elementsLength, UErrorCode &errorCode);
88     int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex);
90     int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length);
97     Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
99     Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
100                             int32_t length, UErrorCode &errorCode);
104     virtual int32_t getElementStringLength(int32_t i) const = 0;
106     virtual UChar getElementUnit(int32_t i, int32_t unitIndex) const = 0;
108     virtual int32_t getElementValue(int32_t i) const = 0;
113     virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0;
117     virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0;
119     virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0;
121     virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, UChar unit) const = 0;
127     virtual int32_t getMaxBranchLinearSubNodeLength() const = 0;
129     virtual int32_t getMinLinearMatch() const = 0;
131     virtual int32_t getMaxLinearMatchLength() const = 0;
136     static const int32_t kMaxBranchLinearSubNodeLength=5;
141     static const int32_t kMaxSplitBranchLevels=14;
164     Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
191         Node(int32_t initialHash) : hash(initialHash), offset(0) {}  in Node()
192         inline int32_t hashCode() const { return hash; }  in hashCode()
194 …     static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); }  in hashCode()
225         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
229         inline void writeUnlessInsideRightEdge(int32_t firstRight, int32_t lastRight,  in writeUnlessInsideRightEdge()
240         inline int32_t getOffset() const { return offset; }  in getOffset()
242         int32_t hash;
243         int32_t offset;
255         FinalValueNode(int32_t v) : Node(0x111111*37+v), value(v) {}  in FinalValueNode()
259         int32_t value;
267         ValueNode(int32_t initialHash) : Node(initialHash), hasValue(FALSE), value(0) {}  in ValueNode()
269         void setValue(int32_t v) {  in setValue()
276         int32_t value;
284         IntermediateValueNode(int32_t v, Node *nextNode)  in IntermediateValueNode()
287         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
298         LinearMatchNode(int32_t len, Node *nextNode)  in LinearMatchNode()
302         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
304         int32_t length;
313         BranchNode(int32_t initialHash) : Node(initialHash) {}  in BranchNode()
315         int32_t firstEdgeNumber;
325         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
328         void add(int32_t c, int32_t value) {  in add()
336         void add(int32_t c, Node *node) {  in add()
345         int32_t length;
346         int32_t values[kMaxBranchLinearSubNodeLength];
360         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
372         BranchHeadNode(int32_t len, Node *subNode)  in BranchHeadNode()
376         virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
379         int32_t length;
385     virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
389     virtual int32_t write(int32_t unit) = 0;
391     virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) = 0;
393     virtual int32_t writeValueAndFinal(int32_t i, UBool isFinal) = 0;
395     virtual int32_t writeValueAndType(UBool hasValue, int32_t value, int32_t node) = 0;
397     virtual int32_t writeDeltaTo(int32_t jumpTarget) = 0;