/** 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) ; }
public Iterator<Quad> findNG(Node g, Node s, Node p , Node o) { Iterator<Quad> qIter ; if ( ! isWildcard(g) ) qIter = findInSpecificNamedGraph(g, s, p, o) ; else qIter = findInAnyNamedGraphs(s, p, o) ; if ( qIter == null ) return Iter.nullIterator() ; return qIter ; }
/** 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) ; }
protected Iterator<Quad> findAny(Node s, Node p , Node o) { // Default graph Iterator<Quad> iter1 = findInDftGraph(s, p, o) ; Iterator<Quad> iter2 = findInAnyNamedGraphs(s, p, o) ; if ( iter1 == null && iter2 == null ) return Iter.nullIterator() ; // Copes with null in either position. return Iter.append(iter1, iter2) ; }
@Override public void close() { graph.close(); super.close() ; } }
protected Iterator<Quad> findAny(Node s, Node p , Node o) { // Default graph Iterator<Quad> iter1 = findInDftGraph(s, p, o) ; Iterator<Quad> iter2 = findInAnyNamedGraphs(s, p, o) ; if ( iter1 == null && iter2 == null ) return Iter.nullIterator() ; // Copes with null in either position. return Iter.append(iter1, iter2) ; }
@Override public void close() { graph.close(); super.close() ; } }
@Override public Iterator<Quad> findNG(Node g, Node s, Node p , Node o) { Iterator<Quad> qIter ; if ( Quad.isUnionGraph(g)) qIter = findInAnyNamedGraphs(s, p, o) ; else if ( ! isWildcard(g) ) qIter = findInSpecificNamedGraph(g, s, p, o) ; else qIter = findInAnyNamedGraphs(s, p, o) ; if ( qIter == null ) return Iter.nullIterator() ; return qIter ; }