|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
EntryKey - type of the original input keyKeyIn - type of the key that is used for reducingValueIn - type of value used as input value type@Beta public interface ReducingSubmittableJob<EntryKey,KeyIn,ValueIn>
This interface describes a submittable mapreduce Job.
For further information Job.
Job| Method Summary | ||
|---|---|---|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> |
chunkSize(int chunkSize)
Defines the number of elements per chunk. |
|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> |
keyPredicate(KeyPredicate<EntryKey> predicate)
Defines the KeyPredicate implementation to preselect keys the MapReduce task
will be executed on. |
|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> |
onKeys(EntryKey... keys)
Defines keys to execute the mapper and a possibly defined reducer against. |
|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> |
onKeys(Iterable<EntryKey> keys)
Defines keys to execute the mapper and a possibly defined reducer against. |
|
JobCompletableFuture<Map<KeyIn,ValueIn>> |
submit()
Submits the task to Hazelcast and executes the defined mapper and reducer on all cluster nodes |
|
|
submit(Collator<Map.Entry<KeyIn,ValueIn>,ValueOut> collator)
Submits the task to Hazelcast and executes the defined mapper and reducer on all cluster nodes and executes the collator before returning the final result. |
|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> |
topologyChangedStrategy(TopologyChangedStrategy topologyChangedStrategy)
Defines the strategy to handle topology changes while executing the map reduce job. |
|
| Method Detail |
|---|
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> onKeys(Iterable<EntryKey> keys)
keys - keys to be executed against
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> onKeys(EntryKey... keys)
keys - keys to be executed against
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> keyPredicate(KeyPredicate<EntryKey> predicate)
KeyPredicate implementation to preselect keys the MapReduce task
will be executed on. Preselecting keys can speed up the job massively.onKeys(Iterable) or onKeys(Object...) to define a
range of known and evaluated keys.
predicate - predicate implementation to be used to evaluate keys
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> chunkSize(int chunkSize)
ReducerFactory is defined the chunk will be send to the nodes that
is responsible for the emitted keys.
chunkSize - the number of elements per chunk
ReducingSubmittableJob<EntryKey,KeyIn,ValueIn> topologyChangedStrategy(TopologyChangedStrategy topologyChangedStrategy)
TopologyChangedStrategy.
topologyChangedStrategy - strategy to use
JobCompletableFuture<Map<KeyIn,ValueIn>> submit()
<ValueOut> JobCompletableFuture<ValueOut> submit(Collator<Map.Entry<KeyIn,ValueIn>,ValueOut> collator)
ValueOut - type of the collated valuecollator - collator to use after map and reduce
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||