title: Fastest C++ map?
body: <p>Correct me I'm wrong but std::map is an ordered map, thus each time I insert a value the map uses an algorithm to sort its items internally, which takes some time.</p>
  
  <p>My application gets information regarding some items on a constant interval.</p>
  
  <p>This app keeps a map which is defined like this:</p>
  
  <pre><code>::std::map&lt;DWORD, myItem*&gt;
  </code></pre>
  
  <p>At first all items are considered "new" to the app. An "Item" object is being allocated and added to this map, associating its id and a pointer to it.</p>
  
  <p>When it's not a "new" item (just an update of this object) my app should find the object at the map, using the given id, and update.</p>
  
  <p>Most of the times I get updates.</p>
  
  <p>My question is:<br>
  Is there any faster map implementation or should I keep using this one?<br>
  Am I better use unordered_map?</p>