Struct solana_bloom::bloom::Bloom
source · pub struct Bloom<T: BloomHashIndex> {
pub keys: Vec<u64>,
pub bits: BitVec<u64>,
/* private fields */
}
Fields§
§keys: Vec<u64>
§bits: BitVec<u64>
Implementations§
source§impl<T: BloomHashIndex> Bloom<T>
impl<T: BloomHashIndex> Bloom<T>
pub fn new(num_bits: usize, keys: Vec<u64>) -> Self
sourcepub fn random(num_items: usize, false_rate: f64, max_bits: usize) -> Self
pub fn random(num_items: usize, false_rate: f64, max_bits: usize) -> Self
Create filter optimal for num size given the FALSE_RATE
.
The keys are randomized for picking data out of a collision resistant hash of size
keysize
bytes.
pub fn clear(&mut self)
pub fn add(&mut self, key: &T)
pub fn contains(&self, key: &T) -> bool
Trait Implementations§
source§impl<T: BloomHashIndex> AbiExample for Bloom<T>
impl<T: BloomHashIndex> AbiExample for Bloom<T>
source§impl<T: BloomHashIndex> Debug for Bloom<T>
impl<T: BloomHashIndex> Debug for Bloom<T>
source§impl<'de, T: BloomHashIndex> Deserialize<'de> for Bloom<T>
impl<'de, T: BloomHashIndex> Deserialize<'de> for Bloom<T>
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T: BloomHashIndex> From<AtomicBloom<T>> for Bloom<T>
impl<T: BloomHashIndex> From<AtomicBloom<T>> for Bloom<T>
source§fn from(atomic_bloom: AtomicBloom<T>) -> Self
fn from(atomic_bloom: AtomicBloom<T>) -> Self
Converts to this type from the input type.
source§impl<T: BloomHashIndex> From<Bloom<T>> for AtomicBloom<T>
impl<T: BloomHashIndex> From<Bloom<T>> for AtomicBloom<T>
source§impl<T: PartialEq + BloomHashIndex> PartialEq for Bloom<T>
impl<T: PartialEq + BloomHashIndex> PartialEq for Bloom<T>
source§impl<T: BloomHashIndex> Sanitize for Bloom<T>
impl<T: BloomHashIndex> Sanitize for Bloom<T>
source§impl<T: BloomHashIndex> Serialize for Bloom<T>
impl<T: BloomHashIndex> Serialize for Bloom<T>
impl<T: Eq + BloomHashIndex> Eq for Bloom<T>
impl<T: BloomHashIndex> StructuralEq for Bloom<T>
impl<T: BloomHashIndex> StructuralPartialEq for Bloom<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for Bloom<T>where T: RefUnwindSafe,
impl<T> Send for Bloom<T>where T: Send,
impl<T> Sync for Bloom<T>where T: Sync,
impl<T> Unpin for Bloom<T>where T: Unpin,
impl<T> UnwindSafe for Bloom<T>where T: UnwindSafe,
Blanket Implementations§
source§impl<T> AbiEnumVisitor for Twhere
T: Serialize + ?Sized,
impl<T> AbiEnumVisitor for Twhere T: Serialize + ?Sized,
default fn visit_for_abi( &self, _digester: &mut AbiDigester ) -> Result<AbiDigester, DigestError>
source§impl<T> AbiEnumVisitor for Twhere
T: Serialize + AbiExample + ?Sized,
impl<T> AbiEnumVisitor for Twhere T: Serialize + AbiExample + ?Sized,
default fn visit_for_abi( &self, digester: &mut AbiDigester ) -> Result<AbiDigester, DigestError>
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more