hashmap-without-collision.js

"use strict";
class HashMapNoCollision {
    constructor(size = 10) {
        this.size = size;
        this.buckets = new Array(this.size).fill(null);
    }
    hash(key) {
        const strKey = String(key);
        let hash = 0;
        for (let i = 0; i < strKey.length; i++) {
            hash = (hash + strKey.charCodeAt(i) * i) % this.size;
        }
        return hash;
    }
    set(key, value) {
        const index = this.hash(key);
        this.buckets[index] = [key, value]; // No collision handling — overwrite if necessary
    }
    get(key) {
        const index = this.hash(key);
        const entry = this.buckets[index];
        if (entry && entry[0] === key) {
            return entry[1];
        }
        return null;
    }
    remove(key) {
        const index = this.hash(key);
        const entry = this.buckets[index];
        if (entry && entry[0] === key) {
            this.buckets[index] = null;
        }
    }
}
const map = new HashMapNoCollision(10);
map.set("apple", 100);
console.log(map.get("apple")); // 100
map.set("banana", 200);
console.log(map.get("banana")); // 200
// Now try a key that collides with "apple"
map.set("papel", 600); // Might hash to the same index
console.log(map.get("apple")); // Could return null if it got overwritten