How hashtable handle hash collision?

Question

From Class Hashtable javadoc
"in the case of a "hash collision", a single bucket stores multiple entries,
which must be searched sequentially."
if a single bucket stores mulitple entries of String object, how
could mulitple entries be retreived like this situation?
String s = hasht.get(key)
I tried a small test myself using two identical hascode "BB" and "Aa" and they get stored in 2 different bucket in hashtable but not mulitple entries as stated at the
javadoc. Thank you.

Answer 1

debugger indicatedumm, the hashes are the same so ur right there, you must have read the debugger wrong though
     Entry tab[] = table;
     int hash = key.hashCode();
     int index = (hash & 0x7FFFFFFF) % tab.length;
     for (Entry<K,V> e = tab[index] ; e != null ; e = e.next) {  // right here it is same entry but its like a list inside the bucket
         if ((e.hash == hash) && e.key.equals(key)) {
          V old = e.value;
          e.value = value;
          return old;
// rehashing stuff removed for post...
     // Creates the new entry.
     Entry<K,V> e = tab[index];
     tab[index] = new Entry<K,V>(hash, key, value, e);
     count++;