Struct CostOptimizedStrategy 

pub struct CostOptimizedStrategy {
    pub model_provider_pricing: HashMap<String, HashMap<String, f64>>,
    pub required_vision: bool,
    pub required_tools: bool,
}

A cost-optimized routing strategy that selects the cheapest qualifying model_provider from the route table based on per-provider pricing maps.

Pricing is keyed by model_provider name (the alias under [model_providers.<model_provider>.<alias>]); each model_provider’s pricing map holds user-defined keys (model identifiers, optionally suffixed with .input / .output) mapped to USD-per-1M-token rates.

Fields

model_provider_pricing: HashMap<String, HashMap<String, f64>>

Per-provider pricing data (model_provider name → user-keyed pricing map).

required_vision: bool

Whether the request requires vision support.

required_tools: bool

Whether the request requires native tool support.

Implementations

impl CostOptimizedStrategy

pub fn new( model_provider_pricing: HashMap<String, HashMap<String, f64>>, ) -> Self

Create a new cost-optimized strategy with the given per-provider pricing data.

pub fn with_vision(self, required: bool) -> Self

Set whether vision support is required.

pub fn with_tools(self, required: bool) -> Self

Set whether native tool support is required.

pub fn score(&self, model_provider_name: &str, model: &str) -> Option<f64>

Score a route by summing pricing entries that match the model. Returns None if no pricing data is available for the route.

Trait Implementations

impl Clone for CostOptimizedStrategy

fn clone(&self) -> CostOptimizedStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CostOptimizedStrategy

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

Formats the value using the given formatter.