pub struct ReRanker { /* private fields */ }Expand description
Re-ranker for search results
Implementations§
Source§impl ReRanker
impl ReRanker
Sourcepub fn new(config: ReRankingConfig) -> Self
pub fn new(config: ReRankingConfig) -> Self
Create a new re-ranker with the given configuration
Sourcepub fn with_defaults() -> Self
pub fn with_defaults() -> Self
Create a re-ranker with default configuration
Sourcepub fn add_metadata(&mut self, cid: Cid, metadata: Metadata)
pub fn add_metadata(&mut self, cid: Cid, metadata: Metadata)
Add metadata for a CID (for metadata-based scoring)
Sourcepub fn rerank(&self, results: Vec<SearchResult>) -> Vec<ScoredResult>
pub fn rerank(&self, results: Vec<SearchResult>) -> Vec<ScoredResult>
Re-rank search results
Sourcepub fn weighted(components: Vec<(ScoreComponent, f32)>) -> ReRankingConfig
pub fn weighted(components: Vec<(ScoreComponent, f32)>) -> ReRankingConfig
Create a weighted combination strategy
Sourcepub fn reciprocal_rank_fusion(k: f32) -> ReRankingConfig
pub fn reciprocal_rank_fusion(k: f32) -> ReRankingConfig
Create a reciprocal rank fusion strategy
Auto Trait Implementations§
impl Freeze for ReRanker
impl RefUnwindSafe for ReRanker
impl Send for ReRanker
impl Sync for ReRanker
impl Unpin for ReRanker
impl UnwindSafe for ReRanker
Blanket Implementations§
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.