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

  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 26 pMover.connect(pRoot, pTree.m_Root.node.right);
27 BinaryTreeBase<Input>::m_Root.summon(pTree.BinaryTreeBase<Input>::m_Root);
28 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
29 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 296 /// m_Root is a special object who responses:
299 TreeImpl m_Root;
303 NodeType* result = m_Root.produce();
304 result->left = result->right = &m_Root.node;
311 m_Root.deallocate(pNode);
315 BinaryTreeBase() : m_Root() {}
319 size_t size() const { return m_Root.size(); }
321 bool empty() const { return m_Root.empty(); }
324 void clear() { m_Root.clear(); }
371 return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left)
    [all...]
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 100 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
107 return bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
112 const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
119 return const_bfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
123 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
130 return dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
135 const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left);
142 return const_dfs_iterator(BinaryTreeBase<Input>::m_Root.node.right);
145 iterator root() { return iterator(&(BinaryTreeBase<Input>::m_Root.node)); }
151 const_cast<NodeBase*>(&BinaryTreeBase<Input>::m_Root.node))
    [all...]
  /frameworks/compile/mclinker/include/mcld/MC/
InputBuilder.h 51 const InputTree::iterator& getCurrentNode() const { return m_Root; }
52 InputTree::iterator& getCurrentNode() { return m_Root; }
93 InputTree::iterator m_Root;
110 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
111 m_pMove->move(m_Root);
125 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
126 m_pMove->move(m_Root);
  /frameworks/compile/mclinker/lib/MC/
InputBuilder.cpp 24 m_Root(),
42 m_Root(),
64 m_pCurrentTree->enterGroup(m_Root, *m_pMove);
65 m_pMove->move(m_Root);
66 m_ReturnStack.push(m_Root);
75 m_Root = m_ReturnStack.top();
98 m_Root = m_pCurrentTree->root();
  /external/pdfium/core/src/fpdfdoc/
doc_form.cpp 87 _Node m_Root;
90 m_Root.parent = NULL;
91 m_Root.field_ptr = NULL;
136 for (int i = 0; i < m_Root.children.GetSize(); i++) {
137 RemoveNode(m_Root.children[i]);
149 _Node *pNode = &m_Root, *pLast = NULL;
159 if (pNode != &m_Root) {
171 _Node *pNode = &m_Root, *pLast = NULL;
188 _Node *pNode = &m_Root, *pLast = NULL;
195 if (pNode && pNode != &m_Root) {
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
ToHTMLStream.java     [all...]
  /external/pdfium/xfa/src/fgas/include/
fx_utl.h 691 CFX_CPLTree() : m_Root() {}
693 CPLTreeNode* pNode = m_Root.GetNode(CPLTreeNode::LastNeighbor);
703 CPLTreeNode* GetRoot() { return &m_Root; }
706 pParent = &m_Root;
722 CPLTreeNode m_Root;
  /prebuilts/tools/common/m2/repository/xalan/serializer/2.7.1/
serializer-2.7.1.jar 

Completed in 171 milliseconds