Home
last modified time | relevance | path

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

123456

/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
DShadowUriMatcher.java83 MatchNode nextNode = null; in addNodes() local
87 nextNode = baseNode.number; in addNodes()
88 if (nextNode == null) { in addNodes()
89 nextNode = new MatchNode(rootNode.code); in addNodes()
90 baseNode.number = nextNode; in addNodes()
94 nextNode = baseNode.text; in addNodes()
95 if (nextNode == null) { in addNodes()
96 nextNode = new MatchNode(rootNode.code); in addNodes()
97 baseNode.text = nextNode; in addNodes()
101 nextNode = baseNode.map.get(segment); in addNodes()
[all …]
/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()
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()
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()
/external/lzma/CPP/7zip/UI/Common/
DEnumDirItems.cpp239 const NWildcard::CCensorNode *nextNode = 0; in EnumerateDirItems() local
246 nextNode = &curNode.SubNodes[index]; in EnumerateDirItems()
250 nextNode = &curNode; in EnumerateDirItems()
254 RINOK(EnumerateDirItems_Spec(*nextNode, phyParent, logParent, fi.Name, phyPrefix, in EnumerateDirItems()
262 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i]; in EnumerateDirItems() local
263 const UString fullPath = phyPrefix + nextNode.Name; in EnumerateDirItems()
267 if (!nextNode.AreThereIncludeItems()) in EnumerateDirItems()
280 RINOK(EnumerateDirItems_Spec(nextNode, phyParent, logParent, fi.Name, phyPrefix, in EnumerateDirItems()
322 const NWildcard::CCensorNode *nextNode = 0; in EnumerateDirItems() local
327 nextNode = &curNode.SubNodes[index]; in EnumerateDirItems()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/
DTestRewriteRuleTokenStream.m104 ANTLRCommonTree *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/antlr/antlr-3.4/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.c1824 pANTLR3_INT_TRIE_NODE nextNode; in intTrieGet() local
1842 nextNode = thisNode->leftN; /* Examine the left node from the root */ in intTrieGet()
1846 while (thisNode->bitNum > nextNode->bitNum) in intTrieGet()
1850 thisNode = nextNode; in intTrieGet()
1856 if (key & bitMask[nextNode->bitNum]) in intTrieGet()
1858 nextNode = nextNode->rightN; /* 1 is right */ in intTrieGet()
1862 nextNode = nextNode->leftN; /* 0 is left */ in intTrieGet()
1877 if (nextNode->key == key) in intTrieGet()
1881 return nextNode->buckets; in intTrieGet()
1916 pANTLR3_INT_TRIE_NODE nextNode; in intTrieAdd() local
[all …]
/external/chromium_org/third_party/icu/source/tools/ctestfw/
Dctest.c223 TestNode *nextNode, *curNode; in addTestNode() local
235 nextNode = curNode->child; in addTestNode()
243 if( nextNode == NULL ) in addTestNode()
263 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
265 curNode = nextNode; in addTestNode()
266 nextNode = nextNode -> sibling; in addTestNode()
268 if ( nextNode == NULL ) in addTestNode()
271 nextNode = createTestNode(name, nameLen); in addTestNode()
272 curNode->sibling = nextNode; in addTestNode()
281 return nextNode; in addTestNode()
[all …]
/external/icu/icu4c/source/tools/ctestfw/
Dctest.c223 TestNode *nextNode, *curNode; in addTestNode() local
235 nextNode = curNode->child; in addTestNode()
243 if( nextNode == NULL ) in addTestNode()
263 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
265 curNode = nextNode; in addTestNode()
266 nextNode = nextNode -> sibling; in addTestNode()
268 if ( nextNode == NULL ) in addTestNode()
271 nextNode = createTestNode(name, nameLen); in addTestNode()
272 curNode->sibling = nextNode; in addTestNode()
281 return nextNode; in addTestNode()
[all …]
/external/chromium_org/third_party/WebKit/Source/core/dom/
DNodeRenderingTraversal.cpp176 Node* nextNode = nextSibling(node); in pseudoAwareNextSibling() local
178 if (parentNode && parentNode->isElementNode() && !nextNode) { in pseudoAwareNextSibling()
186 return nextNode; in pseudoAwareNextSibling()
211 if (Node* nextNode = pseudoAwareNextSibling(node)) in next() local
212 return nextNode; in next()
216 if (Node* nextNode = pseudoAwareNextSibling(parentNode)) in next() local
217 return nextNode; in next()
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
DCanvasProfileView.js233 var nextNode = selectedNode;
235 … nextNode = forward ? nextNode.traverseNextNode(false) : nextNode.traversePreviousNode(false);
236 } while (nextNode && typeof nextNode.index !== "number");
237 (nextNode || selectedNode).revealAndSelect();
248 var nextNode = selectedNode;
249 while (nextNode) {
250 var sibling = forward ? nextNode.nextSibling : nextNode.previousSibling;
252 nextNode = sibling;
253 if (nextNode.hasChildren || nextNode.call.isDrawingCall)
256 nextNode = nextNode.parent;
[all …]
/external/icu/icu4c/source/common/unicode/
Dstringtriebuilder.h284 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
285 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
298 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
299 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), in LinearMatchNode()
300 length(len), next(nextNode) {} in LinearMatchNode()
386 Node *nextNode) const = 0;
/external/chromium_org/third_party/icu/source/common/unicode/
Dstringtriebuilder.h282 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
283 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
296 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
297 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), in LinearMatchNode()
298 length(len), next(nextNode) {} in LinearMatchNode()
384 Node *nextNode) const = 0;
/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/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/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/chromium_org/ui/webui/resources/js/chromeos/
Dui_account_tweaks.js126 var node = walker.nextNode();
130 node = walker.nextNode();
/external/chromium_org/chrome/browser/resources/options/
Dsearch_page.js417 var node = walker.nextNode();
424 var nextNode = walker.nextNode();
440 node = nextNode;
442 node = walker.nextNode();

123456