std::map::lower_bound 有一个范围

Question

How can I get a lower_bound in a slice of a std::map between two iterators (similar to std::lower_bound ) with logarithmic complexity (similar to std::map::lower_bound )?

Answer 1

You can't do that. std::map interface is not appropriate. The solution is to use a flat data structure. This can be a simple sorted std::vector or, more conveniently, boost::container::flat_map . Then, use std::lower_bound as usual.