HomeSort by relevance Sort by last modified time
    Searched full:bfs_iterator (Results 1 - 5 of 5) sorted by null

  /frameworks/compile/mclinker/include/mcld/
InputTree.h 85 typedef PolicyIterator<value_type, NonConstTraits<value_type>, BFSIterator> bfs_iterator; typedef in class:mcld::BinaryTree
101 bfs_iterator bfs_begin()
103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
109 bfs_iterator bfs_end()
110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
311 bool isGroup(const InputTree::bfs_iterator& pos);
  /frameworks/compile/mclinker/unittests/
BinTreeTest.cpp 212 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
213 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
244 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
245 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
265 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin();
266 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end();
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 374 typedef PolicyIterator<value_type, NonConstTraits<value_type>, BFSIterator> bfs_iterator; typedef in class:mcld::BinaryTree
390 bfs_iterator bfs_begin()
391 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); }
393 bfs_iterator bfs_end()
394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); }
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 77 bool mcld::isGroup(const InputTree::bfs_iterator& pos)
  /frameworks/compile/mclinker/lib/Object/
ObjectLinker.cpp 291 mcld::InputTree::bfs_iterator input, inEnd = m_pModule->getInputTree().bfs_end();
    [all...]

Completed in 1408 milliseconds