Searched refs:NodeQueue (Results 1 – 2 of 2) sorted by relevance
150 std::queue<ContextTrieNode *> NodeQueue; variable154 explicit Iterator(ContextTrieNode *Node) { NodeQueue.push(Node); } in Iterator()156 assert(!NodeQueue.empty() && "Iterator already at the end");157 ContextTrieNode *Node = NodeQueue.front();158 NodeQueue.pop();160 NodeQueue.push(&It.second);165 if (NodeQueue.empty() && Other.NodeQueue.empty())167 if (NodeQueue.empty() || Other.NodeQueue.empty())169 return NodeQueue.front() == Other.NodeQueue.front();173 assert(!NodeQueue.empty() && "Invalid access to end iterator");[all …]
165 std::queue<ContextTrieNode *> NodeQueue; in dumpTree() local166 NodeQueue.push(this); in dumpTree()168 while (!NodeQueue.empty()) { in dumpTree()169 ContextTrieNode *Node = NodeQueue.front(); in dumpTree()170 NodeQueue.pop(); in dumpTree()175 NodeQueue.push(ChildNode); in dumpTree()