| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowUriMatcher.java | 83 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/ |
| D | DTMTreeWalker.java | 115 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 …]
|
| /external/webkit/LayoutTests/fast/dom/TreeWalker/ |
| D | previousSiblingLastChildSkip-expected.txt | 7 PASS walker.nextNode(); walker.currentNode.id is 'C1'
8 PASS walker.nextNode(); walker.currentNode.id is 'C2'
9 PASS walker.nextNode(); walker.currentNode.id is 'D1'
10 PASS walker.nextNode(); walker.currentNode.id is 'D2'
11 PASS walker.nextNode(); walker.currentNode.id is 'B2'
|
| D | acceptNode-filter-expected.txt | 11 PASS walker.nextNode(); walker.currentNode.id is 'B2'
18 PASS walker.nextNode(); walker.currentNode.id is 'B2'
22 PASS walker.nextNode(); walker.currentNode.id is 'B1'
26 PASS walker.nextNode(); walker.currentNode.id is 'B1'
31 PASS walker.nextNode(); threw exception TypeError: NodeFilter object does not have an acceptNode fu…
37 PASS walker.nextNode(); threw exception TypeError: NodeFilter object does not have an acceptNode fu…
42 PASS walker.nextNode(); walker.currentNode.id is 'B1'
|
| D | traversal-skip-expected.txt | 7 Testing nextNode
8 PASS walker.nextNode(); walker.currentNode.id is 'A1'
9 PASS walker.nextNode(); walker.currentNode.id is 'C1'
10 PASS walker.nextNode(); walker.currentNode.id is 'B2'
11 PASS walker.nextNode(); walker.currentNode.id is 'B3'
|
| D | traversal-reject-expected.txt | 7 Testing nextNode
8 PASS walker.nextNode(); walker.currentNode.id is 'A1'
9 PASS walker.nextNode(); walker.currentNode.id is 'B2'
10 PASS walker.nextNode(); walker.currentNode.id is 'B3'
|
| D | previousNodeLastChildReject-expected.txt | 7 PASS walker.nextNode(); walker.currentNode.id is 'B1'
8 PASS walker.nextNode(); walker.currentNode.id is 'C1'
9 PASS walker.nextNode(); walker.currentNode.id is 'B2'
|
| D | filter-throw-expected.txt | 10 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
16 PASS walker.nextNode();walker.currentNode.id threw exception filter exception.
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | TreeWalker.java | 179 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/xml/serializer/ |
| D | TreeWalker.java | 147 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/xpath/axes/ |
| D | LocPathIterator.java | 241 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 …]
|
| D | AxesWalker.java | 353 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()
|
| D | UnionPathIterator.java | 82 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()
|
| D | WalkingIterator.java | 169 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()
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/TestRewriteRuleTokenStream/ |
| D | TestRewriteRuleTokenStream.m | 104 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/icu4c/tools/ctestfw/ |
| D | ctest.c | 220 TestNode *nextNode, *curNode; in addTestNode() local
232 nextNode = curNode->child; in addTestNode()
240 if( nextNode == NULL ) in addTestNode()
260 while (strncmp_nullcheck ( name, nextNode->name, nameLen) != 0 ) in addTestNode()
262 curNode = nextNode; in addTestNode()
263 nextNode = nextNode -> sibling; in addTestNode()
265 if ( nextNode == NULL ) in addTestNode()
268 nextNode = createTestNode(name, nameLen); in addTestNode()
269 curNode->sibling = nextNode; in addTestNode()
278 return nextNode; in addTestNode()
[all …]
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3rewritestreams.c | 52 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 …]
|
| D | antlr3collections.c | 1824 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/webkit/Source/JavaScriptCore/profiler/ |
| D | Profile.cpp | 55 for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild()) in forEach() local
56 currentNode = nextNode; in forEach()
|
| /external/webkit/Source/WebCore/dom/ |
| D | NodeIterator.h | 45 PassRefPtr<Node> nextNode(ScriptState*, ExceptionCode&);
57 …PassRefPtr<Node> nextNode(ExceptionCode& ec) { return nextNode(scriptStateFromNode(mainThreadNorma… in nextNode() function
|
| D | TreeWalker.h | 53 Node* nextNode(ScriptState*);
63 …Node* nextNode() { return nextNode(scriptStateFromNode(mainThreadNormalWorld(), m_current.get()));… in nextNode() function
|
| /external/icu4c/common/unicode/ |
| D | stringtriebuilder.h | 285 IntermediateValueNode(int32_t v, Node *nextNode) in IntermediateValueNode() argument
286 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } in IntermediateValueNode()
299 LinearMatchNode(int32_t len, Node *nextNode) in LinearMatchNode() argument
300 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), in LinearMatchNode()
301 length(len), next(nextNode) {} in LinearMatchNode()
387 Node *nextNode) const = 0;
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | KeyTable.java | 197 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/ |
| D | XNodeSet.java | 176 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/ |
| D | FunctionPattern.java | 113 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()
|