pub struct Shortest {}Expand description
Selects the shortest path based on the number of hops.
Trait Implementations§
Source§impl PathPolicy for Shortest
impl PathPolicy for Shortest
Source§fn predicate(&self, _: &PolicyPath<'_>) -> bool
fn predicate(&self, _: &PolicyPath<'_>) -> bool
Returns true if the path should be considered for selection.
Source§fn rank(&self, a: &PolicyPath<'_>, b: &PolicyPath<'_>) -> Ordering
fn rank(&self, a: &PolicyPath<'_>, b: &PolicyPath<'_>) -> Ordering
Indicates which of two paths is preferred, greater values are preferred.
Auto Trait Implementations§
impl Freeze for Shortest
impl RefUnwindSafe for Shortest
impl Send for Shortest
impl Sync for Shortest
impl Unpin for Shortest
impl UnwindSafe for Shortest
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> 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> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::Request