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.

Note

This API is for internal purposes only and might change in incompatible ways in the next release.

Inheritance

object

Sorter

InPlaceMergeSorter

Inherited Members

Sorter.Compare(int, int)

Sorter.Swap(int, int)

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Namespace: Lucene.Net.Util

Assembly: Lucene.Net.dll

Syntax

public abstract class InPlaceMergeSorter : Sorter

Constructors

InPlaceMergeSorter()

Create a new InPlaceMergeSorter

Declaration

protected InPlaceMergeSorter()

Methods

Sort(int, int)

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
int	from
int	to

Overrides

Sorter.Sort(int, int)