Searched refs:bfs_iterator (Results 1 – 5 of 5) sorted by relevance
85 typedef PolicyIterator<value_type, NonConstTraits<value_type>, BFSIterator> bfs_iterator; typedef101 bfs_iterator bfs_begin() in bfs_begin()103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); in bfs_begin()109 bfs_iterator bfs_end() in bfs_end()110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); } in bfs_end()311 bool isGroup(const InputTree::bfs_iterator& pos);
212 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin(); in TEST_F()213 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end(); in TEST_F()244 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin(); in TEST_F()245 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end(); in TEST_F()265 BinaryTree<int>::bfs_iterator bfs_it = m_pTestee->bfs_begin(); in TEST_F()266 BinaryTree<int>::bfs_iterator bfs_end = m_pTestee->bfs_end(); in TEST_F()
374 typedef PolicyIterator<value_type, NonConstTraits<value_type>, BFSIterator> bfs_iterator; typedef390 bfs_iterator bfs_begin() in bfs_begin()391 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left); } in bfs_begin()393 bfs_iterator bfs_end() in bfs_end()394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.right); } in bfs_end()
77 bool mcld::isGroup(const InputTree::bfs_iterator& pos) in isGroup()
291 mcld::InputTree::bfs_iterator input, inEnd = m_pModule->getInputTree().bfs_end(); in readRelocations()