public final class ParallelMapIterate extends Object
The forEachEtry algorithm employs a batching fork and join approach approach which does not yet allow for specification of a Factory for the blocks or a Combiner for the results. This means that forEachKeyValue can only support pure forking or forking with a shared thread-safe data structure collecting results.
Modifier and Type | Method and Description |
---|---|
static <K,V> void |
forEachKeyValue(Map<K,V> map,
Procedure2<? super K,? super V> procedure2)
A parallel form of forEachKeyValue.
|
static <K,V> void |
forEachKeyValue(Map<K,V> map,
Procedure2<? super K,? super V> procedure,
Executor executor)
A parallel form of forEachKeyValue.
|
static <K,V> void |
forEachKeyValue(Map<K,V> map,
Procedure2<? super K,? super V> procedure,
int minForkSize,
int taskCount)
A parallel form of forEachKeyValue.
|
static <K,V> void |
forEachKeyValue(Map<K,V> map,
Procedure2<? super K,? super V> procedure,
int minForkSize,
int taskCount,
Executor executor)
A parallel form of forEachKeyValue.
|
public static <K,V> void forEachKeyValue(Map<K,V> map, Procedure2<? super K,? super V> procedure2)
public static <K,V> void forEachKeyValue(Map<K,V> map, Procedure2<? super K,? super V> procedure, Executor executor)
public static <K,V> void forEachKeyValue(Map<K,V> map, Procedure2<? super K,? super V> procedure, int minForkSize, int taskCount)
public static <K,V> void forEachKeyValue(Map<K,V> map, Procedure2<? super K,? super V> procedure, int minForkSize, int taskCount, Executor executor)
Copyright © 2004–2016. All rights reserved.