pub struct RecallReport {
pub candidate_budget: usize,
pub num_rows: usize,
pub total_planted: usize,
pub total_recovered: usize,
pub recall: f64,
pub avg_candidates_gathered: f64,
pub num_atoms: usize,
pub misses: Vec<RecallMiss>,
}Expand description
Result of SaeCandidateIndex::recall_report.
Fields§
§candidate_budget: usizeCandidate budget the recall was measured at.
num_rows: usizeNumber of rows evaluated.
total_planted: usizeTotal planted truly-active atoms across all rows.
total_recovered: usizeHow many of them appeared in the proposed sets.
recall: f64recall@candidate_budget = recovered / planted (1.0 if nothing planted).
avg_candidates_gathered: f64Mean number of candidates the sublinear gather returned per row — the
sublinearity witness; compare against num_atoms.
num_atoms: usizeTotal atoms in the index (for the sublinearity ratio).
misses: Vec<RecallMiss>Every miss, with its row, atom, alignment, and reason. No silent drops.
Implementations§
Source§impl RecallReport
impl RecallReport
Sourcepub fn sublinearity_ratio(&self) -> f64
pub fn sublinearity_ratio(&self) -> f64
Convenience: ratio of mean gathered candidates to dictionary size. A
value far below 1.0 is the evidence that proposal touched a sublinear
slice of the dictionary.
Trait Implementations§
Source§impl Clone for RecallReport
impl Clone for RecallReport
Source§fn clone(&self) -> RecallReport
fn clone(&self) -> RecallReport
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for RecallReport
impl RefUnwindSafe for RecallReport
impl Send for RecallReport
impl Sync for RecallReport
impl Unpin for RecallReport
impl UnsafeUnpin for RecallReport
impl UnwindSafe for RecallReport
Blanket Implementations§
impl<T> Allocation for T
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<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.