Simple HasMap implementation in C
I made this because I wanted to lean about how this datastructure worked,
and so I can have a reusable HashMap implementation for my future C projects.
$ make
$ ./hashmap
- When a key1 has a collision with another key2 and the colliding key2 gets deleted, when setting key1 it will be put in the slot of key2 and will create a duplicate of key1. It should instead be kept to it's own slow