Home
last modified time | relevance | path

Searched refs:Leftward (Results 1 – 4 of 4) sorted by relevance

/frameworks/compile/mclinker/include/mcld/ADT/
DTreeBase.h31 enum Direct { Leftward, Rightward }; enumerator
77 inline void TreeIteratorBase::move<TreeIteratorBase::Leftward>() {
87 inline void TreeIteratorBase::hook<TreeIteratorBase::Leftward>(
DBinTree.h230 this->move<TreeIteratorBase::Leftward>();
236 this->move<TreeIteratorBase::Leftward>();
436 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
/frameworks/compile/mclinker/unittests/
DBinTreeTest.cpp47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
57 mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1); in TEST_F()
72 mergeTree->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
75 mergeTree->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
88 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1); in TEST_F()
91 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2); in TEST_F()
/frameworks/compile/mclinker/include/mcld/
DInputTree.h181 pPosition.hook<TreeIteratorBase::Leftward>(node); in join()
222 Inclusive = TreeIteratorBase::Leftward,
305 pRoot.hook<TreeIteratorBase::Leftward>(node); in enterGroup()
319 pRoot.hook<TreeIteratorBase::Leftward>(node); in insert()