How to find where an element will be inserted into a std::map without actually inserting it
Question
有没有一种方法可以轻松地找到将元素插入到std::map的迭代器，而无需实际插入元素？
1 answers
solution1
4 ACCPTED 2012-02-14 07:23:20
The best you can do is use:
std::map::upper_bound() or
std::map::lower_bound()
to get the iterator positions where key is greater than or greater than or equal to a specific key value.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
Inserting into a std::map and manipulating the obtained iterator to the inserted element
How do I access (check) the element of a std::unordered_map without inserting into it?
How does std::map find an element by string?
How to find an element in a specified range in std::map?
How to find whether an element exists in std::map?
discover when the element is inserted to the std::map
Where will a new element be inserted in a std::set?
How std::find_last_of actually works?
inserting std::strings in to a std::map
std::map.find() stopping at first element?
Related Tags