/** * evalXPathToBoolean() evaluates the xpath expression to a boolean * @return boolean * */ public boolean evalXPathToBoolean(){ return xpe.evalBoolean(vn); } /**
/** * evalXPathToBoolean() evaluates the xpath expression to a boolean * @return boolean * */ public boolean evalXPathToBoolean(){ return xpe.evalBoolean(vn); } /**
public boolean evalBoolean(VTDNavHuge vn) { // TODO Auto-generated method stub return exprVal.evalBoolean(vn); }
/** * evalXPathToBoolean() evaluates the xpath expression to a boolean * @return boolean * */ public boolean evalXPathToBoolean(){ return xpe.evalBoolean(vn); } /**
public boolean evalBoolean(VTDNavHuge vn) { // TODO Auto-generated method stub return exprVal.evalBoolean(vn); }
public boolean evalBoolean(VTDNavHuge vn){ return operand.evalBoolean(vn); }
public boolean evalBoolean(VTDNavHuge vn) { // TODO Auto-generated method stub return exprVal.evalBoolean(vn); }
public boolean evalBoolean(VTDNavHuge vn){ return operand.evalBoolean(vn); }
public boolean evalBoolean(VTDNavHuge vn){ return operand.evalBoolean(vn); }
public boolean evalBoolean(VTDNavHuge vn){ /*int i,i1=0, s1, s2; int stackSize; Expr e1, e2; int t; boolean b = false;*/ switch(op){ case OR: return left.evalBoolean(vn) || right.evalBoolean(vn); case AND:return left.evalBoolean(vn) && right.evalBoolean(vn); case EQ: case NE: case LE: case GE: case LT: case GT: return computeComp(op,vn); default: double dval = evalNumber(vn); if (dval ==-0.0 || dval ==+0.0 || Double.isNaN(dval)) return false; return true; } }
public boolean evalBoolean(VTDNavHuge vn){ /*int i,i1=0, s1, s2; int stackSize; Expr e1, e2; int t; boolean b = false;*/ switch(op){ case OR: return left.evalBoolean(vn) || right.evalBoolean(vn); case AND:return left.evalBoolean(vn) && right.evalBoolean(vn); case EQ: case NE: case LE: case GE: case LT: case GT: return computeComp(op,vn); default: double dval = evalNumber(vn); if (dval ==-0.0 || dval ==+0.0 || Double.isNaN(dval)) return false; return true; } }
public boolean evalBoolean(VTDNavHuge vn){ /*int i,i1=0, s1, s2; int stackSize; Expr e1, e2; int t; boolean b = false;*/ switch(op){ case OR: return left.evalBoolean(vn) || right.evalBoolean(vn); case AND:return left.evalBoolean(vn) && right.evalBoolean(vn); case EQ: case NE: case LE: case GE: case LT: case GT: return computeComp(op,vn); default: double dval = evalNumber(vn); if (dval ==-0.0 || dval ==+0.0 || Double.isNaN(dval)) return false; return true; } }
public boolean eval(VTDNavHuge vn) { boolean b; count++; // increment the position expr.setPosition(count); if (expr.isNumerical()){ b = (expr.evalNumber(vn)== count); } else{ b = expr.evalBoolean(vn); } return b; }
public boolean eval(VTDNavHuge vn) { boolean b; count++; // increment the position expr.setPosition(count); if (expr.isNumerical()){ b = (expr.evalNumber(vn)== count); } else{ b = expr.evalBoolean(vn); } return b; }
public boolean eval(VTDNavHuge vn) { boolean b; count++; // increment the position expr.setPosition(count); if (expr.isNumerical()){ b = (expr.evalNumber(vn)== count); } else{ b = expr.evalBoolean(vn); } return b; }
public boolean evalBoolean(VTDNavHuge vn) { if (e.isNodeSet()==false) return e.evalBoolean(vn); else { boolean a = false; vn.push2(); // record teh stack size int size = vn.contextStack2.size; try { a = (evalNodeSet(vn) != -1); } catch (Exception e) { } //rewind stack vn.contextStack2.size = size; reset(vn); vn.pop2(); return a; } }
public boolean evalBoolean(VTDNavHuge vn) { if (e.isNodeSet()==false) return e.evalBoolean(vn); else { boolean a = false; vn.push2(); // record teh stack size int size = vn.contextStack2.size; try { a = (evalNodeSet(vn) != -1); } catch (Exception e) { } //rewind stack vn.contextStack2.size = size; reset(vn); vn.pop2(); return a; } }
public boolean evalBoolean(VTDNavHuge vn) { if (e.isNodeSet()==false) return e.evalBoolean(vn); else { boolean a = false; vn.push2(); // record teh stack size int size = vn.contextStack2.size; try { a = (evalNodeSet(vn) != -1); } catch (Exception e) { } //rewind stack vn.contextStack2.size = size; reset(vn); vn.pop2(); return a; } }
if (left.isBoolean() || right.isBoolean()) { if (op == EQ) return left.evalBoolean(vn) == right.evalBoolean(vn); else return left.evalBoolean(vn) != right.evalBoolean(vn);
if (left.isBoolean() || right.isBoolean()) { if (op == EQ) return left.evalBoolean(vn) == right.evalBoolean(vn); else return left.evalBoolean(vn) != right.evalBoolean(vn);