/external/apache-xml/src/main/java/org/apache/xpath/ |
SourceTree.java | 42 m_root = root; 51 public int m_root; field in class:SourceTree
|
NodeSetDTM.java | 113 m_root = nodelist.getRoot(); 130 m_root = ni.getRoot(); 217 if(DTM.NULL == m_root) 225 return m_root; 1166 protected int m_root = DTM.NULL; field in class:NodeSetDTM [all...] |
SourceTreeManager.java | 98 if (owner == sTree.m_root) 152 if(st!=null && st.m_root==n) 218 return sTree.m_root;
|
/external/deqp/executor/ |
xeTestCaseListParser.hpp | 51 TestGroup* m_root; member in class:xe::TestCaseListParser
|
xeTestCaseListParser.cpp | 58 : m_root(DE_NULL) 70 m_root = DE_NULL; 76 m_root = rootGroup; 81 DE_ASSERT(m_root); 128 m_nodeStack.push_back(m_root);
|
xeBatchExecutor.cpp | 160 , m_root (root) 195 computeExecuteSet(m_casesToExecute, m_root, m_testSet, m_batchResult); 205 computeBatchRequest(batchRequest, m_casesToExecute, m_root, m_config.maxCasesPerSession); 250 int numExecuted = removeExecuted(m_casesToExecute, m_root, m_batchResult); 263 computeBatchRequest(batchRequest, m_casesToExecute, m_root, m_config.maxCasesPerSession); 343 XE_CHECK(testSet.hasNode(m_root)); 344 XE_CHECK(m_root->getNodeType() == TESTNODETYPE_ROOT); 345 writeCaseListNode(caseList, m_root, testSet);
|
xeTestCase.cpp | 278 : m_root(root) 295 TestGroup* curGroup = m_root; 432 : m_root(root) 497 return m_root; 505 return m_root != other.m_root || m_iterStack != other.m_iterStack;
|
xeTestCase.hpp | 149 TestRoot* m_root; member in class:xe::TestHierarchyBuilder 211 const TestNode* m_root; member in class:xe::ConstTestNodeIterator
|
xeBatchExecutor.hpp | 110 const TestNode* m_root; member in class:xe::BatchExecutor
|
/ndk/tests/device/test-gnustl-full/unit/cppunit/ |
test_main.cpp | 29 TestCase *TestCase::m_root = 0; member in class:TestCase 33 in_testCase->m_next = m_root; 34 m_root = in_testCase; 43 TestCase *tmp = m_root;
|
cppunit_mini.h | 124 static TestCase *m_root; member in class:TestCase
|
/ndk/tests/device/test-stlport/unit/cppunit/ |
test_main.cpp | 29 TestCase *TestCase::m_root = 0; member in class:TestCase 33 in_testCase->m_next = m_root; 34 m_root = in_testCase; 43 TestCase *tmp = m_root;
|
cppunit_mini.h | 124 static TestCase *m_root; member in class:TestCase
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
btDbvt.cpp | 86 if(node==pdbvt->m_root) pdbvt->m_root=0; 134 if(!pdbvt->m_root) 136 pdbvt->m_root = leaf; 168 pdbvt->m_root = node; 177 if(leaf==pdbvt->m_root) 179 pdbvt->m_root=0; 201 return(prev?prev:pdbvt->m_root); 205 pdbvt->m_root=sibling; 208 return(pdbvt->m_root); [all...] |
btDbvtBroadphase.cpp | 185 m_sets[0].collideTV(m_sets[0].m_root,aabb,collider); 186 m_sets[1].collideTV(m_sets[1].m_root,aabb,collider); 231 m_sets[0].rayTestInternal( m_sets[0].m_root, 241 m_sets[1].rayTestInternal( m_sets[1].m_root, 274 m_sets[0].collideTV(m_sets[0].m_root,bounds,callback); 275 m_sets[1].collideTV(m_sets[1].m_root,bounds,callback); 341 m_sets[1].collideTTpersistentStack(m_sets[1].m_root,proxy->leaf,collider); 342 m_sets[0].collideTTpersistentStack(m_sets[0].m_root,proxy->leaf,collider); 383 m_sets[1].collideTTpersistentStack(m_sets[1].m_root,proxy->leaf,collider); 384 m_sets[0].collideTTpersistentStack(m_sets[0].m_root,proxy->leaf,collider) [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/ |
DynamicTree.java | 48 private DynamicTreeNode m_root; field in class:DynamicTree 60 m_root = null; 165 nodeStack[nodeStackIndex++] = m_root; 241 nodeStack[nodeStackIndex++] = m_root; 309 return computeHeight(m_root); 327 validateStructure(m_root); 328 validateMetrics(m_root); 346 if (m_root == null) { 349 return m_root.height; 374 if (m_root == null) [all...] |
DynamicTreeFlatNodes.java | 42 public int m_root; field in class:DynamicTreeFlatNodes 58 m_root = NULL_NODE; 172 nodeStack[nodeStackIndex++] = m_root; 248 nodeStack[nodeStackIndex++] = m_root; 250 int node = nodeStack[--nodeStackIndex] = m_root; 312 return computeHeight(m_root); 330 validateStructure(m_root); 331 validateMetrics(m_root); 347 if (m_root == NULL_NODE) { 350 return m_height[m_root]; [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
AxesWalker.java | 93 //clone.setCurrentNode(clone.m_root); 183 m_root = DTM.NULL; 196 return m_root; 224 m_root = root; 327 m_currentNode = m_traverser.first(m_root); 335 m_currentNode = m_traverser.next(m_root, m_currentNode); 567 transient int m_root = DTM.NULL; field in class:AxesWalker
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
DOM2DTM.java | 87 transient private Node m_root; field in class:DOM2DTM 93 /** true if ALL the nodes in the m_root subtree have been processed; 127 m_pos=m_root = domSource.getNode(); 130 m_last_kid=addNode(m_root, m_last_parent,m_last_kid, NULL); 143 if(ELEMENT_NODE == m_root.getNodeType()) 145 NamedNodeMap attrs=m_root.getAttributes(); 708 // This would be easier if m_root was always the Document node, but 710 if((m_root==node) || 711 (m_root.getNodeType()==DOCUMENT_NODE && 712 m_root==node.getOwnerDocument()) | [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
b2DynamicTree.cpp | 27 m_root = b2_nullNode; 183 if (m_root == b2_nullNode) 185 m_root = leaf; 186 m_nodes[m_root].parent = b2_nullNode; 192 int32 index = m_root; 295 m_root = newParent; 321 if (leaf == m_root) 323 m_root = b2_nullNode; 370 m_root = sibling; 430 m_root = iC [all...] |
b2DynamicTree.h | 142 int32 m_root; member in class:b2DynamicTree 172 stack.Push(m_root); 230 stack.Push(m_root);
|
/external/emma/core/java12/com/vladium/emma/report/ |
ReportDataModel.java | 159 return m_root; 164 m_root = root; 168 private final IItem m_root; field in class:ReportDataModel.ReportDataView
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
DOMBuilder.java | 57 protected Node m_root = null; field in class:DOMBuilder 81 m_currentNode = m_root = node; 126 return m_root; 182 if (currentNode == m_root && m_nextSibling != null)
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
btCompoundCompoundCollisionAlgorithm.cpp | 344 MycollideTT(tree0->m_root,tree1->m_root,xform,&callback);
|
btCompoundCollisionAlgorithm.cpp | 277 tree->collideTV(tree->m_root,bounds,callback);
|