[][src]Struct streaming_algorithms::CountMinSketch

pub struct CountMinSketch<K: ?Sized, C: New> { /* fields omitted */ }

An implementation of a count-min sketch data structure with conservative updating for increased accuracy.

This data structure is also known as a counting Bloom filter.

See An Improved Data Stream Summary: The Count-Min Sketch and its Applications and New Directions in Traffic Measurement and Accounting for background on the count-min sketch with conservative updating.

Implementations

impl<K: ?Sized, C> CountMinSketch<K, C> where
    K: Hash,
    C: New + for<'a> UnionAssign<&'a C> + Intersect
[src]

pub fn new(probability: f64, tolerance: f64, config: C::Config) -> Self[src]

Create an empty CountMinSketch data structure with the specified error tolerance.

pub fn push<Q: ?Sized, V: ?Sized>(&mut self, key: &Q, value: &V) -> C where
    Q: Hash,
    K: Borrow<Q>,
    C: for<'a> AddAssign<&'a V>, 
[src]

"Visit" an element.

pub fn union_assign<Q: ?Sized>(&mut self, key: &Q, value: &C) where
    Q: Hash,
    K: Borrow<Q>, 
[src]

Union the aggregated value for key with value.

pub fn get<Q: ?Sized>(&self, key: &Q) -> C where
    Q: Hash,
    K: Borrow<Q>, 
[src]

Retrieve an estimate of the aggregated value for key.

pub fn clear(&mut self)[src]

Clears the CountMinSketch data structure, as if it was new.

Trait Implementations

impl<K: ?Sized, C: New + Clone> Clone for CountMinSketch<K, C>[src]

impl<K: ?Sized, C: New> Debug for CountMinSketch<K, C>[src]

impl<'de, K: ?Sized, C: New> Deserialize<'de> for CountMinSketch<K, C> where
    C: Deserialize<'de>,
    <C as New>::Config: Deserialize<'de>, 
[src]

impl<K: ?Sized, C: New> Serialize for CountMinSketch<K, C> where
    C: Serialize,
    <C as New>::Config: Serialize
[src]

Auto Trait Implementations

impl<K: ?Sized, C> RefUnwindSafe for CountMinSketch<K, C> where
    C: RefUnwindSafe,
    <C as New>::Config: RefUnwindSafe

impl<K: ?Sized, C> Send for CountMinSketch<K, C> where
    C: Send,
    <C as New>::Config: Send

impl<K: ?Sized, C> Sync for CountMinSketch<K, C> where
    C: Sync,
    <C as New>::Config: Sync

impl<K: ?Sized, C> Unpin for CountMinSketch<K, C> where
    C: Unpin,
    <C as New>::Config: Unpin

impl<K: ?Sized, C> UnwindSafe for CountMinSketch<K, C> where
    C: UnwindSafe,
    <C as New>::Config: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T, U> Cast<U> for T where
    U: FromCast<T>, 
[src]

impl<T> DeserializeOwned for T where
    T: for<'de> Deserialize<'de>, 
[src]

impl<T> From<T> for T[src]

impl<T> FromBits<T> for T[src]

impl<T> FromCast<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> IntoBits<U> for T where
    U: FromBits<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,