org.apache.hadoop.util

类 QuickSort

java.lang.Object

org.apache.hadoop.util.QuickSort

所有已实现的接口:

IndexedSorter

public final class QuickSort
extends Object
implements IndexedSorter

An implementation of the core algorithm of QuickSort.

构造器概要

构造器

构造器和说明
QuickSort()

方法概要

方法

限定符和类型	方法和说明
protected static int	getMaxDepth(int x) Deepest recursion before giving up and doing a heapsort.
void	sort(IndexedSortable s, int p, int r) Sort the given range of items using quick sort.
void	sort(IndexedSortable s, int p, int r, Progressable rep) Same as IndexedSorter.sort(IndexedSortable,int,int), but indicate progress periodically.

从类继承的方法 java.lang.Object

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

构造器详细资料

QuickSort

public QuickSort()

方法详细资料

getMaxDepth

protected static int getMaxDepth(int x)

Deepest recursion before giving up and doing a heapsort. Returns 2 * ceil(log(n)).

sort

public void sort(IndexedSortable s,
        int p,
        int r)

Sort the given range of items using quick sort. Sort the items accessed through the given IndexedSortable over the given range of logical indices. From the perspective of the sort algorithm, each index between l (inclusive) and r (exclusive) is an addressable entry. If the recursion depth falls below getMaxDepth(int), then switch to HeapSort.

指定者:

sort 在接口中 IndexedSorter

另请参阅:

IndexedSortable.compare(int, int), IndexedSortable.swap(int, int)

sort

public void sort(IndexedSortable s,
        int p,
        int r,
        Progressable rep)

Same as IndexedSorter.sort(IndexedSortable,int,int), but indicate progress periodically.

指定者:

sort 在接口中 IndexedSorter

另请参阅:

IndexedSorter.sort(IndexedSortable,int,int)