Struct SpaceSaving 

pub struct SpaceSaving { /* private fields */ }

Space-saving algorithm for approximate top-K heavy hitters.

Tracks the K most frequent items with bounded memory. Items not in the top K are approximated — their counts may be over-estimated by at most the minimum count in the structure.

Implementations

impl SpaceSaving

pub fn new(k: usize) -> Self

pub fn add(&mut self, item: u64)

pub fn add_batch(&mut self, items: &[u64])

pub fn top_k(&self) -> Vec<(u64, u64, u64)>

Get the top-K items sorted by count (descending).

Returns (item, count, error_bound) tuples.

pub fn merge(&mut self, other: &SpaceSaving)

Trait Implementations

impl Debug for SpaceSaving

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SpaceSaving

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for SpaceSaving

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.