Home
last modified time | relevance | path

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

/frameworks/compile/mclinker/include/mcld/ADT/
DTreeBase.h29 class TreeIteratorBase {
41 TreeIteratorBase() : m_pNode(NULL) {} in TreeIteratorBase() function
43 explicit TreeIteratorBase(NodeBase* X) : m_pNode(X) {} in TreeIteratorBase() function
45 virtual ~TreeIteratorBase(){}; in ~TreeIteratorBase()
67 bool operator==(const TreeIteratorBase& y) const {
71 bool operator!=(const TreeIteratorBase& y) const {
77 inline void TreeIteratorBase::move<TreeIteratorBase::Leftward>() {
82 inline void TreeIteratorBase::move<TreeIteratorBase::Rightward>() {
87 inline void TreeIteratorBase::hook<TreeIteratorBase::Leftward>(
93 inline void TreeIteratorBase::hook<TreeIteratorBase::Rightward>(
DBinTree.h27 class DFSIterator : public TreeIteratorBase {
29 DFSIterator() : TreeIteratorBase() {} in DFSIterator()
31 explicit DFSIterator(NodeBase* X) : TreeIteratorBase(X) { in DFSIterator()
57 class BFSIterator : public TreeIteratorBase {
59 BFSIterator() : TreeIteratorBase() {} in BFSIterator()
61 explicit BFSIterator(NodeBase* X) : TreeIteratorBase(X) { in BFSIterator()
180 struct TreeIterator : public TreeIteratorBase {
199 TreeIterator() : TreeIteratorBase() {} in TreeIterator()
201 TreeIterator(const iterator& X) : TreeIteratorBase(X.m_pNode) {} in TreeIterator()
219 this->move<TreeIteratorBase::Rightward>();
[all …]
/frameworks/compile/mclinker/include/mcld/
DInputTree.h176 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) { in join()
181 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
194 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) { in merge()
222 Inclusive = TreeIteratorBase::Leftward,
223 Positional = TreeIteratorBase::Rightward
238 virtual void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const = 0;
239 virtual void move(TreeIteratorBase& pNode) const = 0;
247 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
251 void move(TreeIteratorBase& pNode) const { pNode.move<Positional>(); } in move()
258 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const { in connect()
[all …]
/frameworks/compile/mclinker/unittests/
DBinTreeTest.cpp44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1); in TEST_F()
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2); in TEST_F()
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
54 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1); in TEST_F()
56 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1); in TEST_F()
57 mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1); in TEST_F()
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree); in TEST_F()
69 mergeTree->join<TreeIteratorBase::Rightward>(pos, 0); in TEST_F()
[all …]
/frameworks/compile/mclinker/lib/Core/
DInputTree.cpp19 InputTree& InputTree::merge(TreeIteratorBase pRoot, in merge()
34 InputTree& InputTree::enterGroup(TreeIteratorBase pRoot, in enterGroup()
41 InputTree& InputTree::insert(TreeIteratorBase pRoot, in insert()