|
Boost : |
From: Hervé Brönnimann (hervebronnimann_at_[hidden])
Date: 2007-04-05 20:05:47
I didn't even remember I posted it in the sandbox. Feel free to look
at it and/or pilfer it. It's not in active development any more, and
about 4 years old, so probably doesn't even compile any more. I
thiink I alluded to it in previous posts. There was no attempts to
make it fast by optimizing assembler etc, but I was trying to go the
generic route (templates, temporary buffers, stl sort replacement,
etc.) The one thing I'd like to do about it is to try the multi-key
(radix) quicksort which I did not yet fully understand at the time.
-- Herve On Apr 5, 2007, at 6:14 PM, Sam Schetterer wrote: > Hello. I just looked in sandbox, and saw that there is a project > called > linear_sort, by Herve Bronnimann. Before I continue development on my > current sorting library, I would like to make sure that my library > is not > interfering with linear_sort. > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/ > listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk