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

  /frameworks/compile/mclinker/include/mcld/MC/
InputBuilder.h 52 const InputTree::iterator& getCurrentNode() const { return m_Root; }
53 InputTree::iterator& getCurrentNode() { return m_Root; }
94 InputTree::iterator m_Root;
112 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
113 m_pMove->move(m_Root);
127 m_pCurrentTree->insert(m_Root, *m_pMove, *input);
128 m_pMove->move(m_Root);
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 311 /// m_Root is a special object who responses:
314 TreeImpl m_Root;
318 NodeType *result = m_Root.produce();
319 result->left = result->right = &m_Root.node;
326 m_Root.deallocate(pNode);
331 : m_Root()
338 return m_Root.size();
342 return m_Root.empty();
347 m_Root.clear();
391 { return bfs_iterator(BinaryTreeBase<DataType>::m_Root.node.left);
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
ToHTMLStream.java     [all...]
  /external/pdfium/core/src/fpdfdoc/
doc_form.cpp 113 _Node m_Root;
117 m_Root.parent = NULL;
118 m_Root.field_ptr = NULL;
172 CFX_PtrArray& ptr_array = m_Root.children;
187 _Node *pNode = &m_Root, *pLast = NULL;
197 if (pNode != &m_Root) {
210 _Node *pNode = &m_Root, *pLast = NULL;
228 _Node *pNode = &m_Root, *pLast = NULL;
235 if (pNode && pNode != &m_Root) {
258 _Node *pNode = &m_Root, *pLast = NULL;
    [all...]

Completed in 63 milliseconds