Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #1073
| From | "aminer" <aminer@videotron.ca> |
|---|---|
| Newsgroups | comp.programming.threads, comp.programming |
| Subject | Parallel bucketsort have been updated to version 1.03 |
| Date | 2012-09-15 17:51 -0500 |
| Organization | A noiseless patient Spider |
| Message-ID | <k32t9n$c5g$1@dont-email.me> (permalink) |
Cross-posted to 2 groups.
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 — Next in thread | Find similar
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