| Interface | Description |
|---|---|
| InputSampler.Sampler<K,V> |
Interface to sample using an
InputFormat. |
| Class | Description |
|---|---|
| BinaryPartitioner<V> |
Partition
BinaryComparable keys using a configurable part of
the bytes array returned by BinaryComparable.getBytes(). |
| HashPartitioner<K,V> |
Partition keys by their
Object.hashCode(). |
| InputSampler<K,V> |
Utility for collecting samples and writing a partition file for
TotalOrderPartitioner. |
| InputSampler.IntervalSampler<K,V> |
Sample from s splits at regular intervals.
|
| InputSampler.RandomSampler<K,V> |
Sample from random points in the input.
|
| InputSampler.SplitSampler<K,V> |
Samples the first n records from s splits.
|
| KeyFieldBasedComparator<K,V> |
This comparator implementation provides a subset of the features provided
by the Unix/GNU Sort.
|
| KeyFieldBasedPartitioner<K2,V2> |
Defines a way to partition keys based on certain key fields (also see
KeyFieldBasedComparator. |
| RehashPartitioner<K,V> |
This partitioner rehashes values returned by
Object.hashCode()
to get smoother distribution between partitions which may improve
reduce reduce time in some cases and should harm things in no cases. |
| TotalOrderPartitioner<K,V> |
Partitioner effecting a total order by reading split points from
an externally generated source.
|
Copyright © 2008–2022 Apache Software Foundation. All rights reserved.