Collisions

Here's how Perl handles collisions:

“Chained hashing”

Drawback: Worst-case lookup time is now O(n)

(Absent malice, this worst case is extremely rare.)

(Usually the longest list is only O(log n))