Struct ModelPricingMap 

pub struct ModelPricingMap { /* private fields */ }

Optimized pricing map with precomputed indices for O(1) exact matches and fast fuzzy matching.

Implementations

impl ModelPricingMap

pub fn new(raw: HashMap<String, ModelPricing>) -> Self

Creates a new pricing map with precomputed indices for optimized lookups.

This constructor processes the raw pricing data to build:

• Normalized key index for version-agnostic matching.
• Lowercase key list for substring and fuzzy matching.

Examples

use std::collections::HashMap;
use vct_core::pricing::{ModelPricing, ModelPricingMap};

let mut raw = HashMap::new();
raw.insert("gpt-4".to_string(), ModelPricing::default());
let map = ModelPricingMap::new(raw);
assert!(!map.is_empty());

pub fn get(&self, model_name: &str) -> ModelPricingResult

Retrieves pricing for a model using a multi-tier matching strategy.

Matching strategy (in order of priority):

1. Exact match (O(1) hash lookup).
2. Normalized match (removes version suffixes).
3. Substring match (bidirectional contains check).
4. Fuzzy match (Jaro-Winkler ≥ 0.7 threshold).
5. Default (zero cost) if no match found.

Results are cached per map. clear_pricing_cache invalidates every existing map lazily, so even the “no match” outcome can be memoized without leaking a result from one pricing table into another.

Examples

use std::collections::HashMap;
use vct_core::pricing::{ModelPricing, ModelPricingMap};

let mut raw = HashMap::new();
raw.insert(
    "gpt-4".to_string(),
    ModelPricing { input_cost_per_token: 3e-5, ..Default::default() },
);
let map = ModelPricingMap::new(raw);

// Exact match: `matched_model` stays `None`.
let hit = map.get("gpt-4");
assert_eq!(hit.pricing.input_cost_per_token, 3e-5);
assert!(hit.matched_model.is_none());

// No match: zero-cost default.
let miss = map.get("does-not-exist-xyzzy");
assert_eq!(miss.pricing.input_cost_per_token, 0.0);

pub fn get_exact(&self, model_name: &str) -> Option<ModelPricing>

Returns the pricing for an exact model-name match only.

Unlike get, this performs no normalization, substring, or fuzzy matching: it returns Some only when model_name is a verbatim key in the pricing table, and None otherwise. This is the lookup used for providers (OpenCode) that carry their own authoritative cost and should fall back to that stored cost rather than guess a price from a loosely-similar model name.

pub fn is_empty(&self) -> bool

Returns whether the pricing map contains no models.

pub fn raw(&self) -> &HashMap<Rc<str>, ModelPricing>

Returns the raw pricing data with reference-counted keys.

pub fn tier_thresholds(&self) -> TierThresholds

Builds the Send + Sync “model → lowest context-tier threshold” snapshot the usage scan hands to session parsers for per-request tier classification. Models without threshold tiers are absent.

Trait Implementations

impl Clone for ModelPricingMap

fn clone(&self) -> ModelPricingMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModelPricingMap

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

Formats the value using the given formatter.