Subject: Re: [boost] Interest in a "breadth first" algorithm?
From: Gary Powell (gwpowell_at_[hidden])
Date: 2012-06-19 11:29:55
Maybe a an obvious question, but is this speedup relative to the positional
insertion overload of std::map?
> iterator insert ( iterator position, const value_type& x );
> Hits self on head... no. It was relative to map::operator()
Just testing operator vs iterator insert(...) is about 68% faster to use
breadthfirst ordering vs insert() is about 48% using insert.
I think I didn't use insert because of folklore that it didn't help, and
clearly that was wrong and should have been tested.
Well all the time spent was not totally lost as I figured out how to use
meta programming to turn on and off member functions in a templated
class... use inheritence. But that's another story.
-- ------------------ powellg_at_[hidden] "Come gather 'round people wherever you roam. And admit that the waters around you have grown. And accept it that soon you'll be drenched to the bone. If your time to you is worth savin'. Ahh you better start swimmin' or you'll sink like a stone. For the times they are a-changin'" Bob Dylan
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk