private static boolean outputGraphSlot(Node g) { return ( g != null && g != Quad.tripleInQuad && ! Quad.isDefaultGraph(g) ) ; }
private static boolean outputGraphSlot(Node g) { return ( g != null && g != Quad.tripleInQuad && ! Quad.isDefaultGraph(g) ) ; } }
protected static boolean isDefaultGraph(Node quadGraphNode) { return ( quadGraphNode == null || Quad.isDefaultGraph(quadGraphNode) ) ; }
private static boolean outputGraphSlot(Node g) { return ( g != null && g != Quad.tripleInQuad && ! Quad.isDefaultGraph(g) ) ; }
protected static boolean isDefaultGraph(Node quadGraphNode) { return ( quadGraphNode == null || Quad.isDefaultGraph(quadGraphNode) ) ; }
/** Default, concrete graph (either generated or explicitly named) */ public boolean isDefaultGraph() { return isDefaultGraph(getGraph()) ; }
/** Default, concrete graph (either generated or explicitly named) */ public boolean isDefaultGraph() { return isDefaultGraph(getGraph()) ; }
@Override public void delete(Node g , Node s, Node p, Node o) { if ( Quad.isDefaultGraph(g) ) graph.delete(new Triple(s, p, o)) ; else throw new UnsupportedOperationException("DatasetGraphOne.delete/named graph") ; }
@Override public void add(Node g , Node s, Node p, Node o) { if ( Quad.isDefaultGraph(g) ) graph.add(new Triple(s, p, o)) ; else throw new UnsupportedOperationException("DatasetGraphOne.add/named graph") ; }
protected Graph fetchGraph(Node gn) { if ( Quad.isDefaultGraph(gn) ) return getDefaultGraph() ; else return getGraph(gn) ; } }
public static boolean containsGraph(DatasetGraph dsg, Node gn) { // [[DynDS]] if ( Quad.isDefaultGraph(gn)) return true ; if ( Quad.isUnionGraph(gn)) return true ; return dsg.containsGraph(gn) ; }
protected Graph fetchGraph(Node gn) { if ( Quad.isDefaultGraph(gn) || Lib.equal(gn,Quad.tripleInQuad)) // Not preferred style return getDefaultGraph() ; else return getGraph(gn) ; } }
/** Implementation of find based on splitting into triples (default graph) and quads (named graph) */ @Override public Iterator<Quad> find(Node g, Node s, Node p , Node o) { if ( Quad.isDefaultGraph(g)) return findInDftGraph(s, p, o) ; if ( ! isWildcard(g) ) return findNG(g, s, p, o) ; return findAny(s, p, o) ; }
public Quad convert(Quad quad) { if ( ! quad.isDefaultGraph() ) return quad ; return new Quad(dftGraph, quad.getSubject(), quad.getPredicate(), quad.getObject()) ; } };
@Override public Quad convert(Quad quad) { if ( ! quad.isDefaultGraph() ) return quad ; return new Quad(dftGraph, quad.getSubject(), quad.getPredicate(), quad.getObject()) ; } };
public static Graph getGraph(DatasetGraph dsg, Node gn) { // [[DynDS]] if ( gn == null ) return dsg.getDefaultGraph() ; if ( Quad.isDefaultGraph(gn) ) // Explicit or generated. return dsg.getDefaultGraph() ; if ( Quad.isUnionGraph(gn)) return unionGraph(dsg) ; return dsg.getGraph(gn) ; }
/** Implementation of find based on splitting into triples (default graph) and quads (named graph) */ //@Override public Iterator<Quad> find(Node g, Node s, Node p , Node o) { if ( ! isWildcard(g) ) { if ( Quad.isDefaultGraph(g)) return findInDftGraph(s,p,o) ; Iterator<Quad> qIter = findInSpecificNamedGraph(g, s, p, o) ; if ( qIter == null ) return Iter.nullIterator() ; return qIter ; } return findAny(s, p, o) ; }
private QueryIterator specialcase(Node gn, Op subOp, QueryIterator input) { // This is a placeholder for code to specially handle explicitly named // default graph and union graph. if (Quad.isDefaultGraph(gn)) { ExecutionContext cxt2 = new ExecutionContext(execCxt, execCxt.getDataset().getDefaultGraph()) ; return execute(subOp, input, cxt2) ; } if ( Quad.isUnionGraph(gn) ) Log.warn(this, "Not implemented yet: union default graph in general OpExecutor") ; // Bad news -- if ( Lib.equals(gn, Quad.tripleInQuad) ) {} return null ; }
@Override public void add(Quad quad) { if ( quad.isDefaultGraph() ) addToDftGraph(quad.getSubject(), quad.getPredicate(), quad.getObject()) ; else addToNamedGraph(quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }
@Override public void delete(Quad quad) { if ( quad.isDefaultGraph() ) deleteFromDftGraph(quad.getSubject(), quad.getPredicate(), quad.getObject()) ; else deleteFromNamedGraph(quad.getGraph(), quad.getSubject(), quad.getPredicate(), quad.getObject()) ; }