{"component":{"type":17,"accent_color":10980315,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/25/2026 · by [skc\\_saturn](https://wikirng.com/u/skc_saturn)"},{"type":10,"content":"## [Linear hashing](https://wikirng.com/roll/r8X9djY722)\n*Dynamic data structure*"},{"type":10,"content":">>> Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980. It has been analyzed by Baeza-Yates and Soza-Pollman."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟪 Remarkable · 214,359 SP\n-# Top 6.5%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🐙 **GitHub** · Obscure · +63,251 SP\n-# Links to GitHub.\n🟦 ⌨️ **Source Code** · Obscure · +61,822 SP\n-# Has a code block.\n🟦 ∑ **Problem Set** · Obscure · +49,655 SP\n-# Has 20+ math formulas.\n🟦 🧮 **Equation** · Obscure · +17,507 SP\n-# Has a math formula.\n🟦 ❔ **Unassessed** · Obscure · +10,641 SP\n-# Tagged by a WikiProject, but not rated.\n🟩 🕶️ **Anonymous** · Notable · +3,123 SP\n-# Created by someone who wasn't logged in.\n-# +14 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/r8X9djY722"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Linear_hashing"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}