Searched refs:NodeQueue (Results 1 – 2 of 2) sorted by relevance
151 std::queue<ContextTrieNode *> NodeQueue; variable155 explicit Iterator(ContextTrieNode *Node) { NodeQueue.push(Node); } in Iterator()157 assert(!NodeQueue.empty() && "Iterator already at the end");158 ContextTrieNode *Node = NodeQueue.front();159 NodeQueue.pop();161 NodeQueue.push(&It.second);166 if (NodeQueue.empty() && Other.NodeQueue.empty())168 if (NodeQueue.empty() || Other.NodeQueue.empty())170 return NodeQueue.front() == Other.NodeQueue.front();174 assert(!NodeQueue.empty() && "Invalid access to end iterator");[all …]
164 std::queue<ContextTrieNode *> NodeQueue; in dumpTree() local 165 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()