Files
turso/core
Jussi Saurio 9b14c0022d Implement the balance_quick algorithm
Fast balancing routine for the common special case where the rightmost leaf page of a given subtree overflows (= an append).
In this case we just add a new leaf page as the right sibling of that page, and insert a new divider cell into the parent.
The high level steps are:
1. Allocate a new leaf page and insert the overflow cell payload in it.
2. Create a new divider cell in the parent - it contains the page number of the old rightmost leaf, plus the largest rowid on that page.
3. Update the rightmost pointer of the parent to point to the new leaf page.
4. Continue balance from the parent page (inserting the new divider cell may have overflowedImplement the balance_quick algorithm
2025-09-12 00:42:27 +03:00
..
2025-09-05 14:56:05 -04:00
2025-06-30 10:01:03 +03:00
2025-08-15 17:08:53 -04:00
2025-01-28 14:55:38 -05:00
2025-09-08 13:18:09 -04:00
2025-06-23 19:52:13 +01:00
2025-08-30 03:10:39 -03:00
2025-01-28 14:55:38 -05:00
2025-09-11 18:28:46 +07:00
2025-06-23 19:52:13 +01:00
2025-06-30 09:54:13 +03:00
2025-09-05 14:56:09 -04:00