alright. we're not doing a B-tree. we're doing a "Log-Structured Merge-tree" aka LSM tree.
for this, it would be a single sorted dynamic array A. per-frame edits are aggregated in nudl, so every update goes into an insertion-ordered update array U.
when the table is complete for the frame, U will be sorted and duplicates collapsed. then U will be merged in-place into A from back to front.
deletions are also nicely covered by all this.




