@Override public void remove() { lazy(); it.remove(); }
public static void removeAll( Graph g, Node s, Node p, Node o ) { ExtendedIterator<Triple> it = g.find( s, p, o ); try { while (it.hasNext()) { it.next(); it.remove(); } } finally { it.close(); } }
public static void removeAll( Graph g ) { ExtendedIterator<Triple> it = GraphUtil.findAll( g ); try { while (it.hasNext()) { it.next(); it.remove(); } } finally { it.close(); } } }
public static void removeAll(Graph g, Node s, Node p, Node o) { ExtendedIterator<Triple> it = g.find(s, p, o); try { while (it.hasNext()) { Triple t = it.next(); g.delete(t); it.remove(); } } finally { it.close(); } }
public static void removeAll(Graph g) { ExtendedIterator<Triple> it = GraphUtil.findAll(g); try { while (it.hasNext()) { Triple t = it.next(); g.delete(t); it.remove(); } } finally { it.close(); } // get rid of remaining blank nodes using a SPARQL DELETE if (g instanceof SparqlGraph) { ((SparqlGraph) g).removeAll(); } }