@Override protected void closeIterator() { if ( graphIter != null ) NiceIterator.close(graphIter) ; graphIter = null ; }
@Override protected void closeIterator() { if ( iterator != null ) { NiceIterator.close(iterator) ; iterator = null ; } }
/** if <code>it</code> is a Closableiterator, close it. Abstracts away from tests [that were] scattered through the code. */ public static void close( Iterator<?> it ) { NiceIterator.close( it ); } }
@Override protected void closeIterator() { if ( graphIter != null ) NiceIterator.close(graphIter) ; graphIter = null ; }
@Override protected void closeIterator() { if ( iterator != null ) { NiceIterator.close(iterator) ; iterator = null ; } }
@Override public void close() { NiceIterator.close( base ); } }
public void close() { if ( iter != null ) NiceIterator.close(iter) ; }
public void close() { if ( iter != null ) NiceIterator.close(iter) ; }
/** Answer the elements of the given iterator as a list, in the order that they arrived from the iterator. The iterator is consumed by this operation: even if an exception is thrown, the iterator will be closed. @param it the iterator to convert @return a list of the elements of <code>it</code>, in order */ public static <T> List<T> iteratorToList( Iterator<? extends T> it ) { List<T> result = new ArrayList<T>(); try { while (it.hasNext()) result.add( it.next() ); } finally { NiceIterator.close( it ); } return result; }
@Override protected void closeIterator() { if ( iterator != null ) { NiceIterator.close(iterator) ; // In case we wrapped, for example, another QueryIterator. Iter.close(iterator) ; iterator = null ; } }
/** Answer the elements of the given iterator as a set. The iterator is consumed by the operation. Even if an exception is thrown, the iterator will be closed. @param i the iterator to convert @return A set of the members of i */ public static <T> Set<T> iteratorToSet( Iterator<? extends T> i ) { Set<T> result = CollectionFactory.createHashedSet(); try { while (i.hasNext()) result.add( i.next() ); } finally { NiceIterator.close( i ); } return result; }
@Override protected void closeIterator() { if ( iterator != null ) { NiceIterator.close(iterator) ; // In case we wrapped, for example, another QueryIterator. Iter.close(iterator) ; iterator = null ; } }
private static Triple getTripleReverse(GNode gnode, Node arc) { Iterator<Triple> iter = gnode.findable.find(Node.ANY, arc, gnode.node) ; if ( ! iter.hasNext() ) return null ; Triple t = iter.next() ; if ( iter.hasNext() ) Log.warn(GraphList.class, "Unusual list: two arcs with same property ("+arc+")") ; NiceIterator.close(iter) ; return t ; }
private static Triple getTripleReverse(GNode gnode, Node arc) { Iterator<Triple> iter = gnode.findable.find(Node.ANY, arc, gnode.node) ; if ( ! iter.hasNext() ) return null ; Triple t = iter.next() ; if ( iter.hasNext() ) Log.warn(GraphList.class, "Unusual list: two arcs with same property ("+arc+")") ; NiceIterator.close(iter) ; return t ; }
public boolean hasNext() { if ( ! active ) return false ; if ( slot != null ) return true ; if ( ! iter.hasNext() ) { active = false ; return false ; } slot = iter.next() ; if ( test.accept(slot) ) return true ; // Once the test goes false, no longer yield anything. NiceIterator.close(iter) ; active = false ; iter = null ; slot = null ; return false ; }
private static Set<GNode> findCellsWithMember(GNode gnode) { Set<GNode> x = new HashSet<GNode>() ; Iterator<Triple> iter = gnode.findable.find(Node.ANY, CAR, gnode.node) ; for ( ; iter.hasNext() ; ) { Triple t = iter.next() ; x.add(new GNode(gnode, t.getSubject())) ; } NiceIterator.close(iter) ; return x ; }
@Override public boolean hasNext() { if ( ! active ) return false ; if ( slot != null ) return true ; if ( ! iter.hasNext() ) { active = false ; return false ; } slot = iter.next() ; if ( test.accept(slot) ) return true ; // Once the test goes false, no longer yield anything. NiceIterator.close(iter) ; active = false ; iter = null ; slot = null ; return false ; }
private static Set<GNode> findCellsWithMember(GNode gnode) { Set<GNode> x = new HashSet<GNode>() ; Iterator<Triple> iter = gnode.findable.find(Node.ANY, CAR, gnode.node) ; for ( ; iter.hasNext() ; ) { Triple t = iter.next() ; x.add(new GNode(gnode, t.getSubject())) ; } NiceIterator.close(iter) ; return x ; }
private static Triple getTriple(GNode gnode, Node arc) { if ( listEnd(gnode) ) return null ; Iterator<Triple> iter = gnode.findable.find(gnode.node, arc, Node.ANY) ; if ( ! iter.hasNext() ) return null ; Triple t = iter.next() ; if ( iter.hasNext() ) Log.warn(GraphList.class, "Unusual list: two arcs with same property ("+arc+")") ; NiceIterator.close(iter) ; return t ; } }
private static Triple getTriple(GNode gnode, Node arc) { if ( listEnd(gnode) ) return null ; Iterator<Triple> iter = gnode.findable.find(gnode.node, arc, Node.ANY) ; if ( ! iter.hasNext() ) return null ; Triple t = iter.next() ; if ( iter.hasNext() ) Log.warn(GraphList.class, "Unusual list: two arcs with same property ("+arc+")") ; NiceIterator.close(iter) ; return t ; } }