Uses of Class
org.apache.lucene.util.Sorter

Packages that use Sorter

Package	Description
org.apache.lucene.util	Some utility classes.

Uses of Sorter in org.apache.lucene.util

Subclasses of Sorter in org.apache.lucene.util

Modifier and Type	Class	Description
class	InPlaceMergeSorter	Sorter implementation based on the merge-sort algorithm that merges in place (no extra memory will be allocated).
class	IntroSorter	Sorter implementation based on a variant of the quicksort algorithm called introsort: when the recursion level exceeds the log of the length of the array to sort, it falls back to heapsort.
class	MSBRadixSorter	Radix sorter for variable-length strings.
class	StableMSBRadixSorter	Stable radix sorter for variable-length strings.
protected static class	StableMSBRadixSorter.MergeSorter	A MergeSorter taking advantage of temporary storage.
class	StringSorter	A BytesRef sorter tries to use a efficient radix sorter if StringSorter.cmp is a BytesRefComparator, otherwise fallback to StringSorter.fallbackSorter(java.util.Comparator<org.apache.lucene.util.BytesRef>)
protected class	StringSorter.MSBStringRadixSorter	A radix sorter for BytesRef
class	TimSorter	Sorter implementation based on the TimSort algorithm.

Methods in org.apache.lucene.util that return Sorter

Modifier and Type	Method	Description
protected Sorter	StringSorter.fallbackSorter(Comparator<BytesRef> cmp)
protected Sorter	MSBRadixSorter.getFallbackSorter(int k)	Get a fall-back sorter which may assume that the first k bytes of all compared strings are equal.
protected Sorter	StableMSBRadixSorter.getFallbackSorter(int k)
protected Sorter	StringSorter.MSBStringRadixSorter.getFallbackSorter(int k)
protected Sorter	StringSorter.radixSorter(BytesRefComparator cmp)