pub struct RemoteNode {
pub id: String,
pub weight: f64,
pub last_latency_ms: u64,
pub success_rate: f64,
}Expand description
A registered remote search node with performance metadata.
Fields§
§id: StringUnique node identifier.
weight: f64Base weight assigned by the operator (higher ⇒ more trusted).
last_latency_ms: u64Round-trip latency of the last query to this node, in milliseconds.
success_rate: f64Fraction of recent queries that succeeded (in [0.0, 1.0]).
Implementations§
Source§impl RemoteNode
impl RemoteNode
Sourcepub fn new(
id: impl Into<String>,
weight: f64,
last_latency_ms: u64,
success_rate: f64,
) -> Self
pub fn new( id: impl Into<String>, weight: f64, last_latency_ms: u64, success_rate: f64, ) -> Self
Construct a new RemoteNode with the given identifiers and initial stats.
Sourcepub fn effective_weight(&self) -> f64
pub fn effective_weight(&self) -> f64
Compute the effective contribution weight of this node.
effective_weight = weight × success_rate / (1 + last_latency_ms / 1000)
Higher latency and lower success rate both reduce the node’s influence.
Trait Implementations§
Source§impl Clone for RemoteNode
impl Clone for RemoteNode
Source§fn clone(&self) -> RemoteNode
fn clone(&self) -> RemoteNode
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for RemoteNode
impl RefUnwindSafe for RemoteNode
impl Send for RemoteNode
impl Sync for RemoteNode
impl Unpin for RemoteNode
impl UnsafeUnpin for RemoteNode
impl UnwindSafe for RemoteNode
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> 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> 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.