/** * Utility function: node-set/string comparison. */ public static boolean compare(DTMAxisIterator left, final String rstring, int op, DOM dom) { int node; //left.reset(); while ((node = left.next()) != DTMAxisIterator.END) { if (compareStrings(dom.getStringValueX(node), rstring, op, dom)) { return true; } } return false; }
/** * Utility function: node-set/node-set compare. */ public static boolean compare(DTMAxisIterator left, DTMAxisIterator right, int op, DOM dom) { int lnode; left.reset(); while ((lnode = left.next()) != DTMAxisIterator.END) { final String lvalue = dom.getStringValueX(lnode); int rnode; right.reset(); while ((rnode = right.next()) != DTMAxisIterator.END) { // String value must be the same if both nodes are the same if (lnode == rnode) { if (op == Operators.EQ) { return true; } else if (op == Operators.NE) { continue; } } if (compareStrings(lvalue, dom.getStringValueX(rnode), op, dom)) { return true; } } } return false; }
/** * Utility function: node-set/string comparison. */ public static boolean compare(DTMAxisIterator left, final String rstring, int op, DOM dom) { int node; //left.reset(); while ((node = left.next()) != DTMAxisIterator.END) { if (compareStrings(dom.getStringValueX(node), rstring, op, dom)) { return true; } } return false; }
/** * Utility function: node-set/string comparison. */ public static boolean compare(DTMAxisIterator left, final String rstring, int op, DOM dom) { int node; //left.reset(); while ((node = left.next()) != DTMAxisIterator.END) { if (compareStrings(dom.getStringValueX(node), rstring, op, dom)) { return true; } } return false; }
/** * Utility function: node-set/string comparison. */ public static boolean compare(DTMAxisIterator left, final String rstring, int op, DOM dom) { int node; //left.reset(); while ((node = left.next()) != DTMAxisIterator.END) { if (compareStrings(dom.getStringValueX(node), rstring, op, dom)) { return true; } } return false; }
/** * Utility function: node-set/node-set compare. */ public static boolean compare(DTMAxisIterator left, DTMAxisIterator right, int op, DOM dom) { int lnode; left.reset(); while ((lnode = left.next()) != DTMAxisIterator.END) { final String lvalue = dom.getStringValueX(lnode); int rnode; right.reset(); while ((rnode = right.next()) != DTMAxisIterator.END) { // String value must be the same if both nodes are the same if (lnode == rnode) { if (op == Operators.EQ) { return true; } else if (op == Operators.NE) { continue; } } if (compareStrings(lvalue, dom.getStringValueX(rnode), op, dom)) { return true; } } } return false; }
/** * Utility function: node-set/node-set compare. */ public static boolean compare(DTMAxisIterator left, DTMAxisIterator right, int op, DOM dom) { int lnode; left.reset(); while ((lnode = left.next()) != DTMAxisIterator.END) { final String lvalue = dom.getStringValueX(lnode); int rnode; right.reset(); while ((rnode = right.next()) != DTMAxisIterator.END) { // String value must be the same if both nodes are the same if (lnode == rnode) { if (op == Operators.EQ) { return true; } else if (op == Operators.NE) { continue; } } if (compareStrings(lvalue, dom.getStringValueX(rnode), op, dom)) { return true; } } } return false; }
/** * Utility function: node-set/node-set compare. */ public static boolean compare(DTMAxisIterator left, DTMAxisIterator right, int op, DOM dom) { int lnode; left.reset(); while ((lnode = left.next()) != DTMAxisIterator.END) { final String lvalue = dom.getStringValueX(lnode); int rnode; right.reset(); while ((rnode = right.next()) != DTMAxisIterator.END) { // String value must be the same if both nodes are the same if (lnode == rnode) { if (op == Operators.EQ) { return true; } else if (op == Operators.NE) { continue; } } if (compareStrings(lvalue, dom.getStringValueX(rnode), op, dom)) { return true; } } } return false; }