pub struct TermQuery {
pub field: Field,
pub term: Vec<u8>,
/* private fields */
}Expand description
Term query - matches documents containing a specific term
Fields§
§field: Field§term: Vec<u8>Implementations§
Source§impl TermQuery
impl TermQuery
pub fn new(field: Field, term: impl Into<Vec<u8>>) -> Self
pub fn text(field: Field, text: &str) -> Self
Sourcepub fn with_wand_data(
field: Field,
field_name: &str,
term: &str,
wand_data: Arc<WandData>,
) -> Self
pub fn with_wand_data( field: Field, field_name: &str, term: &str, wand_data: Arc<WandData>, ) -> Self
Create a term query with pre-computed WAND data for collection-wide IDF
This enables more accurate scoring when querying across multiple segments, as the IDF values are computed from the entire collection rather than per-segment.
Sourcepub fn set_wand_data(&mut self, field_name: &str, wand_data: Arc<WandData>)
pub fn set_wand_data(&mut self, field_name: &str, wand_data: Arc<WandData>)
Set WAND data for this query
Trait Implementations§
Source§impl Query for TermQuery
impl Query for TermQuery
Source§fn scorer<'a>(&'a self, reader: &'a SegmentReader) -> ScorerFuture<'a>
fn scorer<'a>(&'a self, reader: &'a SegmentReader) -> ScorerFuture<'a>
Create a scorer for this query against a single segment (async)
Source§fn count_estimate<'a>(&'a self, reader: &'a SegmentReader) -> CountFuture<'a>
fn count_estimate<'a>(&'a self, reader: &'a SegmentReader) -> CountFuture<'a>
Estimated number of matching documents in a segment (async)
Auto Trait Implementations§
impl Freeze for TermQuery
impl RefUnwindSafe for TermQuery
impl Send for TermQuery
impl Sync for TermQuery
impl Unpin for TermQuery
impl UnwindSafe for TermQuery
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.