Refine search
/** Invokes {@code consumer} for each value contained in this array, in order. */ public void forEach(IntConsumer consumer) { checkNotNull(consumer); for (int i = start; i < end; i++) { consumer.accept(array[i]); } }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public static IntConsumer every(int count, IntConsumer consumer) { if (count <= 0) throw new IllegalArgumentException("Count must be >1: Got " + count); return new IntConsumer() { private int i; @Override public void accept(int value) { if (++this.i == count) { consumer.accept(value); this.i = 0; } } }; }
public void addOnKeyframePulled(IntConsumer consumer) { this.onKeyframePulled = onKeyframePulled == null ? consumer : onKeyframePulled.andThen(consumer); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public void addOnChunkFailed(IntConsumer consumer) { this.onChunkFailed = onChunkFailed == null ? consumer : onChunkFailed.andThen(consumer); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public void setPartitionedSplitCount(int partitionedSplitCount) { splitSetter.accept(partitionedSplitCount); }
public void addOnChunkPulled(IntConsumer consumer) { this.onChunkPulled = onChunkPulled == null ? consumer : onChunkPulled.andThen(consumer); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
public void ifPresent(IntConsumer consumer) { if (this != emptyInstance) { consumer.accept(value); } }
public void addOnKeyframeFailed(IntConsumer consumer) { this.onKeyframeFailed = onKeyframeFailed == null ? consumer : onKeyframeFailed.andThen(consumer); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
/** Invokes {@code consumer} for each value contained in this array, in order. */ public void forEach(IntConsumer consumer) { checkNotNull(consumer); for (int i = start; i < end; i++) { consumer.accept(array[i]); } }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] tab = this.tab; long entry; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if ((int) (entry = tab[i]) < FREE_BITS) { action.accept((int) (entry >>> 32)); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEachOrdered(IntConsumer action) { requireNonNull(action); action.accept(element); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }
@Override public void forEach(IntConsumer action) { requireNonNull(action); action.accept(element); }
@Override public void forEachRemaining(IntConsumer action) { if (action == null) throw new java.lang.NullPointerException(); long[] keys = this.keys; int[] vals = this.vals; int nextI = nextIndex; for (int i = nextI; i >= 0; i--) { if (keys[i] < FREE_BITS) { action.accept(vals[i]); } } if (nextI != nextIndex) { throw new java.util.ConcurrentModificationException(); } nextIndex = -1; }