pub struct VectorSearchRanker {
pub config: RankerConfig,
}Expand description
Re-ranks raw k-NN candidates using a configurable multi-signal scoring model.
Fields§
§config: RankerConfigConfiguration including signals and the reference timestamp.
Implementations§
Source§impl VectorSearchRanker
impl VectorSearchRanker
Sourcepub fn new(config: RankerConfig) -> Self
pub fn new(config: RankerConfig) -> Self
Creates a new VectorSearchRanker with the given configuration.
Sourcepub fn score_candidate(&self, candidate: &RawCandidate) -> RankedResult
pub fn score_candidate(&self, candidate: &RawCandidate) -> RankedResult
Scores a single candidate against all configured signals.
Returns a RankedResult with the computed final_score and per-signal
breakdown for explainability.
Sourcepub fn rank(&self, candidates: &[RawCandidate]) -> Vec<RankedResult>
pub fn rank(&self, candidates: &[RawCandidate]) -> Vec<RankedResult>
Scores all candidates and returns them sorted by final_score descending.
Sourcepub fn rank_top_k(
&self,
candidates: &[RawCandidate],
k: usize,
) -> Vec<RankedResult>
pub fn rank_top_k( &self, candidates: &[RawCandidate], k: usize, ) -> Vec<RankedResult>
Returns at most k top-ranked candidates.
Sourcepub fn explain(&self, result: &RankedResult) -> String
pub fn explain(&self, result: &RankedResult) -> String
Returns a human-readable explanation of a RankedResult.
Format: "id=X score=Y.YY [signal=A, ...]"
Auto Trait Implementations§
impl Freeze for VectorSearchRanker
impl RefUnwindSafe for VectorSearchRanker
impl Send for VectorSearchRanker
impl Sync for VectorSearchRanker
impl Unpin for VectorSearchRanker
impl UnsafeUnpin for VectorSearchRanker
impl UnwindSafe for VectorSearchRanker
Blanket Implementations§
impl<T> Allocation for T
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.