 nickysn
|
f5f25f7ae6
* use a more robust QuickSort implementation, that is guaranteed to never loop
|
6 anni fa |
|
nickysn
|
de80621e1e
* use a try..finally block to protect against memory leaks if the comparison
|
6 anni fa |
|
nickysn
|
26486bbaea
+ keep track of the pivot index in all quicksort implementations. No functional changes,
|
6 anni fa |
|
nickysn
|
ea340b9481
* fixed bug in QuickSort_ItemList_CustomItemExchanger_Context and
|
6 anni fa |
|
nickysn
|
c7d8bd9666
+ added a sort algorithm interface that accepts a custom callback function for
|
6 anni fa |
|
nickysn
|
59a75ea429
* use Inc() and Dec() instead of v:=v+1
|
6 anni fa |
|
nickysn
|
4082b8c7fc
+ added and implemented QuickSort_ItemList_Context
|
6 anni fa |
|
nickysn
|
7f44f2535e
* the Compare parameter renamed Comparer for consistency
|
6 anni fa |
|
nickysn
|
8cf5779297
* the first parameter of QuickSort_PtrList_NoContext renamed ItemPtrs for
|
6 anni fa |
|
nickysn
|
a2a0ed53b2
* the type of the ItemCount parameter changed from PtrUInt to SizeUInt
|
6 anni fa |
|
nickysn
|
848890e54b
+ added the TItemListSorter_NoContext and TItemListSorter_Context procedure
|
6 anni fa |
|
nickysn
|
25f6da7066
* added PtrList to the names of the current sort algorithm callback functions and
|
6 anni fa |
|
nickysn
|
248fd313f8
+ introduced unit SortBase, which implements the foundation for pluggable
|
6 anni fa |
