[−][src]Struct amadeus_streaming::CountMinSketch
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]
K: Hash,
C: New + for<'a> UnionAssign<&'a C> + Intersect,
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> + IntersectPlusUnionIsPlus,
[src]
Q: Hash,
K: Borrow<Q>,
C: for<'a> AddAssign<&'a V> + IntersectPlusUnionIsPlus,
"Visit" an element.
pub fn union_assign<Q: ?Sized>(&mut self, key: &Q, value: &C) where
Q: Hash,
K: Borrow<Q>,
[src]
Q: Hash,
K: Borrow<Q>,
Union the aggregated value for key
with value
.
pub fn get<Q: ?Sized>(&self, key: &Q) -> C where
Q: Hash,
K: Borrow<Q>,
[src]
Q: Hash,
K: Borrow<Q>,
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]
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[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]
C: Deserialize<'de>,
<C as New>::Config: Deserialize<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
__D: Deserializer<'de>,
impl<K: ?Sized, C: New> Serialize for CountMinSketch<K, C> where
C: Serialize,
<C as New>::Config: Serialize,
[src]
C: Serialize,
<C as New>::Config: Serialize,
Auto Trait Implementations
impl<K: ?Sized, C> RefUnwindSafe for CountMinSketch<K, C> where
C: RefUnwindSafe,
<C as New>::Config: RefUnwindSafe,
C: RefUnwindSafe,
<C as New>::Config: RefUnwindSafe,
impl<K: ?Sized, C> Send for CountMinSketch<K, C> where
C: Send,
<C as New>::Config: Send,
C: Send,
<C as New>::Config: Send,
impl<K: ?Sized, C> Sync for CountMinSketch<K, C> where
C: Sync,
<C as New>::Config: Sync,
C: Sync,
<C as New>::Config: Sync,
impl<K: ?Sized, C> Unpin for CountMinSketch<K, C> where
C: Unpin,
<C as New>::Config: Unpin,
C: Unpin,
<C as New>::Config: Unpin,
impl<K: ?Sized, C> UnwindSafe for CountMinSketch<K, C> where
C: UnwindSafe,
<C as New>::Config: UnwindSafe,
C: UnwindSafe,
<C as New>::Config: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,