Groups > comp.programming.threads > #1074

Re: Parallel bucketsort have been updated to version 1.03

Path	csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail
From	"aminer" <aminer@videotron.ca>
Newsgroups	comp.programming.threads, comp.programming
Subject	Re: Parallel bucketsort have been updated to version 1.03
Date	Sat, 15 Sep 2012 21:43:21 -0500
Organization	A noiseless patient Spider
Lines	68
Message-ID	<k33aru$l2g$1@dont-email.me> (permalink)
References	<k32t9n$c5g$1@dont-email.me>
Injection-Date	Sun, 16 Sep 2012 01:43:26 +0000 (UTC)
Injection-Info	mx04.eternal-september.org; posting-host="c43ca82f9e8d62a602307fe9d2e9b807"; logging-data="21584"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/l3jJ87ZXfka4uBwJKyYpK"
X-MimeOLE	Produced By Microsoft MimeOLE V6.00.2900.5512
X-RFC2646	Format=Flowed; Response
X-Newsreader	Microsoft Outlook Express 6.00.2900.5512
Cancel-Lock	sha1:C/MBPnKY7I8Pgp22Yt9NRY51/pU=
X-Priority	3
X-MSMail-Priority	Normal
Xref	csiph.com comp.programming.threads:1074 comp.programming:2221

Cross-posted to 2 groups.

Show key headers only | View raw

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.
"aminer" <aminer@videotron.ca> wrote in message 
news:k32t9n$c5g$1@dont-email.me...
>
> 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.
>
>
>

Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar

Thread

Parallel bucketsort have been updated to version 1.03 "aminer" <aminer@videotron.ca> - 2012-09-15 17:51 -0500
  Re: Parallel bucketsort have been updated to version 1.03 "aminer" <aminer@videotron.ca> - 2012-09-15 21:43 -0500

csiph-web