mirror of
https://github.com/tursodatabase/limbo.git
synced 2025-12-23 08:21:09 +00:00
eb782ce2d4
for example, upon opening an existing database, all the rows are in the btree, so if we seek only from MV store, we won't find anything. ergo: we must look from both the mv store and the btree. if we are iterating forwards, the smallest of the two results is where we land, and vice versa for backwards iteration. initially this implementation used blocking IO but was refactored to use state machines after the rest of the Cursor methods in the MVCC cursor module were refactored to do that too. --- this PR was initially almost entirely written using Claude Code + Opus 4.5, but heavily manually cleaned up as the AI made the state machine refactor far too complicated. |
||
|---|---|---|
| .. | ||
| database | ||
| persistent_storage | ||
| clock.rs | ||
| cursor.rs | ||
| mod.rs | ||