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

  /frameworks/compile/mclinker/lib/Core/
InputTree.cpp 21 InputTree& pTree)
23 if (this == &pTree)
26 if (!pTree.empty()) {
27 pMover.connect(pRoot, iterator(pTree.m_Root.node.right));
29 pTree.BinaryTreeBase<Input>::m_Root);
30 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
31 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
  /frameworks/compile/mclinker/include/mcld/
InputTree.h 204 BinaryTree& merge(Pos position, BinaryTree& pTree) {
205 if (this == &pTree)
208 if (!pTree.empty()) {
210 const_cast<const NodeBase*>(pTree.m_Root.node.left));
212 pTree.BinaryTreeBase<Input>::m_Root);
213 BinaryTreeBase<Input>::m_Root.delegate(pTree.m_Root);
214 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
300 InputTree& pTree);
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
rowset.c 108 struct RowSetEntry *pTree; /* Binary tree of entries */
134 p->pTree = 0;
157 p->pTree = 0;
359 ** sorted already. If there is a binary tree on p->pTree, then
366 if( p->pTree ){
368 rowSetTreeToList(p->pTree, &pHead, &pTail);
369 p->pTree = 0;
405 pRowSet->pTree = rowSetListToTree(pRowSet->pEntry);
411 p = pRowSet->pTree;
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_write.c 127 SegmentNode *pTree; /* Pointer to interior tree structure */
    [all...]
  /frameworks/compile/mclinker/include/mcld/ADT/
BinTree.h 460 BinaryTree& merge(Pos position, BinaryTree& pTree) {
461 if (this == &pTree)
464 if (!pTree.empty()) {
466 const_cast<const NodeBase*>(pTree.m_Root.node.left));
468 pTree.BinaryTreeBase<DataType>::m_Root);
469 BinaryTreeBase<DataType>::m_Root.delegate(pTree.m_Root);
470 pTree.m_Root.node.left = pTree.m_Root.node.right = &pTree.m_Root.node;
  /external/chromium_org/third_party/sqlite/amalgamation/
sqlite3.c     [all...]
  /external/sqlite/dist/orig/
sqlite3.c     [all...]
  /external/sqlite/dist/
sqlite3.c     [all...]

Completed in 152 milliseconds