31:T73e,class HashTable { constructor(size = 0, lambda_min = 0.5, lambda_max = 0.75, size_min = 4) { this.table = new Array(Math.max(size, size_min)); this.n = 0; this.h = makeHash(this.m); Object.assign(this, { lambda_min, lambda_max, size_min }); } get m() { return this.table.length; } get lambda() { return this.n / this.m; } find(key) { let i = this.h(key); let cell = this.table[i]; while (cell && cell.key != key) cell = cell.next; if (cell) return cell.value; return null; } insert(key, value) { let i = this.h(key); let cell = this.table[i]; while (cell && cell.key != key) cell = cell.next; if (cell) throw `${key} already in table`; this.n++; this.table[i] = { key, value, next: this.table[i] }; if (this.lambda > this.lambda_max) this.rehash(); } delete(key) { let i = this.h(key); let cell = this.table[i]; let prev = null; while (cell && cell.key != key) { prev = cell; cell = cell.next; } if (!cell) throw `${key} not in table`; this.n--; if (prev) { prev.next = cell.next; } else { if (cell) this.table[i] = cell.next; else this.table[i] = undefined; } if (this.lambda < this.lambda_min) this.rehash(); } *cells() { for (let cell of this.table) { while (cell) { yield cell; cell = cell.next; } } } rehash() { const lambda_0 = (this.lambda_max + this.lambda_min) / 2; const newSize = Math.max(this.size_min, Math.round(this.n / lambda_0)); if (newSize == this.m) return; const newTable = new HashTable( newSize, this.lambda_min, this.lambda_max, this.size_min ); for (let cell of this.cells()) { newTable.insert(cell.key, cell.value); } Object.assign(this, newTable); } }32:T453,function showtable(ht) { const table = ht.table, m = ht.m; const getRow = (row) => { const result = []; for (let i = 0; i < m; i++) { let cell = table[i]; for (let j = 0; j < row; j++) { if (cell) cell = cell.next; else break; } if (cell) result[i] = `${cell.key}`; } return result; }; let row = 0; let gv = ``; gv += ``; for (let i = 0; i < m; i++) { gv += `${i}`; } gv += ``; do { let cells = getRow(row); if (cells.length == 0) break; let tds = ""; for (let i = 0; i < m; i++) { let cell = cells[i]; if (cell) tds += `${cell}`; else if (row == 0) tds += `-`; else tds += ``; } gv += `` + tds + `\n`; row++; } while (row < 10); return `\n${gv}

`; }33:[] 2f:{"title":"Hash table with separate chaining","cells":[{"id":0,"value":"# Hash table with separate chaining","pinned":false,"hidden":false,"mode":"md"},{"id":102,"value":"viewof reset = Inputs.button(\"reset\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":14,"value":"demo = {\n reset;\n let ht = new HashTable();\n let result = htl.html`

`;\n let inserted = [];\n for (let i = 0; i < 8; i++) {\n const k = 1 + Math.floor(random() * 100);\n if (!ht.find(k)) {\n result.append(md`**Inserting ${k}**`);\n ht.insert(k, k);\n inserted.push(k);\n result.append(html`${showtable(ht)}`);\n }\n }\n d3.shuffle(inserted);\n for (let k of inserted.slice(1)) {\n result.append(md`**Removing ${k}**`);\n ht.delete(k);\n result.append(html`${showtable(ht)}`);\n }\n return result;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":114,"value":"
\n## Implementation","pinned":false,"hidden":false,"mode":"md"},{"id":7,"value":"largePrimes = [\n 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109,\n 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221,\n 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341,\n 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437,\n 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547,\n 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679,\n 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791,\n 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901,\n 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973\n]","pinned":false,"hidden":false,"mode":"ojs"},{"id":72,"value":"random = d3.randomLcg(1)","pinned":true,"hidden":false,"mode":"ojs"},{"id":10,"value":"function makeHash(m) {\n if (m > largePrimes[0]) throw \"Table too large\";\n const p = largePrimes[Math.floor(random() * largePrimes.length)];\n const a = 1 + Math.floor(random() * (p - 1));\n const b = Math.floor(random() * p);\n return (x) => ((a * x + b) % p) % m;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":5,"value":"$31","pinned":true,"hidden":false,"mode":"ojs"},{"id":18,"value":"$32","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W33","stdlib":"1","titling":"auto"}