pub struct ExponentialRecency {
pub half_life_ms: Millis,
pub basis: RecencyBasis,
pub floor: f64,
}Expand description
0.5^(age / half_life), never below floor. Facts without a time, and facts newer than
the evaluation time, are not decayed.
Fields§
§half_life_ms: Millis§basis: RecencyBasis§floor: f64Trait Implementations§
Source§impl Clone for ExponentialRecency
impl Clone for ExponentialRecency
impl Copy for ExponentialRecency
Source§impl Debug for ExponentialRecency
impl Debug for ExponentialRecency
Source§impl PartialEq for ExponentialRecency
impl PartialEq for ExponentialRecency
Source§impl RecencyPolicy for ExponentialRecency
impl RecencyPolicy for ExponentialRecency
Source§fn factor(&self, fact: &RecencyContext) -> f64
fn factor(&self, fact: &RecencyContext) -> f64
A finite, nonnegative multiplier.
Source§fn is_identity(&self) -> bool
fn is_identity(&self) -> bool
True when the policy never changes a score; recall then skips it and keeps the
document search order.
impl StructuralPartialEq for ExponentialRecency
Auto Trait Implementations§
impl Freeze for ExponentialRecency
impl RefUnwindSafe for ExponentialRecency
impl Send for ExponentialRecency
impl Sync for ExponentialRecency
impl Unpin for ExponentialRecency
impl UnsafeUnpin for ExponentialRecency
impl UnwindSafe for ExponentialRecency
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> Pointable for T
impl<T> Pointable for T
impl<T> Scalar 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.