HashMap.cpp

#include "hashmap.hpp"
#include <vector>
using namespace std;

Hashmap::Hashmap(int tableSize) : tableSize(tableSize) {
    table.resize(tableSize, nullptr);
}

int Hashmap::hashFunction(int key) {
    return key % tableSize;
}

void Hashmap::insert(int key, TreeNode* value) {
    int index = hashFunction(key);
    HashNode* newNode = new HashNode(key, value);
    if (!table[index]) {
        table[index] = newNode;
    } else {
        HashNode* current = table[index];
        while (current->next) {
            if (current->key == key) {
                current->value = value; // Update existing key
                delete newNode; // Avoid memory leak
                return;
            }
            current = current->next;
        }
        if (current->key == key) {
            current->value = value; // Update existing key
            delete newNode; // Avoid memory leak
        } else {
            current->next = newNode; // Insert at end of chain
        }
    }
}