My attempt at creating fast hashmap class (with a doubly linked list class), offering efficient key-value storage and retrieval.
Uses Closed Addressing with a Doubly-Linked List for collision resolution.
The test contains of 90 Insertion, 90 Lookup and 90 Delete opretations.
The time took to finish those oprerations is measured.
The average time for each operation is calculated and displayed.
Single threaded performance on Ryzen 2600x
If you have any questions, reach out at ante-piskovic@hotmail.com
Licensed under CC BY-NC 4.0