/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
ShadowUriMatcher.java | 83 MatchNode nextNode = null; 87 nextNode = baseNode.number; 88 if (nextNode == null) { 89 nextNode = new MatchNode(rootNode.code); 90 baseNode.number = nextNode; 94 nextNode = baseNode.text; 95 if (nextNode == null) { 96 nextNode = new MatchNode(rootNode.code); 97 baseNode.text = nextNode; 101 nextNode = baseNode.map.get(segment) [all...] |
/libcore/luni/src/main/java/org/w3c/dom/traversal/ |
NodeIterator.java | 79 * <code>nextNode()</code> returns the first node in the set. 86 public Node nextNode() 105 * <code>detach</code> has been invoked, calls to <code>nextNode</code>
|
/packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/ |
Builder.java | 69 Node n = it.nextNode(); 78 Node n2 = it.nextNode(); 101 Node n = it.nextNode(); 112 Node n = it.nextNode(); 129 Node n = it.nextNode(); 138 n = it.nextNode(); 151 Node n = it.nextNode(); 154 n = it.nextNode(); 171 Node n = it.nextNode(); 185 String localPart = buildString((ASTlocal_part)it.nextNode(), true) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
NodeIterator.idl | 33 [RaisesException] Node nextNode();
|
TreeWalker.idl | 38 [RaisesException] Node nextNode();
|
NodeRenderingTraversal.cpp | 176 Node* nextNode = nextSibling(node); 178 if (parentNode && parentNode->isElementNode() && !nextNode) { 186 return nextNode; 211 if (Node* nextNode = pseudoAwareNextSibling(node)) 212 return nextNode; 216 if (Node* nextNode = pseudoAwareNextSibling(parentNode)) 217 return nextNode;
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
DTMTreeWalker.java | 115 int nextNode = m_dtm.getFirstChild(pos); 116 while (DTM.NULL == nextNode) 123 nextNode = m_dtm.getNextSibling(pos); 125 if (DTM.NULL == nextNode) 136 nextNode = DTM.NULL; 143 pos = nextNode; 168 int nextNode = m_dtm.getFirstChild(pos); 169 while (DTM.NULL == nextNode) 176 nextNode = m_dtm.getNextSibling(pos); 178 if (DTM.NULL == nextNode) [all...] |
DTMNodeIterator.java | 158 public Node nextNode() throws DOMException 163 int handle=dtm_iter.nextNode();
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
TreeWalker.java | 147 Node nextNode = pos.getFirstChild(); 149 while (null == nextNode) 156 nextNode = pos.getNextSibling(); 158 if (null == nextNode) 167 nextNode = null; 174 pos = nextNode; 201 Node nextNode = pos.getFirstChild(); 203 while (null == nextNode) 210 nextNode = pos.getNextSibling(); 212 if (null == nextNode) [all...] |
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
TreeWalker.java | 179 Node nextNode = pos.getFirstChild(); 181 while (null == nextNode) 188 nextNode = pos.getNextSibling(); 190 if (null == nextNode) 199 nextNode = null; 206 pos = nextNode; 232 Node nextNode = pos.getFirstChild(); 234 while (null == nextNode) 241 nextNode = pos.getNextSibling(); 243 if (null == nextNode) [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
RewriteRuleSubtreeStream.as | 49 public function nextNode():Object {
|
RewriteRuleTokenStream.as | 39 public function nextNode():Object {
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
RewriteRuleNodeStream.java | 57 public Object nextNode() {
|
RewriteRuleSubtreeStream.java | 67 public Object nextNode() { 68 //System.out.println("nextNode: elements="+elements+", singleElement="+((Tree)singleElement).toStringTree());
|
RewriteRuleTokenStream.java | 57 public Object nextNode() {
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
RewriteRuleNodeStream.js | 11 nextNode: function() {
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ |
DTMIterator.java | 169 * the first call to <code>nextNode()</code> returns that root or (if it 175 public int nextNode(); 189 * calls to <code>nextNode</code> or <code>previousNode</code> will 213 * the first nextNode() that is called will return the 243 * less than the next nextNode() call will retrieve. i.e. if you
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
LocPathIterator.java | 43 * as each node is iterated via nextNode(), the node is also stored 241 int node = clone.nextNode(); 302 int next = iter.nextNode(); 396 * the next nextNode() call will retrieve. i.e. if 556 while (DTM.NULL != (next = clone.nextNode())) 569 * the first nextNode() that is called will return the 572 * @return true of nextNode has not been called. 673 * <code>nextNode</code> or<code>previousNode</code> will raise the 747 * to nextNode() returns the first node in the set. 751 public abstract int nextNode(); [all...] |
AxesWalker.java | 347 * current node has no next node, or if the search for nextNode attempts 353 public int nextNode() 355 int nextNode = DTM.NULL; 363 nextNode = walker.getNextNode(); 365 if (DTM.NULL == nextNode) 372 if (walker.acceptNode(nextNode) != DTMIterator.FILTER_ACCEPT) 381 // return walker.returnNextNode(nextNode); 390 walker.setRoot(nextNode); 396 } // if(null != nextNode) 399 return nextNode; [all...] |
/external/lzma/CPP/7zip/UI/Common/ |
EnumDirItems.cpp | 239 const NWildcard::CCensorNode *nextNode = 0;
246 nextNode = &curNode.SubNodes[index];
250 nextNode = &curNode;
254 RINOK(EnumerateDirItems_Spec(*nextNode, phyParent, logParent, fi.Name, phyPrefix,
262 const NWildcard::CCensorNode &nextNode = curNode.SubNodes[i];
263 const UString fullPath = phyPrefix + nextNode.Name;
267 if (!nextNode.AreThereIncludeItems())
280 RINOK(EnumerateDirItems_Spec(nextNode, phyParent, logParent, fi.Name, phyPrefix,
322 const NWildcard::CCensorNode *nextNode = 0;
327 nextNode = &curNode.SubNodes[index]; [all...] |
/external/chromium_org/third_party/icu/source/common/unicode/ |
stringtriebuilder.h | 282 IntermediateValueNode(int32_t v, Node *nextNode) 283 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } 296 LinearMatchNode(int32_t len, Node *nextNode) 297 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), 298 length(len), next(nextNode) {} 384 Node *nextNode) const = 0;
|
/external/icu/icu4c/source/common/unicode/ |
stringtriebuilder.h | 284 IntermediateValueNode(int32_t v, Node *nextNode) 285 : ValueNode(0x222222*37+hashCode(nextNode)), next(nextNode) { setValue(v); } 298 LinearMatchNode(int32_t len, Node *nextNode) 299 : ValueNode((0x333333*37+len)*37+hashCode(nextNode)), 300 length(len), next(nextNode) {} 386 Node *nextNode) const = 0;
|
/external/apache-xml/src/main/java/org/apache/xpath/patterns/ |
FunctionPattern.java | 113 while (DTM.NULL != (n = nl.nextNode())) 157 while (DTM.NULL != (n = nl.nextNode())) 200 while (DTM.NULL != (n = nl.nextNode()))
|
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3rewritestreams.c | 52 static pANTLR3_BASE_TREE nextNode (pANTLR3_REWRITE_RULE_ELEMENT_STREAM stream); 229 stream->nextNode = nextNode; 325 stream->nextNode = nextNodeToken; 327 // No nextNode implementation for a token rewrite stream 344 stream->nextNode = nextNodeToken; 346 // No nextNode implementation for a token rewrite stream 363 stream->nextNode = nextNodeToken; 365 // No nextNode implementation for a token rewrite stream 389 stream->nextNode = nextNode [all...] |
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
KeyTable.java | 197 while (DTM.NULL != (currentNode = m_keyNodes.nextNode())) 216 while (DTM.NULL != (currentNodeInUseClause = i.nextNode())) { 245 nodes.nextNode(); 252 // in each nodeset. We use nodes.nextNode after each entry so we can 256 nodes.nextNode();
|