2026-03-09 17:44:51 <veltas      > Misstep after misstep, this weekend I started with AA-Trees, ended up moving to Left-Leaning Red-Black trees to save memory
2026-03-09 17:45:36 <veltas      > Now I'm finding out apparently LLRB is just plain slow with the bottom-up 2-3 algorithm, and 2-3-4 top-down is not really much smaller than normal red-black
2026-03-09 17:45:45 <veltas      > Should have just stuck with AA-tree
2026-03-09 17:46:44 <veltas      > Considering B-tree as you can literally implement a filesystem with that too if it's 'generic' enough, and apparently it's faster on modern CPUs with cache / RAM hierarchy
2026-03-09 17:47:15 <veltas      > More code but necessary code ... if you had to pick 'one' datastructure a B tree is probably a good candidate
2026-03-09 17:47:33 <veltas      > Besides trivial pointer/array/linked-lists