17 Mar
2007
17 Mar
'07
5:42 p.m.
"Michael Fawcett" <michael.fawcett@gmail.com> wrote in message news:bc5bffe80703161407ybbc7c71ja06b0c2230c5602c@mail.gmail.com...
On 3/16/07, Gennadiy Rozental <gennadiy.rozental@thomson.com> wrote:
So? could you give an example of an algorithm? And/or other speific performace advantage example?
Would you care to share with us a source code for your test?
I just constructed a quick test and used VTune and std::clock to sample. Here are my results:
sorting across 1,000,000 random integers (averaged across 5 runs) std::list::sort - 6.87s boost::ilist::sort - 4.45s
number of L2 cache requests (L1 cache misses) std::list - 1,790 boost::ilist - 862
How about std::vector? Gennadiy