pub struct SparseTermScorer<'a> { /* private fields */ }Expand description
Scorer for sparse vector dimensions
Wraps a BlockSparsePostingList with a query weight to implement ScoringIterator.
Implementations§
Source§impl<'a> SparseTermScorer<'a>
impl<'a> SparseTermScorer<'a>
Sourcepub fn new(posting_list: &'a BlockSparsePostingList, query_weight: f32) -> Self
pub fn new(posting_list: &'a BlockSparsePostingList, query_weight: f32) -> Self
Create a new sparse term scorer
Sourcepub fn from_arc(
posting_list: &'a Arc<BlockSparsePostingList>,
query_weight: f32,
) -> Self
pub fn from_arc( posting_list: &'a Arc<BlockSparsePostingList>, query_weight: f32, ) -> Self
Create from Arc reference (for use with shared posting lists)
Trait Implementations§
Source§impl ScoringIterator for SparseTermScorer<'_>
impl ScoringIterator for SparseTermScorer<'_>
Source§fn seek(&mut self, target: DocId) -> DocId
fn seek(&mut self, target: DocId) -> DocId
Seek to first document >= target, returns new doc ID
Source§fn max_score(&self) -> f32
fn max_score(&self) -> f32
Maximum possible score for this term/dimension (global upper bound)
Source§fn current_block_max_score(&self) -> f32
fn current_block_max_score(&self) -> f32
Current block’s maximum score upper bound (for block-level pruning)
Source§fn is_exhausted(&self) -> bool
fn is_exhausted(&self) -> bool
Check if iterator is exhausted
Source§fn skip_to_next_block(&mut self) -> DocId
fn skip_to_next_block(&mut self) -> DocId
Skip to the next block, returning the first doc_id in the new block.
Used for block-max WAND optimization when current block can’t beat threshold.
Default implementation just advances (no block-level skipping).
Auto Trait Implementations§
impl<'a> Freeze for SparseTermScorer<'a>
impl<'a> RefUnwindSafe for SparseTermScorer<'a>
impl<'a> Send for SparseTermScorer<'a>
impl<'a> Sync for SparseTermScorer<'a>
impl<'a> Unpin for SparseTermScorer<'a>
impl<'a> UnwindSafe for SparseTermScorer<'a>
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.