@Override public Expr copy(Expr e1, Expr e2) { return new E_NotEquals(e1 , e2 ) ; } }
@Override public Expr copy(Expr e1, Expr e2) { return new E_NotEquals(e1 , e2 ) ; } }
@Override public Expr make(ItemList list) { BuilderLib.checkLength(3, list, "!=: wanted 2 arguments: got :"+numArgs(list)) ; Expr left = buildExpr(list.get(1)) ; Expr right = buildExpr(list.get(2)) ; return new E_NotEquals(left, right) ; } };
public Expr make(ItemList list) { BuilderLib.checkLength(3, list, "!=: wanted 2 arguments: got :"+list.size()) ; Expr left = buildExpr(list.get(1)) ; Expr right = buildExpr(list.get(2)) ; return new E_NotEquals(left, right) ; } };
protected static E_NotEquals toNotEqualsFilter(Expr left, Expr right) { Node ln = toNode(left); com.hp.hpl.jena.sparql.expr.Expr le = ln.isVariable()? new ExprVar(ln.getName()) : new NodeValueNode(ln); Node rn = toNode(right); com.hp.hpl.jena.sparql.expr.Expr re = rn.isVariable()? new ExprVar(rn.getName()) : new NodeValueNode(rn); return new E_NotEquals(le, re); }
protected static E_NotEquals toIRINotEqualsFilter(Expr left, Expr right) { Node ln = toNode(left); com.hp.hpl.jena.sparql.expr.Expr le = ln.isVariable()? new ExprVar(ln.getName()) : new NodeValueNode(ln); Node rn = toNode(right); com.hp.hpl.jena.sparql.expr.Expr re = rn.isVariable()? new ExprVar(rn.getName()) : new NodeValueNode(rn); return new E_NotEquals(new E_Str(le), new E_Str(re)); }
ElementGroup fwdGroup = new ElementGroup(); fwdGroup.addElement(fwdElt); fwdGroup.addElementFilter(new ElementFilter(new E_NotEquals(getExpr(subject), getExpr(object)))); for (Node n: p.getFwdNodes()) { Expr exp = getExpr(n); E_NotEquals neq = new E_NotEquals(new ExprVar(fwdpred),exp); fwdGroup.addElementFilter(new ElementFilter(neq)); ElementGroup bwdGroup = new ElementGroup(); bwdGroup.addElement(bwdElt); bwdGroup.addElementFilter(new ElementFilter(new E_NotEquals(getExpr(subject), getExpr(object)))); for (Node n: p.getBwdNodes()) { Expr exp = getExpr(n); E_NotEquals neq = new E_NotEquals(new ExprVar(bwdpred),exp); bwdGroup.addElementFilter(new ElementFilter(neq)); if (alreadySeen.add(n)) { Expr exp = getExpr(n); E_NotEquals neq = new E_NotEquals(new ExprVar(eqpred),exp); eqGroup.addElementFilter(new ElementFilter(neq)); if (alreadySeen.add(n)) { Expr exp = getExpr(n); E_NotEquals neq = new E_NotEquals(new ExprVar(eqpred),exp); eqGroup.addElementFilter(new ElementFilter(neq)); for (Node n : p.getFwdNodes()) { Expr exp = getExpr(n); E_NotEquals neq = new E_NotEquals(new ExprVar(fwdpred),exp);
exprList2.add(new E_NotEquals(x, sub)) ;
exprList2.add(new E_NotEquals(x, sub)) ;
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
jj_consume_token(NE); expr2 = NumericExpression(); expr1 = new E_NotEquals(expr1, expr2) ; break; case LT:
e = new E_NotEquals( a, b );