TFPList.Sort procedure
Sorts the pointers in the list.
Declaration
procedure Sort(Compare: TListSortCompare)
procedure Sort(Compare: TListSortCompare;
SortingAlgorithm: PSortingAlgorithm)
procedure Sort(Compare: TListSortComparer_Context; Context: Pointer)
procedure Sort(Compare: TListSortComparer_Context; Context: Pointer;
SortingAlgorithm: PSortingAlgorithm)Description
Sort> sorts the pointers in the list. Two pointers are compared
by passing them to the
Compare function. The result of this
function determines how the pointers will be sorted:
- If the result of this function is negative, the first pointer is assumed to be 'less' than the second and will be moved before the second in the list.
- If the function result is positive, the first pointer is assumed to be 'greater than' the second and will be moved after the second in the list.
- if the function result is zero, the pointers are assumed to be 'equal' and no moving will take place.
The sort is done using a quicksort algorithm.
An experiment, built from development snapshots. Not the official Free Pascal or Lazarus documentation.
