Resizing

Our current hashmap has a lot of collisions because we're using a fixed-size underlying list.

To reduce the chances of a collision, we can increase the number of slots in our hashmap. This is called resizing. This will not eliminate all possible collisions, but it will help reduce the chance of one happening.

When resizing, we create a new hashmap with more slots. Then, we re-insert all the key-value pairs from the old hashmap into the new hashmap.

Assignment

1. Complete the current_load method:
   • It returns the number of filled buckets in the hashmap as a ratio of the total number of buckets (In a hashmap, a bucket is simply a slot that stores one or more key-value pairs).
   • If the length of the underlying list is zero, return 1.
   • Otherwise, divide the number of filled buckets by the length of the underlying list and return it.
2. Complete the resize method:
   • If the length of the underlying list is 0, make the length 1 (by just adding a None entry) and return.
   • Get the current load. If it's less than 5%, do nothing, we have plenty of space
   • Otherwise, we need to resize the hashmap.
     • Store the current self.hashmap list in a temporary variable
     • Create a new empty list that's 10x the size of the current one and assign it to self.hashmap.
     • Re-insert all the key-value pairs from the temporary variable into self.hashmap.
3. Update the insert method to call resize before inserting a new key-value pair.