Package com.hp.hpl.jena.sparql.path

Examples of com.hp.hpl.jena.sparql.path.Path

72
73
74
75
76
77
78
79
80
81
82
83
        output.addAll(nodes) ;
    }

    @Override
    protected void doSeq(Path pathStepLeft, Path pathStepRight, Node node, Collection<Node> output) {
        Path part1 = forwardMode ? pathStepLeft : pathStepRight ;
        Path part2 = forwardMode ? pathStepRight : pathStepLeft ;

        Collection<Node> nodes = collector() ;
        eval(part1, node, nodes) ;
        Collection<Node> nodes2 = new HashSet<Node>() ;
        for (Node n : nodes)
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
        this.forwardMode = forward ;
    }

    @Override
    protected void doSeq(Path pathStepLeft, Path pathStepRight, Node node, Collection<Node> output) {
        Path part1 = forwardMode ? pathStepLeft : pathStepRight ;
        Path part2 = forwardMode ? pathStepRight : pathStepLeft ;

        // Feed one side into the other
        Iter<Node> iter = eval(part1, node) ;
        for (Node n : iter)
            eval(part2, n, output) ;
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
        // The next step
        long min2 = dec(min1) ;
        long max2 = dec(max1) ;

        // TODO Rewrite
        Path p1 = pathStep ;
        Path p2 = new P_Mod(pathStep, min2, max2) ;

        if ( !forwardMode ) {
            // Reverse order. Do the second bit first.
            Path tmp = p1 ;
            p1 = p2 ;
            p2 = tmp ;
            // This forces execution to be in the order that it's written, when
            // working backwards.
            // {N,*} is {*} then {N} backwards != do {N} then do {*} as
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
       
        if ( s1 == s && o1 == o )
            // No change.
            return super.transform(opPath) ;
       
        Path path = tp.getPath() ;
        TriplePath tp2 ;

        if ( path != null )
            tp2 = new TriplePath(s1, path, o1) ;
        else
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
        fill(iter, output) ;
    }

    @Override
    protected void doSeq(Path pathStepLeft, Path pathStepRight, Node node, Collection<Node> output) {
        Path part1 = forwardMode ? pathStepLeft : pathStepRight ;
        Path part2 = forwardMode ? pathStepRight : pathStepLeft ;

        // Feed one side into the other
        Iter<Node> iter = eval(part1, node) ;
        for (Node n : iter)
            eval(part2, n, output) ;
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
        // The next step
        long min2 = dec(min1) ;
        long max2 = dec(max1) ;

        // TODO Rewrite
        Path p1 = pathStep ;
        Path p2 = new P_Mod(pathStep, min2, max2) ;

        if ( !forwardMode ) {
            // Reverse order. Do the second bit first.
            Path tmp = p1 ;
            p1 = p2 ;
            p2 = tmp ;
            // This forces execution to be in the order that it's written, when
            // working backwards.
            // {N,*} is {*} then {N} backwards != do {N} then do {*} as
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
       
        if ( s1 == s && o1 == o )
            // No change.
            return super.transform(opPath) ;
       
        Path path = tp.getPath() ;
        TriplePath tp2 ;

        if ( path != null )
            tp2 = new TriplePath(s1, path, o1) ;
        else
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
    }
   
    @Override
    protected void doSeq(Path pathStepLeft, Path pathStepRight, Node node, Collection<Node> output)
    {
        Path part1 = forwardMode ? pathStepLeft : pathStepRight ;
        Path part2 = forwardMode ? pathStepRight : pathStepLeft ;
   
        // Feed one side into the other
        Iter<Node> iter = eval(graph, part1, node) ;
        for ( Node n : iter )
            eval(graph, part2, n, output) ;
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
        // The next step
        long min2 = dec(min1) ;
        long max2 = dec(max1) ;

        // TODO Rewrite
        Path p1 = pathStep ;  
        Path p2 = new P_Mod(pathStep, min2, max2) ;

        if ( !forwardMode )
        {
            // Reverse order.  Do the second bit first.
            Path tmp = p1 ;
            p1 = p2 ; p2 = tmp ;
            // This forces execution to be in the order that it's written, when working backwards.
            // {N,*} is  {*} then {N} backwards != do {N} then do {*} as cardinality of the
            // two operations is different.
        }
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
    }

    @Override
    protected void doSeq(Path pathStepLeft, Path pathStepRight, Node node, Collection<Node> output)
    {
        Path part1 = forwardMode ? pathStepLeft : pathStepRight ;
        Path part2 = forwardMode ? pathStepRight : pathStepLeft ;

        // Feed one side into the other
        Iter<Node> iter = eval(graph, part1, node) ;
        for ( Node n : iter )
            eval(graph, part2, n, output) ;
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.sparql.path.Path

  • com.hp.hpl.jena.sparql.graph.NodeTransformOp
  • com.hp.hpl.jena.sparql.path.eval.PathEngine1
  • com.hp.hpl.jena.sparql.path.eval.PathEngineN
  • com.hp.hpl.jena.sparql.path.eval.PathEngineSPARQL
    • 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.