Lines Matching defs:fNodeStack
231 UStack fNodeStack; // Stack of nodes to process
246 : fNodeStack(status), fBranchStack(status) {
248 fNodeStack.push(root, status);
262 if (fNodeStack.empty() || U_FAILURE(status)) {
265 TernaryNode *node = (TernaryNode *) fNodeStack.peek();
267 while (!fNodeStack.empty() && U_SUCCESS(status)) {
275 node = (TernaryNode *) fNodeStack.push(node->low, status);
291 node = (TernaryNode *) fNodeStack.push(node->equal, status);
307 node = (TernaryNode *) fNodeStack.push(node->high, status);
312 fNodeStack.pop();
314 node = (TernaryNode *) fNodeStack.peek();
335 fNodeStack.removeAllElements();
337 fNodeStack.push(fRoot, status);
546 UVector32 fNodeStack; // Stack of nodes to process
555 : fNodeStack(status), fIndexStack(status) {
557 fNodeStack.push(header->root, status);
583 fNodeStack.removeAllElements();
585 fNodeStack.push(fHeader->root, status);
595 if (fNodeStack.empty() || U_FAILURE(status)) {
598 const CompactTrieNode *node = getCompactNode(fHeader, fNodeStack.peeki());
600 while (!fNodeStack.empty() && U_SUCCESS(status)) {
605 fNodeStack.popi();
607 node = getCompactNode(fHeader, fNodeStack.peeki());
617 node = getCompactNode(fHeader, fNodeStack.push(vnode->equal, status));
624 fNodeStack.popi();
626 node = getCompactNode(fHeader, fNodeStack.peeki());
641 node = getCompactNode(fHeader, fNodeStack.push(hnode->entries[where].equal, status));
647 fNodeStack.popi();
649 node = getCompactNode(fHeader, fNodeStack.peeki());
