#data-structures
Wiki 11
- Behavior Tree Hierarchical decision-making: tick-based nodes for game AI, robotics, and task automation
- Bytecode-to-source mapping Four line-table designs for a bytecode VM, and what the JVM and Lua actually do instead
- Fast Levenshtein Distance Using a Trie How to find dictionary words within N edits of a query 300× faster by sharing Levenshtein table rows across trie prefixes
- Golang maps after Swiss Tables What Golang 1.24 replaced the bucket map with, and why 30% in microbenchmarks is 1.5% in production
- Inverted Index Data structure mapping terms to documents, the foundation of all full-text search systems
- LSM Tree Write-optimized storage: append-only MemTable/SSTable design behind Cassandra, RocksDB, LevelDB
- LSM Trees and NoSQL Storage LSM tree architecture; MemTable, WAL, SSTables, Bloom filters, compaction strategies, and failure modes
- Python sets and dicts are not O(1) Lemire builds a Python set that takes quadratic time from colliding integers, then shows a plain dict slowing 9x from cache misses alone
- ScyllaDB's trie-based SSTable index Replacing Summary.db + Index.db with a page-packed prefix tree: up to 3x read throughput
- Skip list Probabilistic ordered structure of stacked linked lists with O(log n) expected search; the standard MemTable choice in LSM engines
- Splay list Skip list that adaptively raises hot keys toward the top, reducing search depth to log(1/p) for high-hit-ratio keys (Aksenov 2020)
Toolbox 1
- skiplist Header-only C macros for a lock-free skip list with optional splay rebalancing of hot keys