Home
last modified time | relevance | path

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

/frameworks/compile/mclinker/include/mcld/
DInputTree.h81 dfs_iterator; typedef
122 dfs_iterator dfs_begin() { in dfs_begin()
123 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in dfs_begin()
129 dfs_iterator dfs_end() { in dfs_end()
130 return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); in dfs_end()
290 bool isGroup(const InputTree::dfs_iterator& pos);
/frameworks/compile/mclinker/unittests/
DBinTreeTest.cpp127 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
128 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
156 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
157 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
175 BinaryTree<int>::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
176 BinaryTree<int>::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
DInputTreeTest.cpp154 InputTree::dfs_iterator dfs_it = m_pTestee->dfs_begin(); in TEST_F()
155 InputTree::dfs_iterator dfs_end = m_pTestee->dfs_end(); in TEST_F()
/frameworks/compile/mclinker/include/mcld/ADT/
DBinTree.h351 dfs_iterator; typedef
386 dfs_iterator dfs_begin() { in dfs_begin()
387 return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); in dfs_begin()
390 dfs_iterator dfs_end() { in dfs_end()
391 return dfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); in dfs_end()
/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp61 bool isGroup(const InputTree::dfs_iterator& pos) { in isGroup()