Why do you need a container std: map? What's he going through with his map?
-
Why is there a container map if there hash_map, which is faster? Like std: map better than std:unordered_map'a?
-
There is no " better " or " worse " of the container.
std::map
keeps the data in a key-corrected form, unlikestd::unordered_map
♪ If you need this property, you need it.std::map
♪ If not, enough andstd::unordered_map
♪(as a result of adhesion, for example,
std::map
is a function. http://en.cppreference.com/w/cpp/container/map/lower_bound who's not instd::unordered_map
.