title: Mechanism of Java HashMap
body: <ol>
  <li><p>Reading <a href="http://algs4.cs.princeton.edu/home/" rel="nofollow">Algorithms</a> book, need to grasp the concept of a hashtable. They write about hashing with separate chaining and hashing with linear probing. I guess Java's HashMap is a hashtable, therefore I'm wondering what mechanism does HashMap use (chaining or probing)?</p></li>
  <li><p>I need to implement simplest HashMap with get, put, remove. Could you point me at the good material to read that?</p></li>
  <li><p>When the unique keys used for the Map are custom objects, we need to implement hashCode() function inside the corresponding type. Did I get it right or when is hashCode() needed?</p></li>
  </ol>
  
  <p>Unfortunately the book does not answer all questions, even though I understand that for many of you these questions are low level.</p>