Enum ProviderSortStrategy 

pub enum ProviderSortStrategy {
    Price,
    Throughput,
    Latency,
}

Simple sorting strategy for providers.

Determines how providers should be prioritized when multiple are available. If you set sort, default load balancing is disabled and providers are tried deterministically in the resulting order.

Variants

Price

Sort by price (cheapest first)

Throughput

Sort by throughput (higher tokens/sec first)

Latency

Sort by latency (lower latency first)

Trait Implementations

impl Clone for ProviderSortStrategy

fn clone(&self) -> ProviderSortStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ProviderSortStrategy

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ProviderSortStrategy

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<ProviderSortStrategy> for ProviderSort

fn from(strategy: ProviderSortStrategy) -> Self

Converts to this type from the input type.

impl PartialEq for ProviderSortStrategy

fn eq(&self, other: &ProviderSortStrategy) -> 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 Serialize for ProviderSortStrategy

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for ProviderSortStrategy

impl Eq for ProviderSortStrategy

impl StructuralPartialEq for ProviderSortStrategy