2/18/2026 at 10:15:41 PM
Nice I guess. I've sometimes thought of doing something similar with a red-black or AVL tree index. So every update writes O(log n) index nodes to the file, but you can do any lookup in O(log n) operations.by throwaway81523
2/18/2026 at 3:18:42 PM
by StingyJelly
2/18/2026 at 10:15:41 PM
Nice I guess. I've sometimes thought of doing something similar with a red-black or AVL tree index. So every update writes O(log n) index nodes to the file, but you can do any lookup in O(log n) operations.by throwaway81523