test_hash_map.cpp

#include <iostream>
#include <cassert>
#include "hash_map.hpp"

int main() {
    std::cout << "Initializing Low-Latency Hash Map...\n";
    LowLatencyHashMap kv_store(100);

    // 1. Test Insert
    kv_store.insert("AAPL", "150.25");
    kv_store.insert("GOOGL", "2800.10");
    kv_store.insert("MSFT", "300.50");

    std::cout << "Current Size: " << kv_store.get_size() << "\n";

    // 2. Test Get
    std::string price;
    if (kv_store.get("AAPL", price)) {
        std::cout << "Found AAPL: " << price << "\n";
    }

    // 3. Test Update
    kv_store.insert("AAPL", "155.00");
    kv_store.get("AAPL", price);
    std::cout << "Updated AAPL: " << price << "\n";

    // 4. Test Delete
    kv_store.remove("GOOGL");
    if (!kv_store.get("GOOGL", price)) {
        std::cout << "GOOGL successfully deleted.\n";
    }

    // 5. Test Linear Probing (Collision Handling)
    // Even if keys collide, the linear probing will place them in the next available slot
    // and correctly retrieve them.
    kv_store.insert("TSLA", "700.00");
    kv_store.get("TSLA", price);
    std::cout << "Found TSLA: " << price << "\n";

    std::cout << "All basic hash map tests passed!\n";
    return 0;
}