Lines Matching refs:NodeIter
96 NodeIter iter(&rootNode); in TestHierarchyIterator()
97 iter.setState(NodeIter::NISTATE_ENTER); // Root is never reported in TestHierarchyIterator()
105 …for (vector<NodeIter>::reverse_iterator iter = m_sessionStack.rbegin(); iter != m_sessionStack.ren… in ~TestHierarchyIterator()
125 const NodeIter& iter = m_sessionStack.back(); in getState()
127 DE_ASSERT(iter.getState() == NodeIter::NISTATE_ENTER || in getState()
128 iter.getState() == NodeIter::NISTATE_LEAVE); in getState()
130 return iter.getState() == NodeIter::NISTATE_ENTER ? STATE_ENTER_NODE : STATE_LEAVE_NODE; in getState()
148 std::string TestHierarchyIterator::buildNodePath (const vector<NodeIter>& nodeStack) in buildNodePath()
153 const NodeIter& iter = nodeStack[ndx]; in buildNodePath()
165 NodeIter& iter = m_sessionStack.back(); in next()
171 case NodeIter::NISTATE_INIT: in next()
183 iter.setState(NodeIter::NISTATE_ENTER); in next()
187 case NodeIter::NISTATE_ENTER: in next()
191 iter.setState(NodeIter::NISTATE_LEAVE); in next()
196 iter.setState(NodeIter::NISTATE_TRAVERSE_CHILDREN); in next()
212 case NodeIter::NISTATE_TRAVERSE_CHILDREN: in next()
228 m_sessionStack.push_back(NodeIter(childNode)); in next()
232 iter.setState(NodeIter::NISTATE_LEAVE); in next()
240 case NodeIter::NISTATE_LEAVE: in next()