29 Dec
2008
29 Dec
'08
3:03 p.m.
on Mon Dec 29 2008, Arno Schödl <aschoedl-AT-think-cell.com> wrote:
OK, but for which iterator can we implement an optimized partition_point that works for arbitrary predicates? I thought the point of "specializing" partition_point was to be able to do something smart with iterators over sorted values (e.g. something like std::set iterators)
partition_point performance improves from O(N) to O(log N) for
- Boost.MultiIndex ordered index iterators (by exploiting the red-black tree),
OK, I see it now. Sorry for being dense. The predicate is required to partition the range, so it can work. -- Dave Abrahams BoostPro Computing http://www.boostpro.com