/** Is this quad pattern explicitly naming the default graph? */ public boolean isExplicitDefaultGraph() { return Quad.isDefaultGraphExplicit(graphNode) ; } /** Is this quad pattern explicitly naming the union graph? */
/** Is this quad pattern explicitly naming the default graph? */ public boolean isExplicitDefaultGraph() { return Quad.isDefaultGraphExplicit(graphNode) ; } /** Is this quad pattern explicitly naming the union graph? */
/** Default, concrete graph (either generated or explicitly named) -- not triple-in-quad*/ public static boolean isDefaultGraph(Node node) { return isDefaultGraphGenerated(node) || isDefaultGraphExplicit(node) ; }
/** Default, concrete graph (either generated or explicitly named) -- not triple-in-quad*/ public static boolean isDefaultGraph(Node node) { return isDefaultGraphGenerated(node) ||isDefaultGraphExplicit(node) ; }
/** Default, concrete graph via generated URI (not explciitly named) */ public boolean isDefaultGraphExplicit() { return isDefaultGraphExplicit(getGraph()) ; }
/** Default, concrete graph via generated URI (not explciitly named) */ public boolean isDefaultGraphExplicit() { return isDefaultGraphExplicit(getGraph()) ; }
@Override public boolean containsGraph(Node graphNode) { if ( Quad.isUnionGraph(graphNode) ) return true ; if ( Quad.isDefaultGraphExplicit(graphNode)) return true ; return super.containsGraph(graphNode) ; }
@Override public void delete(Node g, Node s, Node p, Node o) { if ( Quad.isDefaultGraphGenerated(g) || Quad.isDefaultGraphExplicit(g) ) deleteFromDftGraph(s, p, o) ; else deleteFromNamedGraph(g, s, p, o) ; }
@Override public void add(Node g, Node s, Node p, Node o) { if ( Quad.isDefaultGraphGenerated(g) || Quad.isDefaultGraphExplicit(g) ) addToDftGraph(s, p, o) ; else addToNamedGraph(g, s, p, o) ; }
@Override public Graph getGraph(Node graphNode) { if ( Quad.isUnionGraph(graphNode) ) { if ( unionGraph == null ) unionGraph = GraphOps.unionGraph(super.getWrapped()) ; return unionGraph ; } if ( Quad.isDefaultGraphExplicit(graphNode)) return getDefaultGraph() ; return super.getGraph(graphNode) ; } }