summaryrefslogtreecommitdiff
path: root/notes/260821-release2.md
diff options
context:
space:
mode:
authorTaylan Kammer <taylan.kammer@gmail.com>2026-08-21 23:38:45 +0200
committerTaylan Kammer <taylan.kammer@gmail.com>2026-08-21 23:38:45 +0200
commit85081a417bec85d8cdf752b8b7c8cf463f4e254f (patch)
tree6585f808d934d68c9090c982c6ba2596d19bfb8d /notes/260821-release2.md
parentf3dbad54698f6117b9ab92401c1b40f820eb2e20 (diff)
Correction to a note.
Diffstat (limited to 'notes/260821-release2.md')
-rw-r--r--notes/260821-release2.md6
1 files changed, 6 insertions, 0 deletions
diff --git a/notes/260821-release2.md b/notes/260821-release2.md
index 5ea4510..7659683 100644
--- a/notes/260821-release2.md
+++ b/notes/260821-release2.md
@@ -87,6 +87,12 @@ case: `N * slot_size`. For N = 1024, and the smallest size class,
which is 128 bytes, that's still... 128 KiB. OK, maybe that's not
very much, but it's the *absolute worst* case.
+(Later addition: Nope, it's even worse, because we may end up having
+to skip lots of indexes, when the array is full, that would have at
+some point revealed that it's one big span. The real worst-case is
+something much worse I think, but it doesn't matter anymore because
+read on...)
+
Another improvement comes to mind, along with a flaw in the original
plan: