Struct SplitCountEntry 

pub struct SplitCountEntry {
    pub in_key: Option<Vec<u8>>,
    pub key: Vec<u8>,
    pub count: Option<u64>,
}

An entry in a split count result, containing the serialized key(s) and the count of documents matching them.

For flat queries (per-In-value mode without a range, or per-distinct-value-in-range mode without an In on prefix) only key is meaningful and in_key is None.

For compound range-distinct queries (an In clause on a prefix property plus a range on the terminator) BOTH keys are carried: in_key is the In-fork’s prefix value and key is the terminator value. Cross-fork aggregation is intentionally NOT done server-side — emitting the unmerged per-(in_key, key) shape lets limit push directly into grovedb (no pre-merge issue), keeps proof verification straightforward (no absence-proof gymnastics for omitted In branches), and gives callers strictly more information than a flat histogram. Callers reduce client-side when they want the sum.

Fields

in_key: Option<Vec<u8>>

The serialized prefix key for compound queries (the In value for this fork). None for flat queries.

key: Vec<u8>

The serialized terminator/value key for this entry.

count: Option<u64>

The count of documents matching this (in_key, key) tuple (or just key for flat queries).

Three-valued by design:

• Some(n) with n > 0 — verified count for an entry the underlying data path materialized.
• Some(0) — caller queried this branch and the executor confirmed zero matching documents. Emitted by the no-proof point-lookup path’s aggregated total wrapper (a single summed entry whose value can be 0) and by the no-proof range executors when their walk returns nothing. Not emitted per-In-branch under the current shape — see None below.
• None — reserved for a future absence-proof variant. The current point_lookup_count_path_query doesn’t set absence_proofs_for_non_existing_searched_keys: true, so absent In branches are omitted from the verified entry list entirely (grovedb’s verify_query doesn’t surface (path, key, None) triples for them). Callers that need to distinguish “queried but absent” diff the request’s In array against the returned entries by key. The variant exists in the type signature so a future path-query change that flips the flag surfaces absences via count: None without a breaking struct change — distinguishable from Some(0) (which a zero-count CountTree could never produce on its own since zero-count CountTrees aren’t materialized in merk).

Trait Implementations

impl Clone for SplitCountEntry

fn clone(&self) -> SplitCountEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SplitCountEntry

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

Formats the value using the given formatter.

impl PartialEq for SplitCountEntry

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

impl StructuralPartialEq for SplitCountEntry