Struct amadeus_streaming::CountMinSketch [−][src]
Expand description
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]
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]
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]
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]“Visit” an element.
pub fn union_assign<Q: ?Sized>(&mut self, key: &Q, value: &C) where
Q: Hash,
K: Borrow<Q>,
[src]
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
.
Trait Implementations
impl<K: ?Sized, C: New> Debug 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<'de, K: ?Sized, C: New> Deserialize<'de> for CountMinSketch<K, C> where
C: Deserialize<'de>,
<C as New>::Config: Deserialize<'de>,
[src]fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
__D: Deserializer<'de>,
[src]Deserialize this value from the given Serde deserializer. Read more
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> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
pub fn vzip(self) -> V
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,