@Override protected void closeIterator() { Iter.close(iter); } }
@Override public void close() { Iter.close(iter); }
@Override public void close() { finished = true ; Iter.close(iter) ; } }
@Override public void close() { Iter.close(iterator) ; iterator = null ; } }
@Override public void close() { for (Iterator<T> it : inputs) { Iter.close(it); } }
@Override public void close() { Iter.close(input) ; } }
@Override public void close() { finished = true; Iter.close(iter); } }
@Override public boolean contains(Node g, Node s, Node p, Node o) { Iterator<Quad> iter = find(g, s, p, o); boolean b = iter.hasNext(); Iter.close(iter); return b; }
@Override protected void closeIterator() { if ( iterator != null ) { NiceIterator.close(iterator) ; // In case we wrapped, for example, another QueryIterator. Iter.close(iterator) ; iterator = null ; } }
public static void addAll(Graph g, Iterator<Triple> iter) { while (iter.hasNext()) g.add(iter.next()) ; Iter.close(iter) ; }
public static void deleteAll(Graph g, Iterator<Triple> iter) { while (iter.hasNext()) g.delete(iter.next()) ; Iter.close(iter) ; }
@Override public Set<String> graphNames() { Iterator<Tuple<Node>> iter = nodeTupleTable.find((Node)null, null, null) ; Set <String> x = new HashSet<>() ; for ( ; iter.hasNext() ; ) x.add(iter.next().get(0).getURI()) ; Iter.close(iter) ; return x ; }
@Override public Set<String> graphNames() { Iterator<Tuple<Node>> iter = nodeTupleTable.find((Node)null, null, null) ; Set <String> x = new HashSet<>() ; for ( ; iter.hasNext() ; ) x.add(iter.next().get(0).getURI()) ; Iter.close(iter) ; return x ; }
@Override public String readByURI(String graphName, String uriStr) { Node g = NodeFactory.createURI(graphName) ; Node u = NodeFactory.createURI(uriStr) ; Iterator<Tuple<Node>> iter = nodeTupleTable.find(g, null, u) ; if ( ! iter.hasNext() ) return null ; Node prefix = iter.next().get(1) ; Iter.close(iter) ; return prefix.getLiteralLexicalForm() ; }
@Override public synchronized String readByURI(String graphName, String uriStr) { Node g = NodeFactory.createURI(graphName) ; Node u = NodeFactory.createURI(uriStr) ; Iterator<Tuple<Node>> iter = nodeTupleTable.find(g, null, u) ; if ( ! iter.hasNext() ) return null ; Node prefix = iter.next().get(1) ; Iter.close(iter) ; return prefix.getLiteralLexicalForm() ; }
/** Remove by pattern */ private synchronized void removeAll(Node g, Node p, Node uri) { Iterator<Tuple<Node>> iter = nodeTupleTable.find(g, p, uri) ; List<Tuple<Node>> list = Iter.toList(iter) ; // Materialize. Iter.close(iter) ; for ( Tuple<Node> tuple : list ) nodeTupleTable.deleteRow(tuple.get(0), tuple.get(1), tuple.get(2)) ; }
/** Remove by pattern */ private synchronized void removeAll(Node g, Node p, Node uri) { Iterator<Tuple<Node>> iter = nodeTupleTable.find(g, p, uri) ; List<Tuple<Node>> list = Iter.toList(iter) ; // Materialize. Iter.close(iter) ; for ( Tuple<Node> tuple : list ) nodeTupleTable.deleteRow(tuple.get(0), tuple.get(1), tuple.get(2)) ; }