Struct BloomCascade 

pub struct BloomCascade<T> { /* private fields */ }

Two-level cascading filter: 8-byte coarse + 32-byte fine. Layer 0 (coarse) rejects in one register-compare. Layer 1 (fine) holds 4x as many bits + 8 hash functions; rejects most of the remainder before the target is touched.

Architectural shape: same as LSM-tree multi-level Blooms or the nested-cache pattern in Bitcoin SPV / LevelDB / RocksDB - exposed as a typed primitive.

Implementations

impl<T> BloomCascade<T>

pub fn new(target: Arc<T>, coarse: Bloom64, fine: BloomFine) -> Self

pub fn from_keys<K, I>(target: Arc<T>, keys: I) -> Self

where K: Hash, I: IntoIterator<Item = K>,

Build both filter levels from the same key iterator.

pub fn target(&self) -> &Arc<T>

pub fn coarse(&self) -> Bloom64

pub fn fine(&self) -> &BloomFine

pub fn cascade_check<K: Hash + ?Sized>(&self, key: &K) -> CascadeOutcome

Cascade rejection: coarse first (register-only), fine second (32 bytes, 4 cache lines worst case). Returns the LEVEL where the reject fired (0 = coarse rejected, 1 = fine rejected, 2 = both layers said maybe-yes).

Trait Implementations

impl<T: Clone> Clone for BloomCascade<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for BloomCascade<T>

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

Formats the value using the given formatter.