Tag
hash-tables
- Feb 20, 2026 The Dictionary Object Model and the Cost of a Name Lookup How a dynamically typed object resolves a property name through a per-object table, what a single access costs in instructions and bytes, and which conditions must hold before the lookup can become a fixed offset. language runtimes
- Jan 7, 2026 Separate Chaining and the Load-Factor Threshold How a bucket array with per-bucket lists produces expected constant-time lookup, what the load factor controls, and why chained tables keep working above a load of one. data structures
- Mar 4, 2025 Symbol Table Layouts and the Cost of Leaving a Scope Why a compiler symbol table is not just a hash map, how scope exit is made cheap, and what the per-scope-frame and shadow-stack designs each cost in lookup and memory. compilers
- Dec 6, 2023 Random Hyperplane LSH and the Arithmetic of Banding How one random plane per bit turns cosine similarity into collision probability, and how band and row counts convert that probability into a practical recall curve with a sharp threshold. information retrieval
- Oct 12, 2023 Symbol Versioning and the Two Hash Tables Behind Every Lookup How a symbol name acquires a version suffix at runtime, what SysV and GNU hash tables each optimise for, and why a lookup that succeeds on one distribution can fail on another. systems programming