Talk:cpp/container/multimap/find

Is this claim correct?

"If there are several elements with key in the container, the one inserted earlier is selected. "

I cannot find anything in the C++11 standatd to back it up.

Juanchopanza (talk) 03:32, 14 January 2014 (PST)

you're right, it doesn't require that: even though insert/erase/emplace are order-preserving, lower_bound is what picks the first element --Cubbi (talk) 04:05, 14 January 2014 (PST)