Package org.apache.lucene.util

Class IntroSorter

java.lang.Object

org.apache.lucene.util.Sorter

org.apache.lucene.util.IntroSorter

public abstract class IntroSorter
extends Sorter

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. This prevents quicksort from running into its worst-case quadratic runtime. Small arrays are sorted with insertion sort.

Constructor Summary

Constructors

Constructor	Description
IntroSorter()	Create a new IntroSorter.

Method Summary

Modifier and Type	Method	Description
void	sort(int from, int to)	Sort the slice which starts at from (inclusive) and ends at to (exclusive).

Methods inherited from class java.lang.Object

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

Constructor Detail

IntroSorter

public IntroSorter()

Create a new IntroSorter.

Method Detail

sort

public final void sort(int from,
                       int to)

Description copied from class: Sorter

Sort the slice which starts at from (inclusive) and ends at to (exclusive).

Specified by:

sort in class Sorter