pub struct LazyGlobalStats { /* private fields */ }Expand description
Lazy global statistics bound to a fixed set of segments
Computes IDF values lazily on first access and caches them. Lifetime is bound to the Searcher that created it, ensuring statistics always match the current segment set.
Implementations§
Source§impl LazyGlobalStats
impl LazyGlobalStats
Sourcepub fn new(segments: Vec<Arc<SegmentReader>>) -> Self
pub fn new(segments: Vec<Arc<SegmentReader>>) -> Self
Create new lazy stats bound to a set of segments
Sourcepub fn total_docs(&self) -> u64
pub fn total_docs(&self) -> u64
Total documents across all segments
Sourcepub fn sparse_idf(&self, field: Field, dim_id: u32) -> f32
pub fn sparse_idf(&self, field: Field, dim_id: u32) -> f32
Get or compute IDF for a sparse vector dimension (lazy + cached)
IDF = ln(N / df) where N = total docs, df = docs containing dimension
Sourcepub fn sparse_idf_weights(&self, field: Field, dim_ids: &[u32]) -> Vec<f32>
pub fn sparse_idf_weights(&self, field: Field, dim_ids: &[u32]) -> Vec<f32>
Compute IDF weights for multiple sparse dimensions (batch, uses cache)
Sourcepub fn text_idf(&self, field: Field, term: &str) -> f32
pub fn text_idf(&self, field: Field, term: &str) -> f32
Get or compute IDF for a full-text term (lazy + cached)
IDF = ln((N - df + 0.5) / (df + 0.5) + 1) (BM25 variant)
Sourcepub fn avg_field_len(&self, field: Field) -> f32
pub fn avg_field_len(&self, field: Field) -> f32
Get or compute average field length for BM25 (lazy + cached)
Sourcepub fn num_segments(&self) -> usize
pub fn num_segments(&self) -> usize
Number of segments
Trait Implementations§
Auto Trait Implementations§
impl !Freeze for LazyGlobalStats
impl !RefUnwindSafe for LazyGlobalStats
impl Send for LazyGlobalStats
impl Sync for LazyGlobalStats
impl Unpin for LazyGlobalStats
impl !UnwindSafe for LazyGlobalStats
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.