Class BooleanComparators
java.lang.Object
com.github.tommyettinger.ds.support.sort.BooleanComparators
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 (false then true)protected static classprotected static classA type-specific comparator mimicking the opposite of the natural order (the opposite being true then false). -
Field Summary
Fields -
Method Summary
Modifier and TypeMethodDescriptionstatic BooleanComparatorasBooleanComparator(Comparator<? super Boolean> c) Returns a type-specific comparator that is equivalent to the given comparator.static BooleanComparatorReturns a comparator representing the opposite order of the given comparator.static voidsort(boolean[] items, int from, int to, BooleanComparator c) Sorts the specified range of elements according to the order induced by the specified comparator using mergesort.static voidsort(boolean[] items, BooleanComparator c) Sorts all ofitemsby simply callingsort(boolean[], int, int, BooleanComparator), 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.
-
asBooleanComparator
Returns a type-specific comparator that is equivalent to the given comparator.- Parameters:
c- a Comparator of Boolean values.- Returns:
- a type-specific comparator representing the order of
c.
-
sort
Sorts all ofitemsby simply callingsort(boolean[], int, int, BooleanComparator), settingfromandtoso the whole array is sorted.- Parameters:
items- the boolean array to be sortedc- a BooleanComparator 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 useNATURAL_COMPARATORas its c.- Parameters:
items- the boolean 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 BooleanComparator to alter the sort order; if null, the natural order will be used
-