/** * Returns the {@link Triple} value associated to the quadruple by cutting * the graph value. * * @return the {@link Triple} value associated to the quadruple by cutting * the graph value. */ public Triple toTriple() { return Triple.create(this.nodes[1], this.nodes[2], this.nodes[3]); }
public static GraphEvents remove( Node s, Node p, Node o ) { return new GraphEvents( "remove", Triple.create( s, p, o ) ){ @Override public Triple getTriple() { return (Triple)content; } }; }
private static void registerHandler( Node s, Node p, Node o, TripleQueryHandler handler ) { Triple pattern = Triple.create( s, p, o ); if( log.isLoggable( Level.FINE ) ) log.fine( "Registering handler for pattern: " + pattern ); Object prev = QUERY_HANDLERS.put( pattern, handler ); if( prev != null ) { if( log.isLoggable( Level.SEVERE ) ) log.severe( "Existing handler found for pattern: " + pattern ); } }
public Triple map1( ATermAppl p ) { return Triple.create( s, JenaUtils.makeGraphNode( p ), o ); } };
public Triple map1( ATermAppl s ) { return Triple.create( JenaUtils.makeGraphNode( s ), p, o ); } };
public Triple map1( ATermAppl o ) { return Triple.create( s, p, JenaUtils.makeGraphNode( o ) ); } };
/** Answer <code>true</code> if this graph contains <code>(s, p, o)</code>; this canonical implementation cannot be over-ridden. */ @Override public final boolean contains( Node s, Node p, Node o ) { checkOpen(); return contains( Triple.create( s, p, o ) ); }
/** Answer <code>true</code> if this graph contains <code>(s, p, o)</code>; this canonical implementation cannot be over-ridden. */ public final boolean contains( Node s, Node p, Node o ) { checkOpen(); return contains( Triple.create( s, p, o ) ); }
@Override public void derive(Node s, Node p, Node o) { if ( isTriple ) output.triple(Triple.create(s,p,o)) ; else output.quad(Quad.create(g,s,p,o)) ; } } ;
private Triple convert(AResource s, AResource p, AResource o) { return Triple.create(convert(s), convert(p), convert(o)); }
@Override public Triple asTriple() { return Triple.create( subject.asNode(), predicate.asNode(), object.asNode() ); }
private Triple convert(AResource s, AResource p, ALiteral o) { Node object = convert(o) ; checker.check(object, -1, -1) ; return Triple.create(convert(s), convert(p), object); }
@Override public Model remove( Resource s, Property p, RDFNode o ) { graph.delete( Triple.create( s.asNode(), p.asNode(), o.asNode() ) ); return this; }
@Override public ExtendedIterator<Triple> find(KnowledgeBase kb, PelletInfGraph pellet, Node subj, Node pred, Node obj) { return contains( kb, pellet.getLoader(), subj, pred, obj ) ? new SingletonIterator<Triple>( Triple.create( subj, pred, obj ) ) : NullIterator.<Triple>instance(); } }
private Triple convert(AResource s, AResource p, ALiteral o) { Node object = convert(o) ; checker.check(object, -1, -1) ; return Triple.create(convert(s), convert(p), object); }
@Override public Model add( Resource s, Property p, RDFNode o ) { modelReifier.noteIfReified( s, p, o ); graph.add( Triple.create( s.asNode(), p.asNode(), o.asNode() ) ); return this; }
private Triple rename(Triple t) { Node S = t.getSubject(), P = t.getPredicate(), O = t.getObject(); Node newS = rename(S), newP = rename(P), newO = rename(O); if (newS == S && newP == P && newO == O) return t; return Triple.create(newS, newP, newO); }
public boolean entails(Triple pattern) { prepare(); if( isSyntaxTriple( pattern ) ) { return true; } if( isBnodeTypeQuery( pattern ) ) { return !containsTriple( Triple.create( pattern.getObject(), RDFS.subClassOf.asNode(), OWL.Nothing.asNode() ) ); } else { return containsTriple( pattern ); } }