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

  /frameworks/compile/mclinker/include/mcld/ADT/
TreeBase.h 19 class NodeBase
22 NodeBase *left;
23 NodeBase *right;
26 NodeBase()
34 inline void move(NodeBase *&X)
38 inline void hook(NodeBase *X, const NodeBase *Y)
56 NodeBase* m_pNode;
63 TreeIteratorBase(NodeBase *X)
93 inline void move<TreeIteratorBase::Leftward>(NodeBase *&X
    [all...]
BinTree.h 37 DFSIterator(NodeBase *X)
62 std::stack<NodeBase *> m_Stack;
72 BFSIterator(NodeBase *X)
97 std::queue<NodeBase *> m_Queue;
126 explicit PolicyIteratorBase(NodeBase* X)
159 explicit PolicyIterator(NodeBase* X)
252 explicit TreeIterator(NodeBase* X)
286 NodeBase node;
466 const_cast<const NodeBase*>(pTree.m_Root.node.left));
  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 39 NodeBase* node = createNode();
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 44 explicit PolicyIterator(NodeBase* X)
155 // FIXME: provide the iterater constructors for constant NodeBase instead of
158 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node));
210 const_cast<const NodeBase*>(pTree.m_Root.node.left));
  /external/llvm/include/llvm/ADT/
IntervalMap.h 186 //--- IntervalMapImpl::NodeBase ---//
213 class NodeBase {
226 void copy(const NodeBase<T1, T2, M> &Other, unsigned i,
285 void transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize,
296 void transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize,
309 int adjustFromLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, int Add) {
443 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
559 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
697 class BranchNode : public NodeBase<NodeRef, KeyT, N> {
    [all...]

Completed in 191 milliseconds