Class InPlaceMergeSorter

Sorter implementation based on the merge-sort algorithm that merges in place (no extra memory will be allocated). Small arrays are sorted with insertion sort.

This is a Lucene.NET INTERNAL API, use at your own risk
Inheritance
System.Object
Sorter
InPlaceMergeSorter
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: Lucene.Net.Util
Assembly: Lucene.Net.dll
Syntax
public abstract class InPlaceMergeSorter : Sorter

Constructors

| Improve this Doc View Source

InPlaceMergeSorter()

Create a new InPlaceMergeSorter

Declaration
public InPlaceMergeSorter()

Methods

| Improve this Doc View Source

Sort(Int32, Int32)

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

Declaration
public override sealed void Sort(int from, int to)
Parameters
Type Name Description
System.Int32 from
System.Int32 to
Overrides