This is an implementation of a primitive hashmap in python with operations such as
set(key, value): This stores the value in the hashmap with key by generation an index according to the key.get(key): This returns the value associated with the key.delete(key): Deletes the value associated with the keyload(): Returns the load factor of the hash map given by (items in hashmap / total size of hashmap)