title: How does C++ STL unordered_map resolve collisions?
body: <p>How does C++ STL unordered_map resolve collisions?</p>
  
  <p>Looking at the <a href="http://www.cplusplus.com/reference/unordered_map/unordered_map/">http://www.cplusplus.com/reference/unordered_map/unordered_map/</a>, it says "Unique keys
  No two elements in the container can have equivalent keys."</p>
  
  <p>That should mean that the container is indeed resolving collisions. However, that page does not tell me how it is doing it. I know some ways to resolve collisions like using linked lists and/or probing. What I want to know is how the c++ STL unordered_map is resolving it.</p>