28 Aug
2010
28 Aug
'10
11:41 p.m.
BoostPro Computing, http://boostpro.com
Sent from coveted but awkward mobile device
--
On Aug 28, 2010, at 3:58 PM, Jeremiah Willcock
There are several container types (such as typical deque implementations, if you have access to their internals) that can have for_each() implemented for them in a way that is faster than using iterators and a generic for_each() function. Is there a way to take advantage of that in Boost.Range, such as by overloading boost::for_each()? Is there some kind of Iterable concept that doesn't require actual iterators or allows them to be slow?
I presume you're familiar with http://lafstern.org/matt/segmented.pdf?