paweld/fpc
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/fpc/source.git synced 2025-08-14 20:49:22 +02:00
Code Issues Packages Projects Releases Wiki Activity

* the Compare parameter renamed Comparer for consistency

Browse Source 
git-svn-id: trunk@41174 -
This commit is contained in:
nickysn 2019-02-02 21:08:30 +00:00
parent 8cf5779297
commit 7f44f2535e
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
rtl/inc/sortbase.pp
View File

@ -50,7 +50,7 @@ var
implementation implementation
Procedure QuickSort_PtrList_NoContext(ItemPtrs: PPointer; L, R : Longint; Procedure QuickSort_PtrList_NoContext(ItemPtrs: PPointer; L, R : Longint;
Compare: TListSortComparer_NoContext); Comparer: TListSortComparer_NoContext);
var var
I, J : Longint; I, J : Longint;
P, Q : Pointer; P, Q : Pointer;
@ -60,9 +60,9 @@ begin
J := R; J := R;
P := ItemPtrs[ (L + R) div 2 ]; P := ItemPtrs[ (L + R) div 2 ];
repeat repeat
while Compare(P, ItemPtrs[i]) > 0 do while Comparer(P, ItemPtrs[i]) > 0 do
I := I + 1; I := I + 1;
while Compare(P, ItemPtrs[J]) < 0 do while Comparer(P, ItemPtrs[J]) < 0 do
J := J - 1; J := J - 1;
If I <= J then If I <= J then
begin begin
@ -79,13 +79,13 @@ begin
if J - L < R - I then if J - L < R - I then
begin begin
if L < J then if L < J then
QuickSort_PtrList_NoContext(ItemPtrs, L, J, Compare); QuickSort_PtrList_NoContext(ItemPtrs, L, J, Comparer);
L := I; L := I;
end end
else else
begin begin
if I < R then if I < R then
QuickSort_PtrList_NoContext(ItemPtrs, I, R, Compare); QuickSort_PtrList_NoContext(ItemPtrs, I, R, Comparer);
R := J; R := J;
end; end;
until L >= R; until L >= R;