I recently put some time into updating my implementation of xinok sort
for D. Major changes include support for random-access ranges and custom
predicates (ab). You can download the new version here:
http://sourceforge.net/projects/xinoksort/files/D%202.0/2011-10-29/xinoksort.d/download
On 10/29/2011 5:53 PM, Timon Gehr wrote:
Looks good =). Thank you. How does this implementation of your algorithm
compare to the the unstable sort that is currently in Phobos,
performance wise?
I posted some benchmarks here. These benchmarks used the specialized
code for arrays. There would
On 10/29/2011 7:19 PM, Vladimir Panteleev wrote:
On Sun, 30 Oct 2011 01:56:23 +0300, Timon Gehr timon.g...@gmx.ch wrote:
You could use catch(Error err) or catch(OutOfMemoryError err) or not
catch the Error at all.
I'll use OutOfMemoryError. If any other error occurs, it's probably best
to
On 10/29/2011 1:13 PM, Xinok wrote:
I recently put some time into updating my implementation of xinok sort
for D. Major changes include support for random-access ranges and custom
predicates (ab). You can download the new version here:
http://sourceforge.net/projects/xinoksort/files/D%202.0
I've released a few updates for my sorting algorithm in the past month.
https://sourceforge.net/projects/xinoksort/
Major changes:
* Added concurrency using taskPool
* Use any callable type as predicate (functions, delegates)
* Unittests
* Documentation
* Minor optimizations
I have a few more
On 11/30/2011 8:45 PM, Andrej Mitrovic wrote:
Add @property to front/back/popFront/popBack/empty/save.
Also popFront/popBack need to be void return type.
Thanks. I was missing @property, the void return type was a mistake.
After fixing some bugs, the code is working but the benchmarks are
On 11/30/2011 8:23 PM, Xinok wrote:
I've released a few updates for my sorting algorithm in the past month.
https://sourceforge.net/projects/xinoksort/
Major changes:
* Added concurrency using taskPool
* Use any callable type as predicate (functions, delegates)
* Unittests
* Documentation
I just wanted to share this. I started a project a few weeks ago
on Github to implement several sorting algorithms in D. In total,
there are 8 modules at the moment, each implementing a sorting
algorithm or combination thereof.
https://github.com/Xinok/XSort
I just finished Timsort today
On Thursday, 12 April 2012 at 05:25:52 UTC, Nathan M. Swan wrote:
On Thursday, 12 April 2012 at 03:04:49 UTC, Xinok wrote:
I just wanted to share this. I started a project a few weeks
ago on Github to implement several sorting algorithms in D. In
total, there are 8 modules at the moment, each
On Wednesday, 2 January 2013 at 20:38:36 UTC, Walter Bright wrote:
Windows has gotten better in this regard, that is true.
But it's still bizarre that, with Thunderbird, you can
export/import the address book, but not the mail database.
A welcome improvement would be to have a button to
On Monday, 1 April 2013 at 21:05:06 UTC, Walter Bright wrote:
I know you are all Bieber fans, so you'll be please to know he
will be doing the Keynote. I happily cede the slot to him.
while(true) write(baby, );
On Sunday, 7 July 2013 at 03:03:03 UTC, Andrei Alexandrescu wrote:
On 4/26/04 6:54 PM, Andrei Alexandrescu wrote:
I was bitching to myself and then together with a friend
(e-meet
[...]) about how hard it is to do metaprogramming in C++. He
mentioned D is much better at it, and we browsed the
On Monday, 11 November 2013 at 13:41:04 UTC, Nordlöw wrote:
I've read somewhere that D supports specialization of functions
to calls where arguments are compile-time constants. Typical
use of this is in matrix power functions (if exponent is 2
`x*x` is often faster than the general case).
I
On Friday, 17 June 2016 at 22:15:47 UTC, ketmar wrote:
i put it under unlicense[1], as some other works of the same
author is using it, and it is basically the same PD.
[1] http://unlicense.org/
Unfortunately, using unlicense is just as problematic as using
public domain:
14 matches
Mail list logo
