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.
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 SourceInPlaceMergeSorter()
Create a new InPlaceMergeSorter
Declaration
protected InPlaceMergeSorter()
Methods
| Improve this Doc View SourceSort(Int32, Int32)
Sort the slice which starts at from
(inclusive) and ends at
to
(exclusive).
Declaration
public sealed override void Sort(int from, int to)
Parameters
Type | Name | Description |
---|---|---|
System.Int32 | from | |
System.Int32 | to |