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 29 class TreeIteratorBase {
41 TreeIteratorBase() : m_pNode(NULL) {}
43 explicit TreeIteratorBase(NodeBase* X) : m_pNode(X) {}
45 virtual ~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>()
    [all...]
BinTree.h 27 class DFSIterator : public TreeIteratorBase {
29 DFSIterator() : TreeIteratorBase() {}
31 explicit DFSIterator(NodeBase* X) : TreeIteratorBase(X) {
57 class BFSIterator : public TreeIteratorBase {
59 BFSIterator() : TreeIteratorBase() {}
61 explicit BFSIterator(NodeBase* X) : TreeIteratorBase(X) {
177 * @see TreeIteratorBase
180 struct TreeIterator : public TreeIteratorBase {
199 TreeIterator() : TreeIteratorBase() {}
201 TreeIterator(const iterator& X) : TreeIteratorBase(X.m_pNode) {
    [all...]
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 176 BinaryTree& join(TreeIteratorBase& pPosition, const Input& value) {
181 pPosition.hook<TreeIteratorBase::Leftward>(node);
194 BinaryTree& merge(TreeIteratorBase& pPosition, BinaryTree& pTree) {
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 {
251 void move(TreeIteratorBase& pNode) const { pNode.move<Positional>(); }
258 void connect(TreeIteratorBase& pFrom, NodeBase* pTo) const
    [all...]
  /frameworks/compile/mclinker/unittests/
BinTreeTest.cpp 44 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 0);
46 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 1);
47 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 1);
49 m_pTestee->join<TreeIteratorBase::Rightward>(pos, 2);
50 m_pTestee->join<TreeIteratorBase::Leftward>(pos, 2);
54 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);
56 mergeTree->join<TreeIteratorBase::Rightward>(pos2, 1);
57 mergeTree->join<TreeIteratorBase::Leftward>(pos2, 1);
59 m_pTestee->merge<TreeIteratorBase::Rightward>(pos, *mergeTree);
69 mergeTree->join<TreeIteratorBase::Rightward>(pos, 0)
    [all...]
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 19 InputTree& InputTree::merge(TreeIteratorBase pRoot,
34 InputTree& InputTree::enterGroup(TreeIteratorBase pRoot,
41 InputTree& InputTree::insert(TreeIteratorBase pRoot,

Completed in 452 milliseconds