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

  /frameworks/compile/mclinker/include/mcld/ADT/
TreeBase.h 31 enum Direct { Leftward, Rightward };
77 inline void TreeIteratorBase::move<TreeIteratorBase::Leftward>() {
87 inline void TreeIteratorBase::hook<TreeIteratorBase::Leftward>(
BinTree.h 175 * rightward, and decremental direction is leftward.
230 this->move<TreeIteratorBase::Leftward>();
236 this->move<TreeIteratorBase::Leftward>();
436 pPosition.hook<TreeIteratorBase::Leftward>(node);
  /frameworks/compile/mclinker/unittests/
BinTreeTest.cpp 47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
57 mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1);
72 mergeTree->join<TreeIteratorBase::Leftward>(pos, 1);
75 mergeTree->join<TreeIteratorBase::Leftward>(pos, 2);
88 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
91 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 181 pPosition.hook<TreeIteratorBase::Leftward>(node);
222 Inclusive = TreeIteratorBase::Leftward,
305 pRoot.hook<TreeIteratorBase::Leftward>(node);
319 pRoot.hook<TreeIteratorBase::Leftward>(node);

Completed in 569 milliseconds