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