My recreation of well known fast lookup data structure. Includes common map operations.
This project is a part of vector hierarchy.
Collision resolution performed using open addressing with linear probing.
Hashmap will grow x2 when reaches maximum capacity and will consequently perform rehashing of all elements.