Package lupos.engine.operators

Examples of lupos.engine.operators.BasicOperator.addSucceedingOperator()

1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
      final Variable subject, final Variable object, final Node subjectNode, final Node objectNode) {
    final BasicOperator leftSide=node.jjtGetChild(0).accept(this, connection, graphConstraint, subject, object, subjectNode, objectNode);
    final BasicOperator rightSide = node.jjtGetChild(1).accept(this, connection, graphConstraint, subject, object, subjectNode, objectNode);
    final Union union = new Union();
    leftSide.addSucceedingOperator(new OperatorIDTuple(union,0));
    rightSide.addSucceedingOperator(new OperatorIDTuple(union,1));
    final Projection projection = new Projection();
    projection.addProjectionElement(subject);
    projection.addProjectionElement(object);
    if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
      projection.addProjectionElement((Variable)graphConstraint);
View Full Code Here
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
//      final LinkedList<TriplePattern> temp = new LinkedList<TriplePattern>();
//      temp.add(tp);
//      this.indexScanCreator.createIndexScanAndConnectWithRoot(new OperatorIDTuple(join, 0), temp, graphConstraint);
//    } else {
      final BasicOperator startingOperator2 = node.jjtGetChild(0).accept(this, connection, graphConstraint, subject, v, subjectNode, objectNode);
      startingOperator2.addSucceedingOperator(new OperatorIDTuple(join, 0));
//    }
    final BasicOperator startingOperator = node.jjtGetChild(1).accept(this, connection, graphConstraint, v, object, subjectNode, objectNode);
    startingOperator.addSucceedingOperator(new OperatorIDTuple(join,1));
    final Projection projection = new Projection();
    projection.addProjectionElement(subject);
View Full Code Here
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
//    } else {
      final BasicOperator startingOperator2 = node.jjtGetChild(0).accept(this, connection, graphConstraint, subject, v, subjectNode, objectNode);
      startingOperator2.addSucceedingOperator(new OperatorIDTuple(join, 0));
//    }
    final BasicOperator startingOperator = node.jjtGetChild(1).accept(this, connection, graphConstraint, v, object, subjectNode, objectNode);
    startingOperator.addSucceedingOperator(new OperatorIDTuple(join,1));
    final Projection projection = new Projection();
    projection.addProjectionElement(subject);
    projection.addProjectionElement(object);
    if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
      projection.addProjectionElement((Variable)graphConstraint);
View Full Code Here
196
197
198
199
200
201
202
203
204
205
206
            if (order.size() > 0) {
              final java.util.LinkedList<BasicOperator> pres = (java.util.LinkedList<BasicOperator>) this.c.getPrecedingOperators();
              BasicOperator pre;
              for (int i = 0; i < pres.size(); i++) {
                pre = pres.get(i);
                pre.addSucceedingOperator(new OperatorIDTuple(order.getFirst(),
                    0));
                if (filter != null) {
                  java.util.Collection<lupos.datastructures.items.Variable> vars = filter
                      .getIntersectionVariables();
                  if (vars == null)
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
            if (order.size() > 0) {
              final java.util.List<BasicOperator> pres = (java.util.List<BasicOperator>) this.g.getPrecedingOperators();
              BasicOperator pre;
              for (int i = 0; i < pres.size(); i++) {
                pre = pres.get(i);
                pre.addSucceedingOperator(new OperatorIDTuple(order.getFirst(),
                    0));
                if (filter != null) {
                  java.util.Collection<lupos.datastructures.items.Variable> vars = filter
                      .getIntersectionVariables();
                  if (vars == null)
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
    // deleted
    if (replaceLit.getSubstitutionsLiteralLeft().size() == 0) {
      BasicOperator pre;
      for (int i = 0; i < pres.size(); i++) {
        pre = pres.get(i);
        pre.addSucceedingOperator(new OperatorIDTuple(optional, index));
        pre.removeSucceedingOperator(replaceLit);
        optional.addPrecedingOperator(pre);
      }
      optional.removePrecedingOperator(replaceLit);
      deleted.add(replaceLit);
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    // Connect all precessors to all successors
    for (int i = 0; i < pres.size(); i++) {
      for (int a = 0; a < succs.size(); a++) {
        idTuple = succs.get(a);
        pre = pres.get(i);
        pre.addSucceedingOperator(new OperatorIDTuple(idTuple
            .getOperator(), idTuple.getId()));
        pre.removeSucceedingOperator(replaceVar);
      }
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
    final LinkedList<BasicOperator> pres = (LinkedList<BasicOperator>) proj1
        .getPrecedingOperators();
    BasicOperator pre;
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      pre.addSucceedingOperator(new OperatorIDTuple(proj_new, pre
          .getOperatorIDTuple(proj1).getId()));
      pre.removeSucceedingOperator(proj1);
    }

    proj_new.setPrecedingOperators(proj1.getPrecedingOperators());
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.