pub struct SimilarityCover { /* private fields */ }Expand description
Two solved sets of instances and their errors, used to bound the error of
a new set: if a solved set had error e and k of its instances are
missing from the new set, the new set’s error is at least e - k.
Implementations§
Source§impl SimilarityCover
impl SimilarityCover
Sourcepub fn update(&mut self, cover: &SparseBitset, error: f64)
pub fn update(&mut self, cover: &SparseBitset, error: f64)
Records a solved set of instances and its error, filling an empty slot or replacing the closest reference set.
Sourcepub fn compute_similarity(&self, cover: &SparseBitset) -> f64
pub fn compute_similarity(&self, cover: &SparseBitset) -> f64
The best lower bound the reference sets give for cover, at least 0.
Trait Implementations§
Source§impl Debug for SimilarityCover
impl Debug for SimilarityCover
Auto Trait Implementations§
impl Freeze for SimilarityCover
impl RefUnwindSafe for SimilarityCover
impl Send for SimilarityCover
impl Sync for SimilarityCover
impl Unpin for SimilarityCover
impl UnsafeUnpin for SimilarityCover
impl UnwindSafe for SimilarityCover
Blanket Implementations§
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