Searched refs:BinaryTreeBase (Results 1 - 3 of 3) sorted by relevance

/frameworks/compile/mclinker/include/mcld/
H A DInputTree.h68 class BinaryTree<Input> : public BinaryTreeBase<Input>
94 : BinaryTreeBase<Input>()
103 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
110 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
115 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
122 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
126 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
133 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
138 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
145 { return const_dfs_iterator(BinaryTreeBase<Inpu
[all...]
/frameworks/compile/mclinker/include/mcld/ADT/
H A DBinTree.h253 /** \class BinaryTreeBase
254 * \brief BinaryTreeBase gives root node and memory management.
256 * The memory management of nodes in is hidden by BinaryTreeBase.
257 * BinaryTreeBase also provides the basic functions for merging a tree and
263 class BinaryTreeBase : private Uncopyable class in namespace:mcld
330 BinaryTreeBase() function in class:mcld::BinaryTreeBase
334 virtual ~BinaryTreeBase()
357 class BinaryTree : public BinaryTreeBase<DataType>
383 : BinaryTreeBase<DataType>()
391 { return bfs_iterator(BinaryTreeBase<DataTyp
[all...]
/frameworks/compile/mclinker/lib/Core/
H A DInputTree.cpp28 BinaryTreeBase<Input>::m_Root.summon(
29 pTree.BinaryTreeBase<Input>::m_Root);
30 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);

Completed in 85 milliseconds