|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectcom.carrotsearch.hppc.sorting.IndirectSort
public final class IndirectSort
Sorting routines that return an array of sorted indices implied by a given comparator rather than move elements of whatever the comparator is using for comparisons.
A practical use case for this class is when the index of an array is meaningful and one
wants to acquire the order of values in that array. None of the methods in Java
Collections would provide such functionality directly and creating a collection of
boxed Integer
objects for indices seems to be too costly.
Method Summary | ||
---|---|---|
static int[] |
mergesort(int start,
int length,
IndirectComparator comparator)
Returns the order of elements between indices start and
length , as indicated by the given comparator . |
|
static
|
mergesort(T[] input,
int start,
int length,
java.util.Comparator<? super T> comparator)
Returns the order of elements between indices start and
length , as indicated by the given comparator . |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
---|
public static int[] mergesort(int start, int length, IndirectComparator comparator)
start
and
length
, as indicated by the given comparator
.
This routine uses merge sort. It is guaranteed to be stable.
public static <T> int[] mergesort(T[] input, int start, int length, java.util.Comparator<? super T> comparator)
start
and
length
, as indicated by the given comparator
. This method
is equivalent to calling mergesort(int, int, IndirectComparator)
with
IndirectComparator.DelegatingComparator
.
This routine uses merge sort. It is guaranteed to be stable.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |