@Override public boolean hasNext() { return source.hasNext(); }
@Override public boolean hasNext() { return delegate.hasNext(); }
@Override protected boolean fetchNext() { if ( currentIterator == null || !currentIterator.hasNext() ) { while ( iterators.hasNext() ) { currentIterator = iterators.next(); if ( currentIterator.hasNext() ) { break; } } } return (currentIterator != null && currentIterator.hasNext()) && next( currentIterator.next() ); }
/** * Pulls all items from the {@code iterator} and puts them into a {@link List}, boxing each int. * * @param iterator {@link PrimitiveIntIterator} to pull values from. * @return a {@link List} containing all items. */ public static List<Integer> toList( PrimitiveIntIterator iterator ) { List<Integer> out = new ArrayList<>(); while ( iterator.hasNext() ) { out.add( iterator.next() ); } return out; }
public static <T> Set<T> mapToSet( PrimitiveIntIterator iterator, IntFunction<T> map ) { Set<T> set = new HashSet<>(); while ( iterator.hasNext() ) { addUnique( set, map.apply( iterator.next() ) ); } return set; }
public static void consume( PrimitiveIntIterator source, IntConsumer consumer ) { while ( source.hasNext() ) { consumer.accept( source.next() ); } }
@Override public boolean addAll( PrimitiveIntIterator values ) { boolean changed = false; while ( values.hasNext() ) { changed |= HopScotchHashingAlgorithm.put( table, monitor, DEFAULT_HASHING, values.next(), valueMarker, this ) == null; } return changed; }
public static PrimitiveIntSet asSet( PrimitiveIntIterator iterator ) { PrimitiveIntSet set = Primitive.intSet(); while ( iterator.hasNext() ) { int next = iterator.next(); if ( !set.add( next ) ) { throw new IllegalStateException( "Duplicate " + next + " from " + iterator ); } } return set; }
public static long[] asLongArray( PrimitiveIntCollection values ) { long[] array = new long[values.size()]; PrimitiveIntIterator iterator = values.iterator(); int i = 0; while ( iterator.hasNext() ) { array[i++] = iterator.next(); } return array; }
@Override protected boolean fetchNext() { while ( source.hasNext() ) { int testItem = source.next(); if ( test( testItem ) ) { return next( testItem ); } } return false; }
private static void assertNoMoreItems( PrimitiveIntIterator iterator ) { assertFalse( iterator.hasNext(), iterator + " should have no more items" ); assertThrows( NoSuchElementException.class, iterator::next ); }
@Test void shouldNotContinueToCallNextOnHasNextFalse() { // GIVEN AtomicInteger count = new AtomicInteger( 2 ); PrimitiveIntIterator iterator = new PrimitiveIntCollections.PrimitiveIntBaseIterator() { @Override protected boolean fetchNext() { return count.decrementAndGet() >= 0 && next( count.get() ); } }; // WHEN/THEN assertTrue( iterator.hasNext() ); assertTrue( iterator.hasNext() ); assertEquals( 1L, iterator.next() ); assertTrue( iterator.hasNext() ); assertTrue( iterator.hasNext() ); assertEquals( 0L, iterator.next() ); assertFalse( iterator.hasNext() ); assertFalse( iterator.hasNext() ); assertEquals( -1L, count.get() ); }
private static void assertNextEquals( long expected, PrimitiveIntIterator iterator ) { assertTrue( iterator.hasNext(), iterator + " should have had more items" ); assertEquals( expected, iterator.next() ); }
@Test void shouldIterate() { // GIVEN PrimitiveIntStack stack = new PrimitiveIntStack(); // WHEN for ( int i = 0; i < 7; i++ ) { stack.push( i ); } // THEN PrimitiveIntIterator iterator = stack.iterator(); int i = 0; while ( iterator.hasNext() ) { assertEquals( i++, iterator.next() ); } assertEquals( 7, i ); } }
private SizedNodeIterator( PrimitiveIntIterator iterator, int start, int length) { while (iterator.hasNext() && start-- > 0) { iterator.next(); } this.iterator = iterator; this.remaining = length; }
public static void consume( PrimitiveIntIterator source, IntConsumer consumer ) { while ( source.hasNext() ) { consumer.accept( source.next() ); } }
public static long[] asLongArray( PrimitiveIntCollection values ) { long[] array = new long[values.size()]; PrimitiveIntIterator iterator = values.iterator(); int i = 0; while ( iterator.hasNext() ) { array[i++] = iterator.next(); } return array; }
private void initLabels() { PrimitiveIntIterator iterator = nodes.iterator(); while (iterator.hasNext()) { int nodeId = iterator.next(); int existingLabel = (int) this.nodeProperties.get(nodeId, (double) nodeId); existingLabels[nodeId] = existingLabel; } }
@Override public void forEachNode(IntPredicate consumer) { final PrimitiveIntIterator nodeIterator = nodeIterator(); while (nodeIterator.hasNext()) { if (!consumer.test(nodeIterator.next())) { break; } } }
public static long[] asLongArray( PrimitiveIntCollection values ) { long[] array = new long[values.size()]; PrimitiveIntIterator iterator = values.iterator(); int i = 0; while ( iterator.hasNext() ) { array[i++] = iterator.next(); } return array; }