Package com.hp.hpl.jena.sparql.algebra.op

Examples of com.hp.hpl.jena.sparql.algebra.op.OpGraph

275
276
277
278
279
280
281
282
283
284
285
                 *    R := Union(R, Join( eval(D(D[i]), P) , Ω(?var->i) )
                 */
                // Do before join classification and optimization.
                Op op = OpTable.create(new Table1(v, n)) ;
                op = OpJoin.create(op, x) ;
                op = new OpGraph(n, op) ;
                // Don't need an assign.  The table did that.
                // op = OpAssign.assign(op, v, NodeValue.makeNode(n)) ;
                union = OpUnion.create(union, op) ;
            }
            return union ;
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
        }
       
        if ( op instanceof OpGraph )
        {
            // ???
            OpGraph opg = (OpGraph)op ;
            return safeToTransform(exprs, opg.getSubOp()) ;
        }
       
        return false ;
    }
View Full Code Here
504
505
506
507
508
509
510
    protected Op compileElementGraph(ElementNamedGraph eltGraph)
    {
        Node graphNode = eltGraph.getGraphNameNode() ;
        Op sub = compileElement(eltGraph.getElement()) ;
        return new OpGraph(graphNode, sub) ;
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
    private Op union(OpBGP opBGP)
    {
        // By using the unbinding Var.ANON, the distinct works.
        // Else, we get duplicates from projection out of the graph var.
        Var v = Var.ANON ; //varAlloc.allocVar() ;
        Op op = new OpGraph(v, opBGP) ;
        op = OpDistinct.create(op) ;
        return op ;
    }
View Full Code Here
275
276
277
278
279
280
281
282
283
284
285
                 *    R := Union(R, Join( eval(D(D[i]), P) , Ω(?var->i) )
                 */
                // Do before join classification and optimization.
                Op op = OpTable.create(new Table1(v, n)) ;
                op = OpJoin.create(op, x) ;
                op = new OpGraph(n, op) ;
                // Don't need an assign.  The table did that.
                // op = OpAssign.assign(op, v, NodeValue.makeNode(n)) ;
                union = OpUnion.create(union, op) ;
            }
            return union ;
View Full Code Here
361
362
363
364
365
366
367
  public void visit( final OpGraph opGraph )
  {
    final OpRewriter rewriter = new OpRewriter(securityEvaluator,
        SecuredItemImpl.convert(opGraph.getNode()));
    opGraph.getSubOp().visit(rewriter);
    addOp(new OpGraph(opGraph.getNode(), rewriter.getResult()));
  }
View Full Code Here
79
80
81
82
83
84
85
86
87
    private Op union(OpBGP opBGP)
    {
        // By using the unbinding Var.ANON, the distinct works.
        // Else, we get duplicates from projection out of the graph var.
        Var v = Var.ANON ; //varAlloc.allocVar() ;
        Op op = new OpGraph(v, opBGP) ;
        op = OpDistinct.create(op) ;
        return op ;
    }
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
                 *    R := Union(R, Join( eval(D(D[i]), P) , Ω(?var->i) )
                 */
                // Do before join classification and optimization.
                Op op = OpTable.create(new Table1(v, n)) ;
                op = OpJoin.create(op, x) ;
                op = new OpGraph(n, op) ;
                // Don't need an assign.  The table did that.
                // op = OpAssign.assign(op, v, NodeValue.makeNode(n)) ;
                union = OpUnion.create(union, op) ;
            }
            return union ;
View Full Code Here
38
39
40
41
42
43
44
45
    // Does not affect variables.
    @Override
    public Op transform(OpGraph opGraph, Op x)
    {
        if ( opGraph.getNode().equals(oldGraphName) )
            opGraph = new OpGraph(newGraphName, x) ;
        return super.transform(opGraph, x) ;
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
    private Op union(OpBGP opBGP)
    {
        // By using the unbinding Var.ANON, the distinct works.
        // Else, we get duplicates from projection out of the graph var.
        Var v = Var.ANON ; //varAlloc.allocVar() ;
        Op op = new OpGraph(v, opBGP) ;
        op = OpDistinct.create(op) ;
        return op ;
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.sparql.algebra.op.OpGraph

  • com.hp.hpl.jena.sparql.algebra.AlgebraGenerator
  • com.hp.hpl.jena.sparql.algebra.optimize.TransformFilterEquality
  • com.hp.hpl.jena.sparql.algebra.TransformUnionQuery
  • com.hp.hpl.jena.sparql.graph.NodeTransformOp
  • com.hp.hpl.jena.tdb.migrate.TransformDynamicDataset_Imperfect
  • com.hp.hpl.jena.tdb.migrate.TransformGraphRename
  • org.apache.jena.security.query.rewriter.OpRewriter
    • 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.