Package org.apache.lucene.util

Class TimSorter

java.lang.Object

org.apache.lucene.util.Sorter

org.apache.lucene.util.TimSorter

public abstract class TimSorter
extends Sorter

Sorter implementation based on the TimSort algorithm.

This implementation is especially good at sorting partially-sorted arrays and sorts small arrays with binary sort.

NOTE:There are a few differences with the original implementation:

• The extra amount of memory to perform merges is configurable. This allows small merges to be very fast while large merges will be performed in-place (slightly slower). You can make sure that the fast merge routine will always be used by having maxTempSlots equal to half of the length of the slice of data to sort.
• Only the fast merge routine can gallop (the one that doesn't run in-place) and it only gallops on the longest slice.

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

Method Detail

sort

public 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