title: Time Complexity of std::multimap::equal_range
body: <p>Good afternoon, I am wondering what the time complexity of <code>std::multimap::equal_range</code> is? Is it Big-O(n) or BIG-0(log n). I remember reading that the time complexity of <code>std::multimap::erase</code> "is logarithmic plus linear time for the length of the sequence being removed." &lt;<a href="http://frank.mtsu.edu/~csjudy/STL/Multimap.html" rel="noreferrer">http://frank.mtsu.edu/~csjudy/STL/Multimap.html</a>></p>