A Hash Table Implementation

This is a Hash Table/Hash Map implementation in Snap

The hash table implementation uses the "seperate chaining" method using linked lists to handle collisions.


Nice. When I learned about hash tables, which was a long time ago, they taught me that the size of the table (number of bins) should be a prime, and especially not a power of 2, because if the size isn't prime you get more collisions in the hash function.