| Class TM3Array (unit BuffSort) |
TObject
TM3Array class
| Constructors |
| Functions |
function Add(Item: Pointer): Integer;
procedure Clear;
destructor Destroy;
function Last: Pointer;
procedure MergeSort(SorCompare: TMergeCompare);
function Get(Index: Integer): Pointer;
procedure Merge(SorCompare: TMergeCompare);
procedure Put(Index: Integer; Item: Pointer);
procedure Expand;
procedure SetCapacity(NewCapacity:Integer);| Properties |
property Capacity : Integer
property Count : Integer
property Items : Pointer
property M3Array : PMergeArray| Events |
| Variables |
fCapacity : Integer;
FCount : Integer;
FLeftArray : TSub3Array;
FM3Array : PMergeArray;
FMidArray : TSub3Array;
FRightArray : TSub3Array;
SwapArray : PMergeArray;
TempArray : PMergeArray;| Constructors |
| Functions |
function Add(Item: Pointer): Integer;
procedure Clear;
destructor Destroy;Destroy } { TM3Array
function Last: Pointer;
procedure MergeSort(SorCompare: TMergeCompare);Merge } {Non-recursive Mergesort. Very fast, if enough memory available. The number of comparisions used is nearly optimal, about 3/4 of QuickSort. If comparision plays a very more important role than exchangement, it outperforms QuickSort in any case. ( Large keys in pointer arrays, for example text with few short lines. ) From all Algoritms with O(N lg N) it's the only stable, meaning it lefts equal keys in the order of input. This may be important in some cases.
function Get(Index: Integer): Pointer;
procedure Merge(SorCompare: TMergeCompare);This is a three way merge routine. Unfortunately the " Merge " routine needs additional memory An Algorithm to perform merging in linear time without extra space is described in: B. Huang and M. Langston, " Practical In-place Merging ", Communications of the ACM 31(1988), 348-352.
procedure Put(Index: Integer; Item: Pointer);
procedure Expand;
procedure SetCapacity(NewCapacity:Integer);| Properties |
property Capacity : Integer
property Count : Integer
property Items : Pointer
property M3Array : PMergeArray| Events |
| Variables |
fCapacity : Integer;
FCount : Integer;
FLeftArray : TSub3Array;
FM3Array : PMergeArray;
FMidArray : TSub3Array;
FRightArray : TSub3Array;
SwapArray : PMergeArray;
TempArray : PMergeArray;