Expand description
Per-mode ranked executors on impl Drive. One file per response
shape — the dispatcher (super::drive_dispatcher) picks between
them on the request’s prove flag.
Each executor resolves the covering index, builds the
[DriveDocumentRankedQuery], and runs the matching method on it. The
resolution step is shared (ranked_query_for_mode) rather than
duplicated per file: the no-proof and prove paths must agree on the
index — and therefore the grove path — or a client would verify a
proof about a different subtree than the one an unproven read
returned.
No re-exports needed: each file adds methods directly to impl Drive.
Modules§
- top_
k_ no_ proof - Ranked executor for
prove = false— one page ofkgroups starting at rankoffset, in ranking order. - top_
k_ proof - Ranked executor for
prove = true— generates the grovedb indexed-axis paginated top-k proof envelope for the same(index, axis, descending, k, offset)the no-proof executor would read.