Searched refs:NodeQueue (Results 1 – 2 of 2) sorted by relevance
157 std::queue<ContextTrieNode *> NodeQueue; variable161 explicit Iterator(ContextTrieNode *Node) { NodeQueue.push(Node); } in Iterator()163 assert(!NodeQueue.empty() && "Iterator already at the end");164 ContextTrieNode *Node = NodeQueue.front();165 NodeQueue.pop();167 NodeQueue.push(&It.second);172 if (NodeQueue.empty() && Other.NodeQueue.empty())174 if (NodeQueue.empty() || Other.NodeQueue.empty())176 return NodeQueue.front() == Other.NodeQueue.front();180 assert(!NodeQueue.empty() && "Invalid access to end iterator");[all …]
164 std::queue<ContextTrieNode *> NodeQueue; in dumpTree() local165 NodeQueue.push(this); in dumpTree()167 while (!NodeQueue.empty()) { in dumpTree()168 ContextTrieNode *Node = NodeQueue.front(); in dumpTree()169 NodeQueue.pop(); in dumpTree()174 NodeQueue.push(ChildNode); in dumpTree()