Very basic linear hash table https://twitter.com/SSB4Fairlines/status/942904298534506508

linear_oui_hash_table.js

var ouis = ["oui", "ouip", "ouaip", "yup", "yep", "yes", "ouai", "oua", "ouain"];

function LinearOuiHashTable(size, prime) {
    this.content = [];
    this._prime = prime;
    
    for (var i = 0; i < size; i++)
        this.content.push([]);
	
    this.insert = (oui) => {
        this.content[this._hash(oui)].push(oui);
    };
    
    this._hash = (oui) => {
        var code = oui.split("")
            .map(c => c.charCodeAt(0))
            .reduce((acc, v) => v + acc, 0);
        
	return code % this._prime;
    };
}

// table creation with closest prime smaller than ouis.length for hashing func
var table = new LinearOuiHashTable(ouis.length, 7);
ouis.forEach(table.insert);
console.log(table.content);