diff options
| author | Taylan Kammer <taylan.kammer@gmail.com> | 2026-06-08 19:18:55 +0200 |
|---|---|---|
| committer | Taylan Kammer <taylan.kammer@gmail.com> | 2026-06-08 19:18:55 +0200 |
| commit | ded16f84e1febfdc262b51291da02f9e69b63cf0 (patch) | |
| tree | 48bfb5a0b016493bb41c1827581c97b2c34d27ac | |
| parent | a215b80479690ad422cedffba00f04a6ad5df351 (diff) | |
Lil fix in a note.
| -rw-r--r-- | notes/260608-fastcons2.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/notes/260608-fastcons2.md b/notes/260608-fastcons2.md index bee97ac..541ee87 100644 --- a/notes/260608-fastcons2.md +++ b/notes/260608-fastcons2.md @@ -143,9 +143,9 @@ another `[4]u64`-backed list: If you think hard and compare this to what would happen under regular `[2]Value` cons cells, you will arrive at an interesting realization, which is that as elements are added, it goes back and forth between -wasting one `u64`-sized slot, and using exactly the same number of +wasting two `u64`-sized slot, and using exactly the same number of slots, compared to regular cons cells. So, the total memory waste -remains bounded to 8 bytes per list constructed in this way! +remains bounded to 16 bytes per list constructed in this way! (The per-block sentinel value is always "wasted" yes, but this pays for itself in having fewer pointers, which are also "waste" if you |
