@Override public boolean hasNext() { lazy(); return it.hasNext(); }
/** Answer a list of the elements from <code>it</code>, in order, consuming that iterator. Canonical implementation of toList(). */ public static <T> List<T> asList( ExtendedIterator<T> it ) { List<T> result = new ArrayList<T>(); while (it.hasNext()) result.add( it.next() ); return result; } }
private void triplesToZap(Collection<Triple> acc, Node s, Node p , Node o) { ExtendedIterator<Triple> iter = graph.find(s,p,o) ; while(iter.hasNext()) acc.add(iter.next()) ; }
/** * <p>Answer true if there is at least one inverse property for this property.</p> * @return True if property has an inverse. */ @Override public boolean hasInverse() { ExtendedIterator<OntProperty> i = listInverse(); boolean hasInv = i.hasNext(); i.close(); return hasInv; }
/** @return true iff there's > 0 mappings to this triple */ public static boolean hasTriple(Graph graph, Triple t) { ExtendedIterator<Node> iter = findNodesForTriple(graph, t, false) ; try { return iter.hasNext() ; } finally { iter.close() ; } }
public static void accTriples(Collection<Triple> acc, Graph graph, Node s, Node p, Node o) { ExtendedIterator<Triple> iter = graph.find(s, p, o) ; for ( ; iter.hasNext() ; ) acc.add(iter.next()) ; iter.close() ; }
static void accTriplesOfSubject(Collection<Triple> acc, Graph graph, Node subj) { ExtendedIterator<Triple> iter = graph.find(subj, Node.ANY, Node.ANY); for (; iter.hasNext();) { acc.add(iter.next()); } iter.close(); } }
private void preprocessClasses(OntModel model) { //Let's iterate over all classes ExtendedIterator extendedIterator = model.listClasses(); while (extendedIterator.hasNext()) { checkOntologyClassAndRegister((OntClass) extendedIterator.next()); } }
static private void findContainers(Collection<Node> acc, Graph graph, Node typeNode) { ExtendedIterator<Triple> iter = graph.find(Node.ANY, RDF.type.asNode(), typeNode) ; while(iter.hasNext()) { Triple t = iter.next(); Node containerNode = t.getSubject() ; acc.add(containerNode) ; } }
public static long hashModel( Model m ) { long result = 0; ExtendedIterator<Triple> it = m.getGraph().find(Node.ANY, Node.ANY, Node.ANY); while (it.hasNext()) result ^= hashTriple( it.next() ); return result; }
private Node getNode(Node S, Node P) { ExtendedIterator<Triple> it = graph.find(S,P, Node.ANY) ; if ( ! it.hasNext() ) return null ; Triple t = it.next() ; it.close() ; return t.getObject() ; } }
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(); } } }
private <E> Collection<E> parseIntoCollection(RDFList list, Collection<E> l, ClassMeta<?> type, BeanPropertyMeta pMeta) throws Exception { int argIndex = 0; for (ExtendedIterator<RDFNode> ni = list.iterator(); ni.hasNext();) { E e = (E)parseAnything(type.isArgs() ? type.getArg(argIndex++) : type.getElementType(), ni.next(), l, pMeta); l.add(e); } return l; }
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(); } }
@Override public void addGraph(Node gn, Graph g) { // Convert to quads. //super.addGraph(gn, g) ; ExtendedIterator<Triple> iter = g.find(Node.ANY, Node.ANY, Node.ANY) ; for ( ; iter.hasNext(); ) { Triple t = iter.next() ; add(gn, t.getSubject(), t.getPredicate(), t.getObject()) ; } }
private void createObjects(OntModel ontModel, Model model) { ExtendedIterator extendedIterator = ontModel.listIndividuals(); while (extendedIterator.hasNext()) { Individual individual = (Individual) extendedIterator.next(); OntClass ontClass = (OntClass) individual.getRDFType().as(OntClass.class); createAndAdd(model, individual.getURI(), ontClass.getLocalName()); } }
@Test(expected=ConcurrentModificationException.class) public void mrswGraph3() { Model m = create().getDefaultModel() ; Resource r = m.createResource("x") ; ExtendedIterator<Statement> iter1 = m.listStatements(r, null, (RDFNode)null) ; assertNotNull(iter1.next()) ; Triple t = SSE.parseTriple("(<y> <p> 99)") ; m.getGraph().delete(t) ; // Bad iter1.hasNext(); }