Struct RoutingPolicy 

pub struct RoutingPolicy { /* private fields */ }

How RoutingClassifier decides. Defaults to RoutingMode::Off: a cheaper adapter is earned by measurement, never assumed.

Implementations

impl RoutingPolicy

pub fn off() -> Self

Everything to the expensive adapter.

pub fn pinned(adapter: AdapterId) -> Self

Everything to adapter, which must be one the router holds.

pub fn measured(evidence: AgreementReport) -> Self

Route per kind on evidence, which must compare the router’s two adapters.

pub fn thresholds(self, adapter: AdapterId, thresholds: Thresholds) -> Self

The thresholds for adapter. Without thresholds for the cheap adapter nothing is routed to it.

pub const fn min_questions(self, n: usize) -> Self

How many measured questions a kind needs, at the thresholds, before the cheap adapter may answer it. Default 20.

pub const fn max_disagreement_rate(self, rate: f64) -> Self

The most disagreement a kind may show, at the thresholds, and still go to the cheap adapter; equal to the cap passes. Default 0.05.

Trait Implementations

impl Clone for RoutingPolicy

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RoutingPolicy

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

Formats the value using the given formatter.

impl Default for RoutingPolicy

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for RoutingPolicy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RoutingPolicy