Struct RankedEntry 

pub struct RankedEntry {
    pub key: Vec<u8>,
    pub value: RankedEntryValue,
    pub in_key: Option<Vec<u8>>,
}

One group in a ranked result: the group’s index key plus its aggregate.

key is the raw index-key bytes of the grouping property’s value — the same bytes that name the group’s value tree under the indexed property-name tree (for a string property, its UTF-8 bytes). Callers that want the original typed value decode it with the document type’s key deserialization; the query layer deliberately hands back bytes so prover and verifier agree without a DPP round-trip.

Fields

key: Vec<u8>

Raw index-key bytes of the grouped property value.

value: RankedEntryValue

The group’s aggregate on the requested axis.

in_key: Option<Vec<u8>>

The branch this entry came from, on an IN-pinned request: the encoded index-key segment of the IN position’s pinned value (empty bytes for the null branch). None on single-branch responses — the same group key can appear under two prefixes, so only a merged page needs the discriminator. See [branches::branch_in_key].

Trait Implementations

impl Clone for RankedEntry

fn clone(&self) -> RankedEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RankedEntry

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

Formats the value using the given formatter.

impl Eq for RankedEntry

impl PartialEq for RankedEntry

fn eq(&self, other: &RankedEntry) -> 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 RankedEntry