Enum RoutingStrategy 

pub enum RoutingStrategy {
    Fallback,
    LowestCost,
}

How a RouterClient orders and falls through its backends.

Variants

Fallback

Try backends in ascending priority order; on error fall through. Ties keep insertion order.

LowestCost

Try backends in ascending cost order; on error fall through to the next cheapest. Backends with unknown (or non-finite) cost sort last.

Trait Implementations

impl Clone for RoutingStrategy

fn clone(&self) -> RoutingStrategy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for RoutingStrategy

impl Debug for RoutingStrategy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RoutingStrategy

fn default() -> RoutingStrategy

Returns the “default value” for a type.

impl Eq for RoutingStrategy

impl PartialEq for RoutingStrategy

fn eq(&self, other: &RoutingStrategy) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RoutingStrategy