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

@lucene.internal

Inheritance
System.Object
Sorter
IntroSorter
Inherited Members
Assembly: DistributedLucene.Net.dll
Syntax
public abstract class IntroSorter : Sorter

Constructors

Name Description
IntroSorter()

Create a new IntroSorter.

Methods

Name Description
ComparePivot(Int32)

Compare the pivot with the slot at j, similarly to Compare(i, j) (Compare(Int32, Int32)).
SetPivot(Int32)

Save the value at slot i so that it can later be used as a pivot, see ComparePivot(Int32).
Sort(Int32, Int32)

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

Extension Methods