pub struct SparseTermQuery {
pub field: Field,
pub dim_id: u32,
pub weight: f32,
pub heap_factor: f32,
pub combiner: MultiValueCombiner,
pub over_fetch_factor: f32,
}Expand description
Query for a single sparse vector dimension.
Analogous to TermQuery for text: searches one dimension’s posting list
with a given weight. Multiple SparseTermQuery instances are combined as
BooleanQuery SHOULD clauses to form a full sparse vector search.
Fields§
§field: Field§dim_id: u32§weight: f32§heap_factor: f32MaxScore heap factor (1.0 = exact, lower = approximate)
combiner: MultiValueCombinerMulti-value combiner for ordinal deduplication
over_fetch_factor: f32Multiplier on executor limit to compensate for ordinal deduplication
Implementations§
Source§impl SparseTermQuery
impl SparseTermQuery
pub fn new(field: Field, dim_id: u32, weight: f32) -> Self
pub fn with_heap_factor(self, heap_factor: f32) -> Self
pub fn with_combiner(self, combiner: MultiValueCombiner) -> Self
pub fn with_over_fetch_factor(self, factor: f32) -> Self
Trait Implementations§
Source§impl Clone for SparseTermQuery
impl Clone for SparseTermQuery
Source§fn clone(&self) -> SparseTermQuery
fn clone(&self) -> SparseTermQuery
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SparseTermQuery
impl Debug for SparseTermQuery
Source§impl Display for SparseTermQuery
impl Display for SparseTermQuery
Source§impl Query for SparseTermQuery
impl Query for SparseTermQuery
Source§fn scorer<'a>(
&self,
reader: &'a SegmentReader,
_limit: usize,
) -> ScorerFuture<'a>
fn scorer<'a>( &self, reader: &'a SegmentReader, _limit: usize, ) -> ScorerFuture<'a>
Create a scorer for this query against a single segment (async) Read more
Source§fn scorer_sync<'a>(
&self,
reader: &'a SegmentReader,
_limit: usize,
) -> Result<Box<dyn Scorer + 'a>>
fn scorer_sync<'a>( &self, reader: &'a SegmentReader, _limit: usize, ) -> Result<Box<dyn Scorer + 'a>>
Create a scorer synchronously (mmap/RAM only). Read more
Source§fn count_estimate<'a>(&self, reader: &'a SegmentReader) -> CountFuture<'a>
fn count_estimate<'a>(&self, reader: &'a SegmentReader) -> CountFuture<'a>
Estimated number of matching documents in a segment (async)
Source§fn as_sparse_term_query_info(&self) -> Option<SparseTermQueryInfo>
fn as_sparse_term_query_info(&self) -> Option<SparseTermQueryInfo>
Return sparse term info if this is a single-dimension sparse query
eligible for MaxScore optimization
Source§fn as_sparse_term_queries(&self) -> Option<Vec<SparseTermQueryInfo>>
fn as_sparse_term_queries(&self) -> Option<Vec<SparseTermQueryInfo>>
Decompose into sparse term query infos for MaxScore optimization. Read more
Source§fn as_term_query_info(&self) -> Option<TermQueryInfo>
fn as_term_query_info(&self) -> Option<TermQueryInfo>
Return term info if this is a simple term query eligible for MaxScore optimization Read more
Source§fn is_filter(&self) -> bool
fn is_filter(&self) -> bool
True if this query is a pure filter (always scores 1.0, no positions).
Used by the planner to convert non-selective MUST filters into predicates.
Source§fn as_doc_predicate<'a>(
&self,
_reader: &'a SegmentReader,
) -> Option<DocPredicate<'a>>
fn as_doc_predicate<'a>( &self, _reader: &'a SegmentReader, ) -> Option<DocPredicate<'a>>
For filter queries: return a cheap per-doc predicate against a segment.
The predicate does O(1) work per doc (e.g., fast-field lookup).
Auto Trait Implementations§
impl Freeze for SparseTermQuery
impl RefUnwindSafe for SparseTermQuery
impl Send for SparseTermQuery
impl Sync for SparseTermQuery
impl Unpin for SparseTermQuery
impl UnsafeUnpin for SparseTermQuery
impl UnwindSafe for SparseTermQuery
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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.Source§impl<T> ToCompactString for Twhere
T: Display,
impl<T> ToCompactString for Twhere
T: Display,
Source§fn try_to_compact_string(&self) -> Result<CompactString, ToCompactStringError>
fn try_to_compact_string(&self) -> Result<CompactString, ToCompactStringError>
Fallible version of
ToCompactString::to_compact_string() Read moreSource§fn to_compact_string(&self) -> CompactString
fn to_compact_string(&self) -> CompactString
Converts the given value to a
CompactString. Read more