/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | NodeIteratorImpl.java | 67 // (usually akin to whether the node was returned via nextNode()) 77 * nextNode() == fForward = true; 131 public Node nextNode() { method in class:NodeIteratorImpl 142 Node nextNode = fCurrentNode; 149 if (!fForward && nextNode!=null) { 150 //System.out.println("nextNode():!fForward:"+fCurrentNode.getNodeName()); 151 nextNode = fCurrentNode; 155 && nextNode != null 156 && nextNode.getNodeType() == Node.ENTITY_REFERENCE_NODE) { 157 nextNode 263 Node nextNode(Node node, boolean visitChildren) { method in class:NodeIteratorImpl [all...] |
/openjdk7/jaxp/src/org/w3c/dom/traversal/ |
H A D | NodeIterator.java | 106 * <code>nextNode()</code> returns the first node in the set. 113 public Node nextNode() method in interface:NodeIterator 132 * <code>detach</code> has been invoked, calls to <code>nextNode</code>
|
H A D | TreeWalker.java | 200 * current node has no next node, or if the search for nextNode attempts 206 public Node nextNode(); method in interface:TreeWalker
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ref/ |
H A D | DTMTreeWalker.java | 117 int nextNode = m_dtm.getFirstChild(pos); 118 while (DTM.NULL == nextNode) 125 nextNode = m_dtm.getNextSibling(pos); 127 if (DTM.NULL == nextNode) 138 nextNode = DTM.NULL; 145 pos = nextNode; 170 int nextNode = m_dtm.getFirstChild(pos); 171 while (DTM.NULL == nextNode) 178 nextNode = m_dtm.getNextSibling(pos); 180 if (DTM.NULL == nextNode) [all...] |
H A D | DTMNodeIterator.java | 160 public Node nextNode() throws DOMException method in class:DTMNodeIterator 165 int handle=dtm_iter.nextNode();
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/ |
H A D | TreeWalker.java | 150 Node nextNode = pos.getFirstChild(); 152 while (null == nextNode) 159 nextNode = pos.getNextSibling(); 161 if (null == nextNode) 170 nextNode = null; 177 pos = nextNode; 204 Node nextNode = pos.getFirstChild(); 206 while (null == nextNode) 213 nextNode = pos.getNextSibling(); 215 if (null == nextNode) [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/ |
H A D | TreeWalker.java | 182 Node nextNode = pos.getFirstChild(); 184 while (null == nextNode) 191 nextNode = pos.getNextSibling(); 193 if (null == nextNode) 202 nextNode = null; 209 pos = nextNode; 235 Node nextNode = pos.getFirstChild(); 237 while (null == nextNode) 244 nextNode = pos.getNextSibling(); 246 if (null == nextNode) [all...] |
H A D | Trie.java | 74 Node nextNode = node.m_nextChar[Character.toUpperCase(key.charAt(i))]; 76 if (nextNode != null) 78 node = nextNode;
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/dtm/ |
H A D | DTMIterator.java | 171 * the first call to <code>nextNode()</code> returns that root or (if it 177 public int nextNode(); method in interface:DTMIterator 191 * calls to <code>nextNode</code> or <code>previousNode</code> will 215 * the first nextNode() that is called will return the 245 * less than the next nextNode() call will retrieve. i.e. if you
|
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/ |
H A D | LocPathIterator.java | 45 * as each node is iterated via nextNode(), the node is also stored 243 int node = clone.nextNode(); 304 int next = iter.nextNode(); 398 * the next nextNode() call will retrieve. i.e. if 558 while (DTM.NULL != (next = clone.nextNode())) 571 * the first nextNode() that is called will return the 574 * @return true of nextNode has not been called. 675 * <code>nextNode</code> or<code>previousNode</code> will raise the 749 * to nextNode() returns the first node in the set. 753 public abstract int nextNode(); method in class:LocPathIterator 763 returnNextNode(int nextNode) argument [all...] |
H A D | AxesWalker.java | 349 * current node has no next node, or if the search for nextNode attempts 355 public int nextNode() method in class:AxesWalker 357 int nextNode = DTM.NULL; 365 nextNode = walker.getNextNode(); 367 if (DTM.NULL == nextNode) 374 if (walker.acceptNode(nextNode) != DTMIterator.FILTER_ACCEPT) 383 // return walker.returnNextNode(nextNode); 392 walker.setRoot(nextNode); 398 } // if(null != nextNode) 401 return nextNode; [all...] |
H A D | WalkingIterator.java | 167 * to nextNode() returns the first node in the set. 171 public int nextNode() method in class:WalkingIterator 186 return returnNextNode(m_firstWalker.nextNode()); 197 int n = returnNextNode(m_firstWalker.nextNode()); 257 * <code>nextNode</code> or<code>previousNode</code> will raise the
|
H A D | ReverseAxesWalker.java | 154 while (DTM.NULL != (next = clone.nextNode())) 217 while (DTM.NULL != (next = clone.nextNode()))
|
H A D | ChildIterator.java | 81 * to nextNode() returns the first node in the set. 86 public int nextNode() method in class:ChildIterator
|
H A D | SelfIteratorNoPredicate.java | 70 * to nextNode() returns the first node in the set. 75 public int nextNode() method in class:SelfIteratorNoPredicate
|
H A D | UnionPathIterator.java | 39 * As each node is iterated via nextNode(), the node is also stored 84 iter.nextNode(); 121 expr.nextNode(); 130 * <code>nextNode</code> or<code>previousNode</code> will raise the 380 * to nextNode() returns the first node in the set. 384 public int nextNode() method in class:UnionPathIterator 415 m_iterators[i].nextNode(); 432 m_iterators[iteratorUsed].nextNode();
|
H A D | FilterExprIteratorSimple.java | 105 // and so we may not be in the context of LocPathIterator#nextNode, 145 * to nextNode() returns the first node in the set. 150 public int nextNode() method in class:FilterExprIteratorSimple 159 m_lastFetched = next = m_exprObj.nextNode();
|
H A D | OneStepIterator.java | 107 * <code>nextNode</code> or<code>previousNode</code> will raise the 219 while (DTM.NULL != (next = clone.nextNode())) 278 while (DTM.NULL != (next = clone.nextNode()))
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentLinkedQueue.java | 674 private Node<E> nextNode; field in class:ConcurrentLinkedQueue.Itr 698 lastRet = nextNode; 702 if (nextNode == null) { 706 pred = nextNode; 707 p = succ(nextNode); 712 nextNode = null; 718 nextNode = p; 732 return nextNode != null; 736 if (nextNode == null) throw new NoSuchElementException();
|
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/patterns/ |
H A D | FunctionPattern.java | 115 while (DTM.NULL != (n = nl.nextNode())) 159 while (DTM.NULL != (n = nl.nextNode())) 202 while (DTM.NULL != (n = nl.nextNode()))
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Key.java | 183 final BranchHandle nextNode = il.append(new GOTO(null)); 204 nextNode.setTarget(il.append(methodGen.loadIterator())); 205 il.append(methodGen.nextNode()); 259 final BranchHandle nextNode = il.append(new GOTO(null)); 291 il.append(methodGen.nextNode()); 300 nextNode.setTarget(skip);
|
H A D | NameBase.java | 121 il.append(methodGen.nextNode()); 127 il.append(methodGen.nextNode());
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xs/traversers/ |
H A D | XSDAttributeGroupTraverser.java | 145 Element nextNode = traverseAttrsAndAttrGrps(child, attrGrp, schemaDoc, grammar, null); 146 if (nextNode!=null) { 148 Object[] args = new Object [] {nameAttr, "(annotation?, ((attribute | attributeGroup)*, anyAttribute?))", DOMUtil.getLocalName(nextNode)}; 149 reportSchemaError("s4s-elt-must-match.1", args, nextNode);
|
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/functions/ |
H A D | FuncSum.java | 55 while (DTM.NULL != (pos = nodes.nextNode()))
|
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/objects/ |
H A D | XNodeSet.java | 178 int node = nextNode(); 202 return (nextNode() != DTM.NULL); 319 // while (DTM.NULL != (node = nl.nextNode())) 501 while (DTM.NULL != (node1 = list1.nextNode())) 509 while (DTM.NULL != (node2 = list2.nextNode())) 572 while (DTM.NULL != (node = list1.nextNode())) 591 while (DTM.NULL != (node = list1.nextNode())) 617 while (DTM.NULL != (node = list1.nextNode()))
|