summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTaylan Kammer <taylan.kammer@gmail.com>2026-08-23 16:39:52 +0200
committerTaylan Kammer <taylan.kammer@gmail.com>2026-08-23 16:39:52 +0200
commit8446a7a93e4bc8659619ebf129e54ebfa4e68ea6 (patch)
tree61cef148322aa1e8ac2c92e6462507a893a64d16
parentfa9195392f36d3bea431b7697c8701d9706e79f7 (diff)
Add a correction to last note.
-rw-r--r--notes/260822-release3.md3
1 files changed, 3 insertions, 0 deletions
diff --git a/notes/260822-release3.md b/notes/260822-release3.md
index d140881..a9277d1 100644
--- a/notes/260822-release3.md
+++ b/notes/260822-release3.md
@@ -207,6 +207,9 @@ pointers into words, it's best to order them low to high when using
them to navigate. Otherwise, the trie will quickly become tall and
narrow; pessimal for efficiency.
+*Erratum: The previous paragraph is bogus, since this optimization
+would break the sort order. We must live with tall trees.*
+
Of course, 16-bit pointers are easy. Let's see how we can actually
implement this strategy in Meta Alloc.