min
05/18/2026, 12:45 PMT elements in,
2. And has a notion of a ‘gap’ slice that’s uninitialised to be written to
A naive minimal implementation can be given by a struct { buffer, gap_range }. I don’t understand how an array of (what I presume are) inlined serialisations of groups, and a ‘`slots` array’ implement a gap buffer. Moreover, what’s a slot?min
05/19/2026, 7:47 AMmin
05/19/2026, 7:49 AMslots array is a gap buffer?shikasd
05/20/2026, 11:36 AMPriorityHeap works). Gap buffer was there for faster updates, and is no longer there in the new LinkTable impl.min
05/20/2026, 11:53 AMremember?shikasd
05/20/2026, 11:54 AMshikasd
05/20/2026, 11:56 AMAre you saying that it’s just stuff cached byYeap, that and?remember
composer.changed, which is effectively internal remembershikasd
05/20/2026, 12:01 PMshikasd
05/20/2026, 12:01 PMmin
05/21/2026, 12:16 PMremember?
A: effectively a remembered value
Got it, thanks!