Paraellel bucketsort have been updated to version 1.03

[aminer]

Hello...

I have updated parallel bucketsort to version 1.03 , and
now it's more faster i have changed a little bit the interface,
now you have to pass to the bucketsort method four
parameters: the array,a TSortCompare function and a TSort1
function and a constant ctAscending or ctDescending to sort
in ascending or descending order.

The TSort1 function have changed, now in the TSort1 function
you have to return the first character and the second character
and the length of the string.

Like this:

function func1(Item1:Pointer;var a,b:char):integer;
begin
a:=TStudent(Item1).mystring[1];
if length(TStudent(Item1).mystring)>1
then b:=TStudent(Item1).mystring[2];
result:=length(TStudent(Item1).mystring);
end;


I have designed the interface of TSort1 like that to optimize more
parallelbucketsort.



You can download parallel bucketsort from:


http://pages.videotron.com/aminer/



Thank you,
Amine Moulay Ramdane.

[aminer]

Hello,

I have simplified the TSort1 function in version 1.04
now the interface is easier , you have to return just a
pointer like this:

function func1(Item1:Pointer): pointer;
begin
result:=pointer(TStudent(Item1).mystring) ;
end;


And now version 1.04 is faster, and you can download
parallel bucketsort from:


http://pages.videotron.com/aminer/



Thank you,
Amine Moulay Ramdane.

Post by aminer
Hello...
I have updated parallel bucketsort to version 1.03 , and
now it's more faster i have changed a little bit the interface,
now you have to pass to the bucketsort method four
parameters: the array,a TSortCompare function and a TSort1
function and a constant ctAscending or ctDescending to sort
in ascending or descending order.
The TSort1 function have changed, now in the TSort1 function
you have to return the first character and the second character
and the length of the string.
function func1(Item1:Pointer;var a,b:char):integer;
begin
a:=TStudent(Item1).mystring[1];
if length(TStudent(Item1).mystring)>1
then b:=TStudent(Item1).mystring[2];
result:=length(TStudent(Item1).mystring);
end;
I have designed the interface of TSort1 like that to optimize more
parallelbucketsort.
http://pages.videotron.com/aminer/
Thank you,
Amine Moulay Ramdane.