Expand description
The two having-range executors on DriveDocumentHavingQuery: a
direct value-bounded read of the axis secondary, and generation of
the equivalent proof.
Both are thin — all of the work happens inside grovedb, which seeks
straight to the encoded bounds in the pre-sorted secondary Merk. No
value trees are opened, no documents are materialized, and the cost
is O(log n + k) in the number of matching groups returned, never
in the total group population.
Whole module is gated feature = "server" via the parent’s
pub mod execute_range; declaration.