HomeSort by relevance Sort by last modified time
    Searched refs:BinaryTreeBase (Results 1 - 3 of 3) sorted by null

  /frameworks/compile/mclinker/include/mcld/
InputTree.h 71 class BinaryTree<Input> : public BinaryTreeBase<Input>
97 : BinaryTreeBase<Input>()
106 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
113 { return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
118 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
125 { return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
129 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
136 { return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right); }
141 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
148 { return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
    [all...]
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 256 /** \class BinaryTreeBase
257 * \brief BinaryTreeBase gives root node and memory management.
259 * The memory management of nodes in is hidden by BinaryTreeBase.
260 * BinaryTreeBase also provides the basic functions for merging a tree and
266 class BinaryTreeBase : private Uncopyable
333 BinaryTreeBase()
337 virtual ~BinaryTreeBase()
360 class BinaryTree : public BinaryTreeBase<DataType>
386 : BinaryTreeBase<DataType>()
394 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
    [all...]
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 28 BinaryTreeBase<Input>::m_Root.summon(
29 pTree.BinaryTreeBase<Input>::m_Root);
30 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);

Completed in 3007 milliseconds