Lines Matching defs:TernaryNode
60 struct TernaryNode : public UMemory {
63 TernaryNode *low; // Less-than link
64 TernaryNode *equal; // Equal link
65 TernaryNode *high; // Greater-than link
67 TernaryNode(UChar uc);
68 ~TernaryNode();
76 TernaryNode::TernaryNode(UChar uc) {
85 TernaryNode::~TernaryNode() {
98 fTrie = new TernaryNode(median);
132 TernaryNode *&parent,
136 const TernaryNode *up = NULL;
137 const TernaryNode *p = fTrie;
182 parent = (TernaryNode *)up;
198 TernaryNode *parent;
209 TernaryNode *newNode = new TernaryNode(uc);
255 TernaryNode *parent;
265 TernaryNode *fRoot; // Root node
277 MutableTrieEnumeration(TernaryNode *root, UErrorCode &status)
297 TernaryNode *node = (TernaryNode *) fNodeStack.peek();
307 node = (TernaryNode *) fNodeStack.push(node->low, status);
323 node = (TernaryNode *) fNodeStack.push(node->equal, status);
339 node = (TernaryNode *) fNodeStack.push(node->high, status);
346 node = (TernaryNode *) fNodeStack.peek();
1179 static void walkHorizontal(const TernaryNode *node,
1185 // Convert one TernaryNode into a BuildCompactTrieNode. Uses recursion.
1188 compactOneNode(const TernaryNode *node, UBool parentEndsWord, UStack &nodes,
1264 static void walkHorizontal(const TernaryNode *node,
1671 static TernaryNode *
1675 static TernaryNode *
1682 TernaryNode *result = new TernaryNode(hnode->entries[middle].ch);
1702 static TernaryNode *
1711 TernaryNode *head = NULL;
1712 TernaryNode *previous = NULL;
1713 TernaryNode *latest = NULL;
1715 latest = new TernaryNode(vnode->chars[i]);
1761 TernaryNode *root = unpackHorizontalArray(fInfo, hnode, 0, nodeCount-1,
