Word's one data structure
summary
Flat arrays map character offsets to attached objects using C-style positions[] and data[] arrays; instead of touching every entry on insert the structure records an adjustment point (index and delta) so updates cost O(distance from last edit) and lookups remain O(log n). While typing the last binary-search result is cached as a search hint, making common-case edits effectively constant time. This exact scheme underlies many Word features and is proven practical in production.
AI-written summary · about
chapters (5)
related talks
04mThe Slot Map Data Structure
30m“Esoteric Data Structures and Where to Find Them”
40mImmutable Data Structures in C++
57mCache friendly data + functional + ranges = ❤️
39mC++ Multi-dimensional Arrays...
36mThe Holy Grail - A Hash Array Mapped Trie for C++
01h 17mWhat Do You Mean by "Cache Friendly"?
51mThe Holy Grail! A Hash Array Mapped Trie for C++
