Jussi Saurio ae22468d8b Merge 'Order by heap sort' from Nikita Sivukhin ...

This PR implements simple heap-sort approach for query plans like
`SELECT ... FROM t WHERE ... ORDER BY ... LIMIT N` in order to maintain
small set of top N elements in the ephemeral B-tree and avoid sort and
materialization of whole dataset.
I removed all optimizations not related to this particular change in
order to make branch lightweight.

Reviewed-by: Jussi Saurio <jussi.saurio@gmail.com>

Closes #3726

2025-10-23 15:00:42 +03:00

..

btree.rs

Mark pages_to_balance as dirty only after loading

2025-10-22 23:40:45 +03:00

buffer_pool.rs

avoid unnecessary allocations

2025-10-21 20:13:39 +04:00

checksum.rs

rename checksums tests appropriately

2025-10-13 13:48:07 +05:30

database.rs

rename Completion functions

2025-10-06 11:07:06 -03:00

encryption.rs

Replace several RwLock<Enum> values with new AtomicEnums

2025-10-22 09:35:26 -04:00

mod.rs

Add subjournal module

2025-10-22 23:40:44 +03:00

page_cache.rs

when pwritev fails, clear the dirty pages

2025-10-05 20:02:21 -03:00

pager.rs

Merge 'Support statement-level rollback via anonymous savepoints' from Jussi Saurio

2025-10-23 15:00:11 +03:00

slot_bitmap.rs

use workspace rand version

2025-10-21 14:10:05 -03:00

sqlite3_ondisk.rs

Revert "alternative read_variant implementation"

2025-10-22 19:30:43 +04:00

state_machines.rs

refactor/idx_insert: move seeking to VDBE instead of BTreeCursor

2025-08-19 19:04:42 +03:00

subjournal.rs

clippy: Remove unnecessary referencing

2025-10-22 23:40:45 +03:00

wal.rs

add mutable scoped locking for SharedWalFile

2025-10-20 10:45:14 -03:00