Struct RetractableMinAccumulator 

pub struct RetractableMinAccumulator { /* private fields */ }

Retractable min accumulator with counted value tracking.

Uses a BTreeMap<i64, usize> (value → count) for O(log n) insert/remove and O(1) min via first_key_value(). Bounded memory proportional to distinct values, not total event count.

Implementations

impl RetractableMinAccumulator

pub fn new() -> Self

Creates a new min accumulator.

Trait Implementations

impl Clone for RetractableMinAccumulator

fn clone(&self) -> RetractableMinAccumulator

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RetractableMinAccumulator

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

Formats the value using the given formatter.

impl Default for RetractableMinAccumulator

fn default() -> RetractableMinAccumulator

Returns the “default value” for a type.

impl RetractableAccumulator for RetractableMinAccumulator

type Input = i64

The input type for the aggregation.

type Output = Option<i64>

The output type produced by the aggregation.

fn add(&mut self, value: i64)

Adds a value to the accumulator.

fn retract(&mut self, value: &i64)

Retracts (un-applies) a value from the accumulator.

fn merge(&mut self, other: &Self)

Merges another accumulator into this one.

fn result(&self) -> Option<i64>

Extracts the final result from the accumulator.

fn is_empty(&self) -> bool

Returns true if the accumulator is empty (no values added).

fn supports_efficient_retraction(&self) -> bool

Returns true if this accumulator can efficiently retract.

fn reset(&mut self)

Resets the accumulator to its initial state.