Struct solana_bloom::bloom::Bloom

pub struct Bloom<T: BloomHashIndex> {
    pub keys: Vec<u64>,
    pub bits: BitVec<u64>,
    /* private fields */
}

Fields

keys: Vec<u64>

bits: BitVec<u64>

Implementations

impl<T: BloomHashIndex> Bloom<T>

pub fn new(num_bits: usize, keys: Vec<u64>) -> 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.

See https://hur.st/bloomfilter/.

pub fn clear(&mut self)

pub fn add(&mut self, key: &T)

pub fn contains(&self, key: &T) -> bool

Trait Implementations

impl<T: BloomHashIndex> AbiExample for Bloom<T>

fn example() -> Self

impl<T: Clone + BloomHashIndex> Clone for Bloom<T>

fn clone(&self) -> Bloom<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: BloomHashIndex> Debug for Bloom<T>

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

Formats the value using the given formatter.

impl<T: Default + BloomHashIndex> Default for Bloom<T>

fn default() -> Bloom<T>

Returns the “default value” for a type.

impl<'de, T: BloomHashIndex> Deserialize<'de> for Bloom<T>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: BloomHashIndex> From<AtomicBloom<T>> for Bloom<T>

fn from(atomic_bloom: AtomicBloom<T>) -> Self

Converts to this type from the input type.

impl<T: BloomHashIndex> From<Bloom<T>> for AtomicBloom<T>

fn from(bloom: Bloom<T>) -> Self

Converts to this type from the input type.

impl<T: PartialEq + BloomHashIndex> PartialEq for Bloom<T>

fn eq(&self, other: &Bloom<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: BloomHashIndex> Sanitize for Bloom<T>

fn sanitize(&self) -> Result<(), SanitizeError>

impl<T: BloomHashIndex> Serialize for Bloom<T>

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

Serialize this value into the given Serde serializer.

impl<T: Eq + BloomHashIndex> Eq for Bloom<T>

impl<T: BloomHashIndex> StructuralEq for Bloom<T>

impl<T: BloomHashIndex> StructuralPartialEq for Bloom<T>