org.apache.crunch.lib.sort

Class TotalOrderPartitioner.BinarySearchNode<K>

java.lang.Object

org.apache.crunch.lib.sort.TotalOrderPartitioner.BinarySearchNode<K>

All Implemented Interfaces:

TotalOrderPartitioner.Node<K>

Enclosing class:

TotalOrderPartitioner<K,V>

public static class TotalOrderPartitioner.BinarySearchNode<K>
extends Object
implements TotalOrderPartitioner.Node<K>

Constructor Summary

Constructors

Constructor and Description
BinarySearchNode(K[] splitPoints, org.apache.hadoop.io.RawComparator<K> comparator)

Method Summary

Modifier and Type	Method and Description
int	findPartition(K key) Locate partition in keyset K, st [Ki..Ki+1) defines a partition, with implicit K0 = -inf, Kn = +inf, and |K| = #partitions - 1.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BinarySearchNode

public BinarySearchNode(K[] splitPoints,
                        org.apache.hadoop.io.RawComparator<K> comparator)

Method Detail

findPartition

public int findPartition(K key)

Description copied from interface: TotalOrderPartitioner.Node

Locate partition in keyset K, st [Ki..Ki+1) defines a partition, with implicit K0 = -inf, Kn = +inf, and |K| = #partitions - 1.

Specified by:

findPartition in interface TotalOrderPartitioner.Node<K>