Home
last modified time | relevance | path

Searched refs:nextNode (Results 1 – 25 of 121) sorted by relevance

12345

/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DDTMTreeWalker.java115 int nextNode = m_dtm.getFirstChild(pos); in traverse() local
116 while (DTM.NULL == nextNode) in traverse()
123 nextNode = m_dtm.getNextSibling(pos); in traverse()
125 if (DTM.NULL == nextNode) in traverse()
136 nextNode = DTM.NULL; in traverse()
143 pos = nextNode; in traverse()
168 int nextNode = m_dtm.getFirstChild(pos); in traverse() local
169 while (DTM.NULL == nextNode) in traverse()
176 nextNode = m_dtm.getNextSibling(pos); in traverse()
178 if (DTM.NULL == nextNode) in traverse()
[all …]
DDTMNodeIterator.java158 public Node nextNode() throws DOMException in nextNode() method in DTMNodeIterator
163 int handle=dtm_iter.nextNode(); in nextNode()
/external/apache-xml/src/main/java/org/apache/xml/serializer/
DTreeWalker.java147 Node nextNode = pos.getFirstChild(); in traverse() local
149 while (null == nextNode) in traverse()
156 nextNode = pos.getNextSibling(); in traverse()
158 if (null == nextNode) in traverse()
167 nextNode = null; in traverse()
174 pos = nextNode; in traverse()
201 Node nextNode = pos.getFirstChild(); in traverse() local
203 while (null == nextNode) in traverse()
210 nextNode = pos.getNextSibling(); in traverse()
212 if (null == nextNode) in traverse()
[all …]
/external/apache-xml/src/main/java/org/apache/xml/utils/
DTreeWalker.java179 Node nextNode = pos.getFirstChild(); in traverseFragment() local
181 while (null == nextNode) in traverseFragment()
188 nextNode = pos.getNextSibling(); in traverseFragment()
190 if (null == nextNode) in traverseFragment()
199 nextNode = null; in traverseFragment()
206 pos = nextNode; in traverseFragment()
232 Node nextNode = pos.getFirstChild(); in traverse() local
234 while (null == nextNode) in traverse()
241 nextNode = pos.getNextSibling(); in traverse()
243 if (null == nextNode) in traverse()
[all …]
/external/apache-xml/src/main/java/org/apache/xpath/axes/
DLocPathIterator.java241 int node = clone.nextNode(); in executeCharsToContentHandler()
302 int next = iter.nextNode(); in asNode()
556 while (DTM.NULL != (next = clone.nextNode())) in getLength()
751 public abstract int nextNode(); in nextNode() method in LocPathIterator
761 protected int returnNextNode(int nextNode) in returnNextNode() argument
764 if (DTM.NULL != nextNode) in returnNextNode()
769 m_lastFetched = nextNode; in returnNextNode()
771 if (DTM.NULL == nextNode) in returnNextNode()
774 return nextNode; in returnNextNode()
806 while (DTM.NULL != (n = nextNode())); in runTo()
[all …]
DAxesWalker.java353 public int nextNode() in nextNode() method in AxesWalker
355 int nextNode = DTM.NULL; in nextNode() local
363 nextNode = walker.getNextNode(); in nextNode()
365 if (DTM.NULL == nextNode) in nextNode()
372 if (walker.acceptNode(nextNode) != DTMIterator.FILTER_ACCEPT) in nextNode()
390 walker.setRoot(nextNode); in nextNode()
399 return nextNode; in nextNode()
441 while (DTM.NULL != (next = walker.nextNode())) in getLastPos()
DUnionPathIterator.java82 iter.nextNode(); in setRoot()
119 expr.nextNode(); in addIterator()
382 public int nextNode() in nextNode() method in UnionPathIterator
413 m_iterators[i].nextNode(); in nextNode()
430 m_iterators[iteratorUsed].nextNode(); in nextNode()
DNodeSequence.java310 public int nextNode() in nextNode() method in NodeSequence
335 int next = m_iter.nextNode(); in nextNode()
494 while (DTM.NULL != (n = nextNode())); in runTo()
511 while ((m_next < index) && DTM.NULL != (n = nextNode())); in runTo()
530 int n = nextNode(); in item()
DWalkingIterator.java169 public int nextNode() in nextNode() method in WalkingIterator
184 return returnNextNode(m_firstWalker.nextNode()); in nextNode()
195 int n = returnNextNode(m_firstWalker.nextNode()); in nextNode()
DReverseAxesWalker.java152 while (DTM.NULL != (next = clone.nextNode())) in getProximityPosition()
215 while (DTM.NULL != (next = clone.nextNode())) in getLastPos()
/external/antlr/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/
DTestRewriteRuleTokenStream.m104 CommonTree *tree = [stream nextNode];
112 STAssertNoThrow(tree1 = [stream nextNode],
115 STAssertNoThrow(tree2 = [stream nextNode],
130 STAssertNoThrow(tree1 = [stream nextNode],
136 STAssertNoThrow(tree2 = [stream nextNode],
142 STAssertNoThrow(tree3 = [stream nextNode],
148 STAssertThrows(tree4 = [stream nextNode],
161 STAssertNoThrow(tree1 = [stream nextNode],
167 STAssertNoThrow(tree2 = [stream nextNode],
173 STAssertNoThrow(tree3 = [stream nextNode],
[all …]
/external/icu/icu4c/source/tools/ctestfw/
Dctest.c225 TestNode *nextNode, *curNode; in addTestNode() local
237 nextNode = curNode->child; in addTestNode()
245 if( nextNode == NULL ) in addTestNode()
265 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
267 curNode = nextNode; in addTestNode()
268 nextNode = nextNode -> sibling; in addTestNode()
270 if ( nextNode == NULL ) in addTestNode()
273 nextNode = createTestNode(name, nameLen); in addTestNode()
274 curNode->sibling = nextNode; in addTestNode()
283 return nextNode; in addTestNode()
[all …]
/external/antlr/runtime/C/src/
Dantlr3rewritestreams.c52 static pANTLR3_BASE_TREE nextNode (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream);
229 stream->nextNode = nextNode; in antlr3RewriteRuleElementStreamNewAE()
325 stream->nextNode = nextNodeToken; in antlr3RewriteRuleTOKENStreamNewAE()
344 stream->nextNode = nextNodeToken; in antlr3RewriteRuleTOKENStreamNewAEE()
363 stream->nextNode = nextNodeToken; in antlr3RewriteRuleTOKENStreamNewAEV()
389 stream->nextNode = nextNode; in antlr3RewriteRuleSubtreeStreamNewAE()
411 stream->nextNode = nextNode; in antlr3RewriteRuleSubtreeStreamNewAEE()
434 stream->nextNode = nextNode; in antlr3RewriteRuleSubtreeStreamNewAEV()
459 stream->nextNode = nextNodeNode; in antlr3RewriteRuleNODEStreamNewAE()
478 stream->nextNode = nextNodeNode; in antlr3RewriteRuleNODEStreamNewAEE()
[all …]
Dantlr3collections.c1865 pANTLR3_INT_TRIE_NODE nextNode; in intTrieGet() local
1883 nextNode = thisNode->leftN; /* Examine the left node from the root */ in intTrieGet()
1887 while (thisNode->bitNum > nextNode->bitNum) in intTrieGet()
1891 thisNode = nextNode; in intTrieGet()
1897 if (key & bitMask[nextNode->bitNum]) in intTrieGet()
1899 nextNode = nextNode->rightN; /* 1 is right */ in intTrieGet()
1903 nextNode = nextNode->leftN; /* 0 is left */ in intTrieGet()
1918 if (nextNode->key == key) in intTrieGet()
1922 return nextNode->buckets; in intTrieGet()
1956 pANTLR3_INT_TRIE_NODE nextNode; in intTrieAdd() local
[all …]
/external/lzma/CPP/7zip/UI/Common/
DEnumDirItems.cpp476 const NWildcard::CCensorNode *nextNode = 0; in EnumerateForItem() local
481 nextNode = &curNode.SubNodes[index]; in EnumerateForItem()
483 if (!enterToSubFolders2 && nextNode == 0) in EnumerateForItem()
487 if (nextNode == 0) in EnumerateForItem()
489 nextNode = &curNode; in EnumerateForItem()
494 *nextNode, phyParent, logParent, fi.Name, phyPrefix, in EnumerateForItem()
680 const NWildcard::CCensorNode *nextNode = 0; in EnumerateDirItems() local
687 nextNode = &curNode.SubNodes[index]; in EnumerateDirItems()
691 nextNode = &curNode; in EnumerateDirItems()
695 RINOK(EnumerateDirItems_Spec(*nextNode, phyParent, logParent, fi.Name, phyPrefix, in EnumerateDirItems()
[all …]
/external/bcc/src/cc/frontends/p4/compiler/
DebpfTable.py270 def serializeCode(self, serializer, program, nextNode): argument
347 self.runAction(serializer, self.name, valueName, program, nextNode)
349 nextNode = self.hlirtable.next_
350 if "hit" in nextNode:
351 node = nextNode["hit"]
353 node = nextNode
359 node = nextNode["miss"]
361 node = nextNode
368 if not "hit" in nextNode:
376 def runAction(self, serializer, tableName, valueName, program, nextNode): argument
[all …]
DebpfConditional.py79 def generateCode(self, serializer, program, nextNode): argument
87 trueBranch = nextNode
90 falseBranch = nextNode
/external/antlr/runtime/Cpp/include/
Dantlr3collections.inl181 IntTrieNodeType* nextNode; local
198 nextNode = thisNode->get_leftN(); /* Examine the left node from the root */
203 while( thisNode->get_bitNum() > nextNode->get_bitNum() )
207 thisNode = nextNode;
213 if (key & bitMask[nextNode->get_bitNum()])
215 nextNode = nextNode->get_rightN(); /* 1 is right */
219 nextNode = nextNode->get_leftN(); /* 0 is left */
234 if (nextNode->get_key() == key)
238 return nextNode->get_buckets();
261 IntTrieNodeType* nextNode; local
[all …]
/external/icu/icu4c/source/common/unicode/
Dstringtriebuilder.h297 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
298 : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
314 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
315 : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), in LinearMatchNode()
316 length(len), next(nextNode) {} in LinearMatchNode()
405 Node *nextNode) const = 0;
/external/apache-xml/src/main/java/org/apache/xpath/objects/
DXNodeSet.java176 int node = nextNode(); in numWithSideEffects()
200 return (nextNode() != DTM.NULL); in boolWithSideEffects()
499 while (DTM.NULL != (node1 = list1.nextNode())) in compare()
507 while (DTM.NULL != (node2 = list2.nextNode())) in compare()
570 while (DTM.NULL != (node = list1.nextNode())) in compare()
589 while (DTM.NULL != (node = list1.nextNode())) in compare()
615 while (DTM.NULL != (node = list1.nextNode())) in compare()
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
DKeyTable.java197 while (DTM.NULL != (currentNode = m_keyNodes.nextNode())) in getRefsTable()
216 while (DTM.NULL != (currentNodeInUseClause = i.nextNode())) { in getRefsTable()
245 nodes.nextNode(); in addValueInRefsTable()
256 nodes.nextNode(); in addValueInRefsTable()
/external/apache-xml/src/main/java/org/apache/xpath/patterns/
DFunctionPattern.java113 while (DTM.NULL != (n = nl.nextNode())) in execute()
157 while (DTM.NULL != (n = nl.nextNode())) in execute()
200 while (DTM.NULL != (n = nl.nextNode())) in execute()
/external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/
DDOM3TreeWalker.java274 Node nextNode = null; in traverse() local
276 nextNode = pos.getFirstChild(); in traverse()
278 while (null == nextNode) { in traverse()
284 nextNode = pos.getNextSibling(); in traverse()
286 if (null == nextNode) { in traverse()
293 nextNode = null; in traverse()
300 pos = nextNode; in traverse()
347 Node nextNode = null; in traverse() local
349 nextNode = pos.getFirstChild(); in traverse()
351 while (null == nextNode) { in traverse()
[all …]
/external/apache-xml/src/main/java/org/apache/xpath/
DNodeSetDTM.java148 while (null != (node = iterator.nextNode())) in NodeSetDTM()
385 public int nextNode() in nextNode() method in NodeSetDTM
656 while (DTM.NULL != (obj = iterator.nextNode())) in addNodes()
711 while (DTM.NULL != (node = iterator.nextNode())) in addNodesInDocOrder()
/external/libdrm/amdgpu/
Dutil_hash.c223 struct util_node **nextNode = util_hash_find_node(hash, key); in util_hash_insert() local
224 struct util_node *node = util_hash_create_node(hash, key, data, nextNode); in util_hash_insert()
281 struct util_node **nextNode = util_hash_find_node(hash, key); in util_hash_find() local
282 struct util_hash_iter iter = {hash, *nextNode}; in util_hash_find()

12345