Package com.hp.hpl.jena.graph

Examples of com.hp.hpl.jena.graph.Triple

336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
        for ( Node elt : list )
        {
            // Cell:
            Node consCell = NodeFactory.createAnon() ;
            // Last cell to this one.
            Triple t = new Triple(n, RDF.Nodes.rest, consCell) ;
            Triple t1 = new Triple(consCell, RDF.Nodes.first, elt) ;
            n = consCell ;
            bgp.add(t) ;
            bgp.add(t1) ;
        }
        // Finish list.
        Triple t = new Triple(n, RDF.Nodes.rest, RDF.Nodes.nil) ;
        bgp.add(t) ;
        return head ;
    }
View Full Code Here
371
372
373
374
375
376
377
378
379
380
    private static Node cdr(GNode gnode)     { return getNode(gnode, CDR) ; }
    private static Node getNode(GNode gnode, Node arc)
    {
        if ( listEnd(gnode) )
            return null ;
        Triple t = getTriple(gnode, arc) ;
        if ( t == null )
            return null ;
        return t.getObject() ;
    }
View Full Code Here
385
386
387
388
389
390
391
392
393
394
395
            return null ;
       
        Iterator<Triple> iter = gnode.findable.find(gnode.node, arc, Node.ANY) ;
        if ( ! iter.hasNext() )
            return null ;
        Triple t = iter.next() ;
        if ( iter.hasNext() )
            Log.warn(GraphList.class, "Unusual list: two arcs with same property ("+arc+")") ;
        NiceIterator.close(iter) ;
        return t ;        
    }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
        SortedMap<Integer, Node> triples = new TreeMap<Integer, Node>(order) ;
        try {
            for ( ; iter.hasNext() ; )
            {
                Triple t = iter.next() ;
                int index = getIndex(t) ;
                if ( index == NOT_FOUND )
                    continue ;
                // Insert
                triples.put(new Integer(index), t.getObject()) ;
            }
        } finally { iter.close() ; }
        return triples.values() ;
    }
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
153
        int count = 0 ;
        ExtendedIterator<Triple> iter = graph.find(container, Node.ANY, member) ;
        try {
            for ( ; iter.hasNext() ; )
            {
                Triple t = iter.next() ;
                Node p = t.getPredicate() ;
                String u = p.getURI() ;
                
                if ( membershipPattern.matcher(u).matches() ) {
                    count ++ ;
                    if ( stopEarly )
View Full Code Here
136
137
138
139
140
141
142
       
        Node oNode = nodeTable.getNodeForNodeId(o) ;
        if ( oNode == null )
            throw new InternalErrorException("Invalid id node for object (null node): "+fmt(s,p,o)) ;
       
        return new Triple(sNode, pNode, oNode) ;
    }
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
            // Prefixes for result
            insertPrefixesInto(model);
           
            while (it.hasNext())
            {
                Triple t = it.next();
                Statement stmt = ModelUtils.tripleToStatement(model, t);
                if ( stmt != null )
                    model.add(stmt);
            }
        }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
       
        ClosableIterator<Triple> it = find( t );
        try {
            for ( ; it.hasNext() ; )
            {
                Triple t2 = it.next() ;
                if ( tripleContained(t, t2) )
                    return true ;
            }
        } finally { it.close(); }
        return false ;
View Full Code Here
56
57
58
59
60
61
62
63
64
65
        this.transform = transform ;
    }

    @Override public Op transform(OpTriple opTriple)
    {
        Triple t2 = NodeTransformLib.transform(transform, opTriple.getTriple()) ;
        if ( t2 == opTriple.getTriple())
            return super.transform(opTriple) ;
        return new OpTriple(t2) ;
    }
View Full Code Here
98
99
100
101
102
103
104
105
106
107
        if ( path != null )
            tp2 = new TriplePath(s1, path, o1) ;
        else
        {
            Triple t = new Triple(s1, tp.getPredicate(), o1) ;
            tp2 = new TriplePath(t) ;
        }
        return new OpPath(tp2) ;
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.graph.Triple

  • arq.examples.AlgebraExec
  • arq.examples.ExProg1
  • arq.examples.ExProg2
  • arq.examples.propertyfunction.labelSearch
  • arq.examples.propertyfunction.localname
  • com.clarkparsia.pellet.sparqldl.parser.ARQParser
  • com.github.jsonldjava.jena.JenaRDFParser
  • com.github.jsonldjava.jena.JsonLDReader
  • com.hp.gloze.extension.Reify
  • com.hp.hpl.jena.graph.test.AbstractTestGraph
    • 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.