Class CharComparators
java.lang.Object
com.github.tommyettinger.ds.support.sort.CharComparators
A class providing static methods and objects that do useful things with
comparators.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionprotected static classA type-specific comparator mimicking the natural order.protected static classprotected static classA type-specific comparator mimicking the opposite of the natural order. -
Field Summary
Fields -
Method Summary
Modifier and TypeMethodDescriptionstatic CharComparatorasCharComparator(Comparator<? super Character> c) Returns a type-specific comparator that is equivalent to the given comparator.static CharComparatorReturns a comparator representing the opposite order of the given comparator.static voidsort(char[] items, int from, int to, CharComparator c) Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.static voidsort(char[] items, CharComparator c) Sorts all ofitemsby simply callingsort(char[], int, int, CharComparator), settingfromandtoso the whole array is sorted.
-
Field Details
-
NATURAL_COMPARATOR
-
OPPOSITE_COMPARATOR
-
-
Method Details
-
oppositeComparator
Returns a comparator representing the opposite order of the given comparator.- Parameters:
c- a comparator.- Returns:
- a comparator representing the opposite order of
c.
-
asCharComparator
Returns a type-specific comparator that is equivalent to the given comparator.- Parameters:
c- a Comparator of Char values.- Returns:
- a type-specific comparator representing the order of
c.
-
sort
Sorts all ofitemsby simply callingsort(char[], int, int, CharComparator), settingfromandtoso the whole array is sorted.- Parameters:
items- the char array to be sortedc- a CharComparator to alter the sort order; if null, the natural order will be used
-
sort
Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.This sort is guaranteed to be stable: equal elements will not be reordered as a result of the sort. The sorting algorithm is an in-place mergesort that is significantly slower than a standard mergesort, as its running time is O(n (log n)2), but it does not allocate additional memory; as a result, it can be used as a generic sorting algorithm.
If and only if
cis null, this will delegate toArrays.sort(char[], int, int), which does not have the same guarantees regarding allocation.- Parameters:
items- the char array to be sortedfrom- the index of the first element (inclusive) to be sorted.to- the index of the last element (exclusive) to be sorted.c- a CharComparator to alter the sort order; if null, the natural order will be used
-