Searched defs:node2 (Results 1 - 8 of 8) sorted by relevance
| /openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/ |
| H A D | DOM2Helper.java | 214 * Figure out whether node2 should be considered as being later 225 * @param node2 DOM Node to perform position comparison on . 227 * @return false if node2 comes before node1, otherwise return true. 229 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>. 231 public static boolean isNodeAfter(Node node1, Node node2) argument 236 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) 239 int index2 = ((DOMOrder) node2).getUid(); 248 return DOMHelper.isNodeAfter(node1, node2);
|
| H A D | DOMHelper.java | 182 * Figure out whether node2 should be considered as being later 193 * @param node2 DOM Node to perform position comparison on . 195 * @return false if node2 comes before node1, otherwise return true. 197 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>. 199 public static boolean isNodeAfter(Node node1, Node node2) argument 201 if (node1 == node2 || isNodeTheSame(node1, node2)) 208 Node parent2 = getParentOfNode(node2); 214 isNodeAfter = isNodeAfterSibling(parent1, node1, node2); 258 Node startNode1 = node1, startNode2 = node2; 334 isNodeTheSame(Node node1, Node node2) argument [all...] |
| /openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/ |
| H A D | DOM.java | 82 public boolean lessThan(final int node1, final int node2); argument
|
| /openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
| H A D | DOMAdapter.java | 325 public boolean lessThan(final int node1, final int node2) argument 327 return _dom.lessThan(node1, node2);
|
| H A D | MultiDOM.java | 521 public boolean lessThan(final int node1, final int node2) { argument 525 if (node2 == DTM.NULL) { 529 final int dom2 = getDTMId(node2); 530 return dom1 == dom2 ? _adapters[dom1].lessThan(node1, node2)
|
| H A D | AdaptiveResultTreeImpl.java | 350 public boolean lessThan(final int node1, final int node2) argument 353 return _dom.lessThan(node1, node2); 356 return super.lessThan(node1, node2);
|
| H A D | SAXImpl.java | 240 * Returns true if node1 comes before node2 in document order 242 public boolean lessThan(int node1, int node2) { argument 247 if (node2 == DTM.NULL) { 251 return (node1 < node2);
|
| H A D | SimpleResultTreeImpl.java | 462 public boolean lessThan(final int node1, final int node2) argument 467 else if (node2 == DTM.NULL) { 471 return (node1 < node2);
|
Completed in 70 milliseconds