Struct pearl::filter::CombinedFilter

pub struct CombinedFilter<K>where
    for<'a> K: Key<'a>,{ /* private fields */ }

Combined bloom and range filter

Implementations

impl<K> CombinedFilter<K>where for<'a> K: Key<'a>,

pub fn new(bloom: Option<Bloom>, range: RangeFilter<K>) -> Self

Create new CombinedFilter

pub fn bloom(&self) -> &Option<Bloom>

Get inner bloom filter

pub fn range(&self) -> &RangeFilter<K>

Get inner range filter

Trait Implementations

impl<K> Clone for CombinedFilter<K>where for<'a> K: Key<'a> + Clone,

fn clone(&self) -> CombinedFilter<K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K> Debug for CombinedFilter<K>where for<'a> K: Key<'a> + Debug,

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

Formats the value using the given formatter.

impl<K> FilterTrait<K> for CombinedFilter<K>where for<'a> K: Key<'a> + Send + Sync, Bloom: FilterTrait<K>,

Trait filters should implement

fn add(&self, key: &K)

Add key to filter

fn contains_fast(&self, key: &K) -> FilterResult

Check if key in filter (should be implemented if filter can be checked without waiting)

fn contains<'life0, 'life1, 'life2, 'async_trait, P>( &'life0 self, provider: &'life1 P, key: &'life2 K ) -> Pin<Box<dyn Future<Output = FilterResult> + Send + 'async_trait>>where P: 'async_trait + BloomDataProvider, Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Check if key in filter (can take some time)

fn offload_filter(&mut self) -> usize

Offload filter from memory if possible

fn checked_add_assign(&mut self, other: &Self) -> bool

Add another filter to this filter

fn memory_allocated(&self) -> usize

Memory used by filter

fn clear_filter(&mut self)

Clear all filter data

fn is_filter_offloaded(&self) -> bool

Check if filter was offloaded