Struct SortAndMerge 

pub struct SortAndMerge<const N: usize = 32> { /* private fields */ }

Strategy that stores all observations and sorts them on emission.

This preserves all observations exactly but uses more memory than bucketing strategies. This uses a SmallVec (default size 32, memory usage of 256 bytes) to avoid allocations for small numbers of observations.

The const generic N controls the inline capacity before heap allocation.

Implementations

impl<const N: usize> SortAndMerge<N>

pub fn new() -> Self

Create a new sort-and-merge strategy.

Trait Implementations

impl<const N: usize> AggregationStrategy for SortAndMerge<N>

fn record_many(&mut self, value: f64, count: u64)

Record multiple observations of the same value.

fn drain(&mut self) -> Vec<Observation>

Drain all observations and return them as a vector.

fn record(&mut self, value: f64)

Record a single observation.

impl<const N: usize> Default for SortAndMerge<N>

fn default() -> SortAndMerge<N>

Returns the “default value” for a type.