@Override public Expr copy(Expr e1, Expr e2) { return new E_LessThanOrEqual(e1 , e2) ; } }
/** * implements less than or equal as per SPARQL 1.1 spec * * https://www.w3.org/TR/2013/REC-sparql11-query-20130321/#OperatorMapping * * Converts expr to an Expr object via expr() * * @see #asExpr(Object) * @see org.apache.jena.sparql.expr.E_LessThanOrEqual * * @param expr1 * the first expression. * @param expr2 * the second expression. * @return E_LessThanOrEqual instance */ public final E_LessThanOrEqual le(Object expr1, Object expr2) { return new E_LessThanOrEqual(asExpr(expr1), asExpr(expr2)); }
/** * implements less than or equal as per SPARQL 1.1 spec * * https://www.w3.org/TR/2013/REC-sparql11-query-20130321/#OperatorMapping * * Converts expr to an Expr object via expr() * * @see #asExpr(Object) * @see org.apache.jena.sparql.expr.E_LessThanOrEqual * * @param expr1 * the first expression. * @param expr2 * the second expression. * @return E_LessThanOrEqual instance */ public final E_LessThanOrEqual le(Object expr1, Object expr2) { return new E_LessThanOrEqual(asExpr(expr1), asExpr(expr2)); }
@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_LessThanOrEqual(left, right) ; } };
public static Expr createExpr(Node node, Range<? extends NodeHolder> range) { Expr n = ExprUtils.makeNode(node); List<Expr> parts = new ArrayList<>(); if(RangeUtils.isSingleton(range)) { parts.add(new E_Equals(n, ExprUtils.makeNode(range.lowerEndpoint().getNode()))); } else { if(range.hasLowerBound()) { if(range.lowerBoundType().equals(BoundType.OPEN)) { parts.add(new E_GreaterThan(n, ExprUtils.makeNode(range.lowerEndpoint().getNode()))); } else { parts.add(new E_GreaterThanOrEqual(n, ExprUtils.makeNode(range.lowerEndpoint().getNode()))); } } if(range.hasUpperBound()) { if(range.upperBoundType().equals(BoundType.OPEN)) { parts.add(new E_LessThan(n, ExprUtils.makeNode(range.upperEndpoint().getNode()))); } else { parts.add(new E_LessThanOrEqual(n, ExprUtils.makeNode(range.upperEndpoint().getNode()))); } } } Expr result = ExprUtils.andifyBalanced(parts); return result; }
Expr filterExpr = new E_LessThanOrEqual( new E_NumAbs( new E_Subtract(
Expr filterExpr = new E_LessThanOrEqual( new E_NumAbs( new E_Subtract(
jj_consume_token(LE); expr2 = NumericExpression(); expr1 = new E_LessThanOrEqual(expr1, expr2) ; break; case GE:
jj_consume_token(LE); expr2 = NumericExpression(); expr1 = new E_LessThanOrEqual(expr1, expr2) ; break; case GE:
jj_consume_token(LE); expr2 = NumericExpression(); expr1 = new E_LessThanOrEqual(expr1, expr2) ; break; case GE:
e = new E_LessThanOrEqual( a, b );
e = new E_LessThanOrEqual( a, b );
value = new E_LessThanOrEqual (a, b);
value = new E_LessThanOrEqual (a, b);