Home
last modified time | relevance | path

Searched refs:dfs_iterator (Results 1 – 5 of 5) sorted by relevance

/frameworks/compile/mclinker/include/mcld/
DInputTree.h83 typedef PolicyIterator<value_type, NonConstTraits<value_type>, DFSIterator> dfs_iterator; typedef
124 dfs_iterator dfs_begin() in dfs_begin()
126 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
132 dfs_iterator dfs_end() in dfs_end()
133 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in dfs_end()
309 bool isGroup(const InputTree::dfs_iterator& pos);
/frameworks/compile/mclinker/unittests/
DBinTreeTest.cpp138 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()
168 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
169 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
189 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
190 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
DInputTreeTest.cpp169 InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
170 InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
/frameworks/compile/mclinker/include/mcld/ADT/
DBinTree.h372 typedef PolicyIterator<value_type, NonConstTraits<value_type>, DFSIterator> dfs_iterator; typedef
402 dfs_iterator dfs_begin() in dfs_begin()
403 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); } in dfs_begin()
405 dfs_iterator dfs_end() in dfs_end()
406 { return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); } in dfs_end()
/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp67 bool mcld::isGroup(const InputTree::dfs_iterator& pos) in isGroup()