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

  /frameworks/compile/mclinker/include/mcld/ADT/
TreeBase.h 43 class TreeIteratorBase
59 TreeIteratorBase()
63 TreeIteratorBase(NodeBase *X)
67 virtual ~TreeIteratorBase(){};
83 bool operator==(const TreeIteratorBase& y) const
86 bool operator!=(const TreeIteratorBase& y) const
93 inline void move<TreeIteratorBase::Leftward>(NodeBase *&X)
97 inline void move<TreeIteratorBase::Rightward>(NodeBase *&X)
101 inline void hook<TreeIteratorBase::Leftward>(NodeBase *X, const NodeBase *Y)
105 inline void hook<TreeIteratorBase::Rightward>(NodeBase* X, const NodeBase* Y
    [all...]
BinTree.h 30 class DFSIterator : public TreeIteratorBase
34 : TreeIteratorBase()
38 : TreeIteratorBase(X) {
65 class BFSIterator : public TreeIteratorBase
69 : TreeIteratorBase()
73 : TreeIteratorBase(X) {
186 * @see TreeIteratorBase
189 struct TreeIterator : public TreeIteratorBase
210 : TreeIteratorBase() {}
213 : TreeIteratorBase(X.m_pNode) {
    [all...]
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 190 proxy::hook<TreeIteratorBase::Leftward>(position.m_pNode,
235 Inclusive = TreeIteratorBase::Leftward,
236 Positional = TreeIteratorBase::Rightward
252 virtual void connect(TreeIteratorBase& pFrom, const TreeIteratorBase& pTo) const = 0;
253 virtual void move(TreeIteratorBase& pNode) const = 0;
260 virtual void connect(TreeIteratorBase& pFrom, const TreeIteratorBase& pTo) const {
264 virtual void move(TreeIteratorBase& pNode) const {
273 virtual void connect(TreeIteratorBase& pFrom, const TreeIteratorBase& pTo) const
    [all...]
  /frameworks/compile/mclinker/unittests/
BinTreeTest.cpp 51 m_pTestee->join<TreeIteratorBase::Rightward>(pos,0);
53 m_pTestee->join<TreeIteratorBase::Rightward>(pos,1);
54 m_pTestee->join<TreeIteratorBase::Leftward>(pos,1);
56 m_pTestee->join<TreeIteratorBase::Rightward>(pos,2);
57 m_pTestee->join<TreeIteratorBase::Leftward>(pos,2);
61 mergeTree->join<TreeIteratorBase::Rightward>(pos2,1);
63 mergeTree->join<TreeIteratorBase::Rightward>(pos2,1);
64 mergeTree->join<TreeIteratorBase::Leftward>(pos2,1);
66 m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree);
77 mergeTree->join<TreeIteratorBase::Rightward>(pos,0)
    [all...]
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 19 InputTree& InputTree::merge(TreeIteratorBase pRoot,
36 InputTree& InputTree::enterGroup(TreeIteratorBase pRoot,
44 InputTree& InputTree::insert(TreeIteratorBase pRoot,

Completed in 44 milliseconds