Searched refs:dfs_iterator (Results 1 – 6 of 6) sorted by relevance
138 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()139 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()169 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()170 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()190 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()191 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
131 InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()132 InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
378 typedef PolicyIterator<value_type, NonConstTraits<value_type>, DFSIterator> dfs_iterator; typedef408 dfs_iterator dfs_begin() in dfs_begin()409 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); } in dfs_begin()411 dfs_iterator dfs_end() in dfs_end()412 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); } in dfs_end()
40 InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in normalize()213 mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in readSymbolTables()233 mcld::InputTree::dfs_iterator input, inEnd = m_LDInfo.inputs().dfs_end(); in mergeSymbolTables()
88 bool mcld::isGroup(const InputTree::dfs_iterator& pos) in isGroup()
180 bool isGroup(const InputTree::dfs_iterator& pos);