From: Gennadiy Rozental (gennadiy.rozental_at_[hidden])
Date: 2007-03-17 13:42:59
"Michael Fawcett" <michael.fawcett_at_[hidden]> wrote in message
> On 3/16/07, Gennadiy Rozental <gennadiy.rozental_at_[hidden]> 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?
Boost list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk