Subject: Re: [boost] Interest in a "breadth first" algorithm?
From: Francisco José Tapia (fjtapia_at_[hidden])
Date: 2012-06-19 12:14:50
Insert a big sorted sequence in a std::set is more faster than insert an
unordered sequence, due to the cache performance. The potencial benefits in
an small sequence disappear when the sequence grows.
In a std::set <uin64_t> , inserting 30.000.000 elements,
sorted elements : 29.98 secs
unordered elements : 53.57 secs
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk