Package org.apache.hadoop.mapreduce.lib.partition
package org.apache.hadoop.mapreduce.lib.partition
-
ClassDescriptionPartition
BinaryComparablekeys using a configurable part of the bytes array returned byBinaryComparable.getBytes().HashPartitioner<K,V> Partition keys by theirObject.hashCode().InputSampler<K,V> Utility for collecting samples and writing a partition file forTotalOrderPartitioner.org.apache.hadoop.mapreduce.lib.partition.InputSampler.IntervalSampler<K,V> Sample from s splits at regular intervals.org.apache.hadoop.mapreduce.lib.partition.InputSampler.RandomSampler<K,V> Sample from random points in the input.org.apache.hadoop.mapreduce.lib.partition.InputSampler.Sampler<K,V> Interface to sample using anInputFormat.org.apache.hadoop.mapreduce.lib.partition.InputSampler.SplitSampler<K,V> Samples the first n records from s splits.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 seeKeyFieldBasedComparator.RehashPartitioner<K,V> This partitioner rehashes values returned byObject.hashCode()to get smoother distribution between partitions which may improve reduce reduce time in some cases and should harm things in no cases.Partitioner effecting a total order by reading split points from an externally generated source.