Struct RankedPage 

pub struct RankedPage {
    pub skipped: u64,
    pub entries: Vec<RankedEntry>,
}

A page of a ranked result: the entries, plus how many ranks were actually skipped to reach them.

skipped is what turns a page into a ranking: entry i of entries is the group at rank skipped + i (0-based). Without it a caller that asked for OFFSET 4 LIMIT 1 would receive one entry and have to trust the server that it really is the 5th-best group.

Fields

skipped: u64

Number of secondary entries skipped before this page.

Both paths report the same quantity, and it is never an echo of the request: grovedb’s counted descent tracks how far the skip actually got, so this equals the requested offset when the skip succeeded and the secondary’s whole population when the walk ran out of groups first (in which case entries is empty).

What differs between the paths is the warrant. On the proved path the value is cryptographically attested — independently re-derived by the verifier from the counted subtree commitments in the proof bytes — so a verifying client uses its own reconstruction rather than trusting the server’s. On the unproven read it is the node’s unverified claim, exactly like the entries beside it: equal to the attested value on an honest node, with nothing forcing a node to be honest.

One nuance worth knowing on the unproven path: the population is read from the secondary’s root aggregate, while grovedb’s per-node payload check only fires on nodes the descent visits. In a corrupt secondary whose count violation lies outside the visited region, this value can therefore disagree with the true row count where the proved path’s would not. On any valid secondary the two are identical by construction.

entries: Vec<RankedEntry>

The groups on this page, in ranking order. Never longer than the query’s k.

Trait Implementations

impl Clone for RankedPage

fn clone(&self) -> RankedPage

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RankedPage

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for RankedPage

impl PartialEq for RankedPage

fn eq(&self, other: &RankedPage) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RankedPage