Struct AverageEntry 

pub struct AverageEntry {
    pub in_key: Option<Vec<u8>>,
    pub key: Vec<u8>,
    pub count: Option<u64>,
    pub sum: Option<i64>,
}

A single per-key average entry. Carries BOTH count and sum so the client can divide; the server intentionally doesn’t pre-divide (see the module docstring).

• in_key carries the In value for compound (In, range) queries; None for flat queries.
• key carries the terminator value (the range-key or the In single value, depending on shape).
• count is the document count matching this key.
• sum is the aggregated property value matching this key.

Both count and sum are Option<_> so the dispatcher can emit proven-absent entries when absence_proofs_for_non_existing_searched_keys is configured, mirroring the same three-valued pattern as SumEntry / SplitCountEntry.

Fields

in_key: Option<Vec<u8>>

In-prefix value when the query is compound (In on a prefix property + range on the terminator). None for flat queries.

key: Vec<u8>

The terminator key value (the value of the index’s last covered property within the query).

count: Option<u64>

Matched-document count for this key. Some(n) for matched keys; None for keys proven absent.

sum: Option<i64>

Aggregated sum_property value for this key. Some(n) for matched keys; None for keys proven absent.

Trait Implementations

impl Clone for AverageEntry

fn clone(&self) -> AverageEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AverageEntry

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

Formats the value using the given formatter.

impl PartialEq for AverageEntry

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

impl StructuralPartialEq for AverageEntry