title: Does std::map::find performance depend on the key size?
body: <p>Say I have the the following <code>map</code> definition:</p>
  <pre><code>std::map&lt;string,Storage&gt;
  </code></pre>
  <p>where the <strong>key</strong> is the string representation of a <code>Storage</code> class instance.<br/>
  My question is, even though it stated that <a href="http://www.cplusplus.com/reference/map/map/find/" rel="noreferrer">map::find</a> <em>complexity
  is logarithmic in size</em>, does the <code>string</code> size has any influence on the performance?</p>
  <p>The reason I have this <code>map</code> is to enable fast access to <code>Storage</code> class instance. However, what if the string representation of <code>Storage</code> classes is very long? Is there a max string size that if exceeded makes the use of <code>map</code> redundant?</p>
  <h3>Notes</h3>
  <p>My intuition tells me that if <em>the string representation of <code>Storage</code> classes is very long</em> then comparing the classes themselves using <code>operator==</code> would be expensive as well. So no matter how long the string is, I'm better of using <code>map</code></p>