Testing replacement std::sort

[chris jefferson]

I would be very thankful to anyone who could run the attached program 
and return to me along with the flags used and it's output.

I've already got output for Pentium II, III, Athlon XP and the G4. A 
64-bit processor would be particularily interesting,  anything which 
libstdc++ is run on is useful. Feel free to compile it with processor 
specific flags.

Note that this is only designed to check algorithmic changes, and 
doesn't actually contain any move symantics / rvalue reference, so a) it 
should run on any version of libstdc++ and b) don't expect any great 
speed improvements!

It should take about 20 minutes to run, you can change the amount of 
time it does each test for by changing the "minimum_time_check" on the 
4th line (it's in seconds) if your system has a poor resolution clock (I 
just use clock()), or you want to run it for more/less time.

Chris

PS I take no responsibility for any physical or mental problems caused 
by any attempt to read this code.
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: sorttest.cc
URL: <http://gcc.gnu.org/pipermail/libstdc++/attachments/20050519/940f9c35/attachment.cc>