Home
last modified time | relevance | path

Searched refs:TreeIteratorBase (Results 1 – 5 of 5) sorted by relevance

/frameworks/compile/mclinker/include/mcld/ADT/
DTreeBase.h31 class TreeIteratorBase
47 TreeIteratorBase() in TreeIteratorBase() function
51 TreeIteratorBase(NodeBase *X) in TreeIteratorBase() function
55 virtual ~TreeIteratorBase(){}; in ~TreeIteratorBase()
72 bool operator==(const TreeIteratorBase& y) const
75 bool operator!=(const TreeIteratorBase& y) const
80 void TreeIteratorBase::move<TreeIteratorBase::Leftward>()
86 void TreeIteratorBase::move<TreeIteratorBase::Rightward>()
92 void TreeIteratorBase::hook<TreeIteratorBase::Leftward>(NodeBase* pOther)
98 void TreeIteratorBase::hook<TreeIteratorBase::Rightward>(NodeBase* pOther)
DBinTree.h27 class DFSIterator : public TreeIteratorBase
31 : TreeIteratorBase() in DFSIterator()
35 : TreeIteratorBase(X) { in DFSIterator()
62 class BFSIterator : public TreeIteratorBase
66 : TreeIteratorBase() in BFSIterator()
70 : TreeIteratorBase(X) { in BFSIterator()
186 struct TreeIterator : public TreeIteratorBase
207 : TreeIteratorBase() {} in TreeIterator()
210 : TreeIteratorBase(X.m_pNode) {} in TreeIterator()
228 this->move<TreeIteratorBase::Rightward>();
[all …]
/frameworks/compile/mclinker/include/mcld/
DInputTree.h183 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) { in join()
188 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
201 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()
231 Inclusive = TreeIteratorBase::Leftward,
232 Positional = TreeIteratorBase::Rightward
247 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
248 virtual void move(TreeIteratorBase& pNode) const = 0;
256 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
260 void move(TreeIteratorBase& pNode) const { in move()
269 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
[all …]
/frameworks/compile/mclinker/unittests/
DBinTreeTest.cpp51 m_pTestee->join<TreeIteratorBase::Rightward>(pos,0); in TEST_F()
53 m_pTestee->join<TreeIteratorBase::Rightward>(pos,1); in TEST_F()
54 m_pTestee->join<TreeIteratorBase::Leftward>(pos,1); in TEST_F()
56 m_pTestee->join<TreeIteratorBase::Rightward>(pos,2); in TEST_F()
57 m_pTestee->join<TreeIteratorBase::Leftward>(pos,2); in TEST_F()
61 mergeTree->join<TreeIteratorBase::Rightward>(pos2,1); in TEST_F()
63 mergeTree->join<TreeIteratorBase::Rightward>(pos2,1); in TEST_F()
64 mergeTree->join<TreeIteratorBase::Leftward>(pos2,1); in TEST_F()
66 m_pTestee->merge<TreeIteratorBase::Rightward>(pos,*mergeTree); in TEST_F()
77 mergeTree->join<TreeIteratorBase::Rightward>(pos,0); in TEST_F()
[all …]
/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp19 InputTree& InputTree::merge(TreeIteratorBase pRoot, in merge()
36 InputTree& InputTree::enterGroup(TreeIteratorBase pRoot, in enterGroup()
44 InputTree& InputTree::insert(TreeIteratorBase pRoot, in insert()