Is there a way to easily find an iterator where an element would be inserted into a std::map, without actually inserting the element?
Is there a way to easily find an iterator where an element would be
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a way to easily find an iterator where an element would be inserted into a std::map, without actually inserting the element?
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.