Package org.openrdf.query.algebra

Examples of org.openrdf.query.algebra.LeftJoin


      }

      TupleExpr expandedPattern = null;

      if (joinOfAttributePatterns.getNumberOfArguments() == 1) {
        expandedPattern = new LeftJoin(statementPattern, joinOfAttributePatterns.getArg(0));
      }
      else {
        expandedPattern = new LeftJoin(statementPattern, joinOfAttributePatterns);
      }

      // build an Or-ed set of filter conditions on the status and team.
      Or filterConditions = new Or();
View Full Code Here


    else {
      result = new Join(requiredTEs);
    }

    for (TupleExpr optTE : optionalTEs) {
      result = new LeftJoin(result, optTE);
    }

    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);
    }
View Full Code Here

      result = new Join(requiredTEs);
    }

    for (OptionalTupleExpr optTE : optionalTEs) {
      if (optTE.hasConstraint()) {
        result = new LeftJoin(result, optTE.getTupleExpr(), optTE.getConstraint());
      }
      else {
        result = new LeftJoin(result, optTE.getTupleExpr());
      }
    }

    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);
View Full Code Here

    List<ValueExpr> constraints = graphPattern.removeAllConstraints();

    TupleExpr leftArg = parentGP.buildTupleExpr();
    TupleExpr rightArg = graphPattern.buildTupleExpr();

    LeftJoin leftJoin;

    if (constraints.isEmpty()) {
      leftJoin = new LeftJoin(leftArg, rightArg);
    }
    else {
      ValueExpr constraint = new And(constraints);

      leftJoin = new LeftJoin(leftArg, rightArg, constraint);
    }

    graphPattern = parentGP;

    graphPattern.clear();
View Full Code Here

      }
    }

    for (OptionalTupleExpr optTE : optionalTEs) {
      if (optTE.hasConstraint()) {
        result = new LeftJoin(result, optTE.getTupleExpr(), optTE.getConstraint());
      }
      else {
        result = new LeftJoin(result, optTE.getTupleExpr());
      }
    }

    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);
View Full Code Here

        result = new Join(result, requiredTEs.get(i));
      }
    }

    for (TupleExpr optTE : optionalTEs) {
      result = new LeftJoin(result, optTE);
    }

    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);
    }
View Full Code Here

    List<ValueExpr> constraints = graphPattern.removeAllConstraints();

    TupleExpr leftArg = parentGP.buildTupleExpr();
    TupleExpr rightArg = graphPattern.buildTupleExpr();

    LeftJoin leftJoin;

    if (constraints.isEmpty()) {
      leftJoin = new LeftJoin(leftArg, rightArg);
    }
    else {
      ValueExpr constraint = constraints.get(0);
      for (int i = 1; i < constraints.size(); i++) {
        constraint = new And(constraint, constraints.get(i));
      }

      leftJoin = new LeftJoin(leftArg, rightArg, constraint);
    }

    graphPattern = parentGP;

    graphPattern.clear();
View Full Code Here

TOP

Related Classes of org.openrdf.query.algebra.LeftJoin

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.