pub struct RerankConfig {
pub relevance_weight: f32,
pub density_weight: f32,
pub recency_weight: f32,
pub diversity_lambda: f32,
pub max_key_points: usize,
pub min_density_threshold: f32,
pub recency_half_life_days: f32,
}Expand description
Configuration for hierarchical reranking.
Fields§
§relevance_weight: f32Weight for original relevance score (0.0-1.0)
density_weight: f32Weight for gist density score (0.0-1.0)
recency_weight: f32Weight for recency score (0.0-1.0)
diversity_lambda: f32Lambda for diversity (MMR-style) (0.0-1.0) Higher lambda = more relevance, lower = more diversity
max_key_points: usizeMaximum key points to extract per episode
min_density_threshold: f32Minimum gist density threshold for inclusion
recency_half_life_days: f32Half-life in days for recency decay
Implementations§
Source§impl RerankConfig
impl RerankConfig
Sourcepub fn dense() -> Self
pub fn dense() -> Self
Create a configuration optimized for dense context.
Prioritizes gist density and diversity for maximum information per token in downstream prompts.
Sourcepub fn comprehensive() -> Self
pub fn comprehensive() -> Self
Create a configuration optimized for comprehensive context.
Larger result set with lower density thresholds.
Trait Implementations§
Source§impl Clone for RerankConfig
impl Clone for RerankConfig
Source§fn clone(&self) -> RerankConfig
fn clone(&self) -> RerankConfig
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 RerankConfig
impl Debug for RerankConfig
Source§impl Default for RerankConfig
impl Default for RerankConfig
Source§impl<'de> Deserialize<'de> for RerankConfig
impl<'de> Deserialize<'de> for RerankConfig
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for RerankConfig
impl RefUnwindSafe for RerankConfig
impl Send for RerankConfig
impl Sync for RerankConfig
impl Unpin for RerankConfig
impl UnsafeUnpin for RerankConfig
impl UnwindSafe for RerankConfig
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> 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> Serialize for T
impl<T> Serialize for T
fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<Ok, Error>
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<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.