simple hash table

hashtable.js

// Implement hash table

let hash = (string, max) => {
    let hash = 0;
    for (let i = 0; i< string.length; i++) {
        hash += string.charCodeAt(i);
    }
    return hash % max;
}

let HashTable = function() {
    let storage = [];
    const storageLimit = 4;

    this.add = function(key, value) {
        let index = hash(key, storageLimit);
        if (storage[index] === undefined) {
            storage[index] = [
                [key, value]
            ];
        } else {
            let inserted = false;
            for (const element of storage[index]) {
                if (element[0] === key) {
                    element[1] = value;
                    inserted = true;
                }
            }
            if (inserted === false) {
                storage[index].push([key, value]);
            }
        }
    }

    this.remove = function(key) {
        let index = hash(key, storageLimit);
        if (storage[index].length === 1 && storage[index][0][0] === key) {
            delete storage[index][i];
        } else {
            for (let i =0; i < storage[index]; i++) {
                if (storage[index][i][0] === key) {
                    delete storage[index][i];
                }
            }
        }
    }
    
    this.lookup = function(key) {
        let index = hash(key, storageLimit);
        if (storage[index] === indefined) {
            return undefined;
        } else {
            for ( i=0; i < storage[index].length; i++) {
                if (storage[index][i][0] === key) {
                    return storage[index][1];
                }
            }
        }
    } 
}