Java Code Examples for java.util.function.ObjIntConsumer#accept()
The following examples show how to use
java.util.function.ObjIntConsumer#accept() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: Paginator.java From adventure with MIT License | 6 votes |
@SuppressWarnings("unchecked") static <T> void forEachPageEntry(final @NonNull Collection<? extends T> content, final int pageSize, final int page, final @NonNull ObjIntConsumer<? super T> consumer) { final int size = content.size(); final int start = pageSize * (page - 1); final int end = pageSize * page; if(content instanceof List<?> && content instanceof RandomAccess) { final List<? extends T> list = (List<? extends T>) content; for(int i = start; i < end && i < size; i++) { consumer.accept(list.get(i), i); } } else { final Iterator<? extends T> it = content.iterator(); // skip entries on previous pages for(int i = 0; i < start; i++) { it.next(); } for(int i = start; i < end && i < size; i++) { consumer.accept(it.next(), i); } } }
Example 2
Source File: ReduceOps.java From jdk8u_jdk with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 3
Source File: ReduceOps.java From hottub with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 4
Source File: ReduceOps.java From Java8CN with Apache License 2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 5
Source File: ReduceOps.java From openjdk-8 with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 6
Source File: ReduceOps.java From Bytecoder with Apache License 2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 7
Source File: CompressedStringDataChunk.java From powsybl-core with Mozilla Public License 2.0 | 5 votes |
private void forEachMaterializedValueIndex(ObjIntConsumer<String> consumer) { int k = 0; for (int i = 0; i < stepValues.length; i++) { String value = stepValues[i]; for (int j = 0; j < stepLengths[i]; j++) { consumer.accept(value, offset + k++); } } }
Example 8
Source File: ReduceOps.java From openjdk-jdk8u with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 9
Source File: ReduceOps.java From desugar_jdk_libs with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 10
Source File: SystemViewRowAttributeWalkerGenerator.java From ignite with Apache License 2.0 | 5 votes |
/** * Iterates each method of the {@code clazz} and call consume {@code c} for it. * * @param c Method consumer. */ private void forEachMethod(Class<?> clazz, ObjIntConsumer<Method> c) { Method[] methods = clazz.getMethods(); List<Method> notOrdered = new ArrayList<>(); List<Method> ordered = new ArrayList<>(); for (int i = 0; i < methods.length; i++) { Method m = methods[i]; if (Modifier.isStatic(m.getModifiers())) continue; if (SYS_METHODS.contains(m.getName())) continue; Class<?> retClazz = m.getReturnType(); if (retClazz == void.class) continue; if (m.getAnnotation(Order.class) != null) ordered.add(m); else notOrdered.add(m); } Collections.sort(ordered, Comparator.comparingInt(m -> m.getAnnotation(Order.class).value())); Collections.sort(notOrdered, Comparator.comparing(Method::getName)); for (int i = 0; i < ordered.size(); i++) c.accept(ordered.get(i), i); for (int i = 0; i < notOrdered.size(); i++) c.accept(notOrdered.get(i), i + ordered.size()); }
Example 11
Source File: ArrayMap.java From Kettle with GNU General Public License v3.0 | 5 votes |
public void forEachPrimitive(ObjIntConsumer<V> action) { AtomicReferenceArray<V> values = this.values; for (int index = 0; index < values.length(); index++) { V value = values.get(index); if (value != null) { action.accept(value, index); } } }
Example 12
Source File: OpenTracingPluginRetryTest.java From riptide with MIT License | 5 votes |
private static <T> void forEachWithIndex( final Iterable<T> collection, final ObjIntConsumer<T> consumer) { int index = 0; for (final T element : collection) { consumer.accept(element, index++); } }
Example 13
Source File: ReduceOps.java From jdk8u60 with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 14
Source File: ReduceOps.java From TencentKona-8 with GNU General Public License v2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 15
Source File: ReduceOps.java From jdk1.8-source-analysis with Apache License 2.0 | 5 votes |
/** * Constructs a {@code TerminalOp} that implements a mutable reduce on * {@code int} values. * * @param <R> The type of the result * @param supplier a factory to produce a new accumulator of the result type * @param accumulator a function to incorporate an int into an * accumulator * @param combiner a function to combine an accumulator into another * @return A {@code ReduceOp} implementing the reduction */ public static <R> TerminalOp<Integer, R> makeInt(Supplier<R> supplier, ObjIntConsumer<R> accumulator, BinaryOperator<R> combiner) { Objects.requireNonNull(supplier); Objects.requireNonNull(accumulator); Objects.requireNonNull(combiner); class ReducingSink extends Box<R> implements AccumulatingSink<Integer, R, ReducingSink>, Sink.OfInt { @Override public void begin(long size) { state = supplier.get(); } @Override public void accept(int t) { accumulator.accept(state, t); } @Override public void combine(ReducingSink other) { state = combiner.apply(state, other.state); } } return new ReduceOp<Integer, R, ReducingSink>(StreamShape.INT_VALUE) { @Override public ReducingSink makeSink() { return new ReducingSink(); } }; }
Example 16
Source File: UncompressedStringDataChunk.java From powsybl-core with Mozilla Public License 2.0 | 4 votes |
private void forEachValueIndex(ObjIntConsumer<String> consumer) { for (int i = 0; i < values.length; i++) { consumer.accept(values[i], offset + i); } }
Example 17
Source File: IterableHelper.java From ProjectAres with GNU Affero General Public License v3.0 | 4 votes |
static <E> void forEachIndexed(Iterable<E> iterable, ObjIntConsumer<E> consumer) { int i = 0; for(E e : iterable) { consumer.accept(e, i++); } }
Example 18
Source File: IntListKey.java From dfalex with Apache License 2.0 | 4 votes |
public void forData(ObjIntConsumer<int[]> target) { target.accept(m_buf, m_size); }
Example 19
Source File: WorldObjectContainer.java From WorldGrower with GNU General Public License v3.0 | 4 votes |
public void iterate(ObjIntConsumer<WorldObject> consumer) { for(Entry<WorldObject> entry : worldObjects.int2ObjectEntrySet()) { WorldObject object = entry.getValue(); consumer.accept(object, entry.getIntKey()); } }
Example 20
Source File: IntCollector.java From streamex with Apache License 2.0 | 3 votes |
/** * Returns an {@code IntCollector} which partitions the input numbers * according to an {@code IntPredicate}, reduces the values in each * partition according to another {@code IntCollector}, and organizes them * into a {@code Map<Boolean, D>} whose values are the result of the * downstream reduction. * * <p> * There are no guarantees on the type, mutability, serializability, or * thread-safety of the {@code Map} returned. * * @param <A> the intermediate accumulation type of the downstream collector * @param <D> the result type of the downstream reduction * @param predicate a predicate used for classifying input elements * @param downstream an {@code IntCollector} implementing the downstream * reduction * @return an {@code IntCollector} implementing the cascaded partitioning * operation */ static <A, D> IntCollector<?, Map<Boolean, D>> partitioningBy(IntPredicate predicate, IntCollector<A, D> downstream) { ObjIntConsumer<A> downstreamAccumulator = downstream.intAccumulator(); ObjIntConsumer<BooleanMap<A>> accumulator = (result, t) -> downstreamAccumulator.accept( predicate.test(t) ? result.trueValue : result.falseValue, t); return BooleanMap.partialCollector(downstream).asInt(accumulator); }