Class-Hashmap

This implementation uses a simple hash function that takes the modulus of the hash value with the size of the hashmap to get the index of the bucket where the key-value pair should be stored. It handles collisions by using a linked list to store multiple key-value pairs in the same bucket.

The add method takes a key-value pair and adds it to the hashmap. If the bucket at the index returned by the hash function is empty, it creates a new linked list with the key-value pair. If the bucket is not empty, it checks if the key already exists in the linked list, and updates the value if it does. If the key does not exist in the linked list, it adds the key-value pair to the end of the linked list.

Source: https://apunkagames.cc/