pub struct MaxScoreExecutor<S: ScoringIterator> { /* private fields */ }Expand description
MaxScore executor with essential/non-essential term partitioning
For medium-length queries (6-20 terms), partitions terms into:
- Essential terms: must be checked for every candidate document
- Non-essential terms: only scored when candidate could enter top-k
Reference: Turtle & Flood, “Query Evaluation: Strategies and Optimizations” (Information Processing & Management, 1995)
Implementations§
Source§impl<S: ScoringIterator> MaxScoreExecutor<S>
impl<S: ScoringIterator> MaxScoreExecutor<S>
Sourcepub fn with_heap_factor(scorers: Vec<S>, k: usize, heap_factor: f32) -> Self
pub fn with_heap_factor(scorers: Vec<S>, k: usize, heap_factor: f32) -> Self
Create a new MaxScore executor with approximate search
Auto Trait Implementations§
impl<S> Freeze for MaxScoreExecutor<S>
impl<S> RefUnwindSafe for MaxScoreExecutor<S>where
S: RefUnwindSafe,
impl<S> Send for MaxScoreExecutor<S>where
S: Send,
impl<S> Sync for MaxScoreExecutor<S>where
S: Sync,
impl<S> Unpin for MaxScoreExecutor<S>where
S: Unpin,
impl<S> UnwindSafe for MaxScoreExecutor<S>where
S: UnwindSafe,
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
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
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.