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

  /frameworks/compile/mclinker/include/mcld/ADT/
TreeBase.h 56 NodeBase* m_pNode;
60 : m_pNode(0)
64 : m_pNode(X)
71 proxy::move<DIRECT>(m_pNode);
75 { return (m_pNode->right == m_pNode); }
78 { return ((m_pNode->right) != (m_pNode->right->right)); }
81 { return ((m_pNode->left) != (m_pNode->left->right));
    [all...]
BinTree.h 40 m_Stack.push(m_pNode->right);
42 m_Stack.push(m_pNode->left);
50 m_pNode = m_pNode->right; // should be root
53 m_pNode = m_Stack.top();
56 m_Stack.push(m_pNode->right);
58 m_Stack.push(m_pNode->left);
75 m_Queue.push(m_pNode->right);
77 m_Queue.push(m_pNode->left);
85 m_pNode = m_pNode->right; // should be roo
    [all...]
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 42 : Base(X.m_pNode) {}
190 proxy::hook<TreeIteratorBase::Leftward>(position.m_pNode,
193 proxy::hook<DIRECT>(position.m_pNode,
209 proxy::hook<DIRECT>(position.m_pNode,
261 proxy::hook<Positional>(pFrom.m_pNode, pTo.m_pNode);
274 proxy::hook<Inclusive>(pFrom.m_pNode, pTo.m_pNode);
329 proxy::hook<TreeIteratorBase::Leftward>(pRoot.m_pNode,
332 proxy::hook<DIRECT>(pRoot.m_pNode,
    [all...]

Completed in 62 milliseconds