Files
Aether/crates/aether-routing-core/src/ranking.rs
2026-05-18 11:03:49 +08:00

182 lines
5.9 KiB
Rust

use std::collections::BTreeMap;
use serde::{Deserialize, Serialize};
pub const ROUTING_PRIORITY_UNSPECIFIED: i32 = i32::MAX;
#[derive(Debug, Clone, Copy, PartialEq, Eq, Serialize, Deserialize)]
#[serde(rename_all = "snake_case")]
pub enum CandidateKind {
Provider,
PoolGroup,
}
#[derive(Debug, Clone, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct RankingOverlay {
#[serde(default)]
pub allowed_providers: Vec<String>,
#[serde(default)]
pub allowed_keys: Vec<String>,
#[serde(default)]
pub provider_priority_overrides: BTreeMap<String, i32>,
#[serde(default)]
pub key_priority_overrides: BTreeMap<String, i32>,
#[serde(default)]
pub pool_priority_overrides: BTreeMap<String, i32>,
}
impl RankingOverlay {
pub fn provider_priority(&self, provider_id: &str, fallback: i32) -> i32 {
self.provider_priority_overrides
.get(provider_id)
.copied()
.unwrap_or(fallback)
}
pub fn key_priority(&self, key_id: &str, fallback: i32) -> i32 {
self.key_priority_overrides
.get(key_id)
.copied()
.unwrap_or(fallback)
}
pub fn provider_priority_or_unspecified(&self, provider_id: &str) -> i32 {
self.provider_priority_overrides
.get(provider_id)
.copied()
.unwrap_or(ROUTING_PRIORITY_UNSPECIFIED)
}
pub fn key_priority_or_unspecified(&self, key_id: &str) -> i32 {
self.key_priority_overrides
.get(key_id)
.copied()
.unwrap_or(ROUTING_PRIORITY_UNSPECIFIED)
}
pub fn pool_priority_or_unspecified(&self, provider_id: &str) -> i32 {
self.pool_priority_overrides
.get(provider_id)
.copied()
.unwrap_or(ROUTING_PRIORITY_UNSPECIFIED)
}
pub fn provider_allowed(&self, provider_id: &str) -> bool {
self.allowed_providers.is_empty()
|| self
.allowed_providers
.iter()
.any(|item| item == provider_id)
}
pub fn key_allowed(&self, key_id: &str) -> bool {
self.allowed_keys.is_empty() || self.allowed_keys.iter().any(|item| item == key_id)
}
}
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct RoutingCandidateFacts {
pub candidate_kind: CandidateKind,
pub provider_id: String,
pub endpoint_id: String,
pub model_id: String,
#[serde(default, skip_serializing_if = "Option::is_none")]
pub key_id: Option<String>,
pub provider_priority: i32,
pub key_priority: i32,
}
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
pub struct RoutingCandidateRankVector {
pub provider_priority_before: i32,
pub provider_priority_after: i32,
pub key_priority_before: i32,
pub key_priority_after: i32,
}
pub fn rank_vector_for_candidate(
overlay: &RankingOverlay,
facts: &RoutingCandidateFacts,
) -> RoutingCandidateRankVector {
RoutingCandidateRankVector {
provider_priority_before: facts.provider_priority,
provider_priority_after: overlay.provider_priority_or_unspecified(&facts.provider_id),
key_priority_before: facts.key_priority,
key_priority_after: match facts.candidate_kind {
CandidateKind::Provider => facts
.key_id
.as_deref()
.map(|key_id| overlay.key_priority_or_unspecified(key_id))
.unwrap_or(ROUTING_PRIORITY_UNSPECIFIED),
CandidateKind::PoolGroup => overlay.pool_priority_or_unspecified(&facts.provider_id),
},
}
}
#[cfg(test)]
mod tests {
use std::collections::BTreeMap;
use super::*;
#[test]
fn overlay_applies_provider_and_key_priority() {
let overlay = RankingOverlay {
provider_priority_overrides: BTreeMap::from([("provider-a".to_string(), 2)]),
key_priority_overrides: BTreeMap::from([("key-a".to_string(), 5)]),
..RankingOverlay::default()
};
let facts = RoutingCandidateFacts {
candidate_kind: CandidateKind::Provider,
provider_id: "provider-a".to_string(),
endpoint_id: "endpoint-a".to_string(),
model_id: "model-a".to_string(),
key_id: Some("key-a".to_string()),
provider_priority: 10,
key_priority: 20,
};
let vector = rank_vector_for_candidate(&overlay, &facts);
assert_eq!(vector.provider_priority_after, 2);
assert_eq!(vector.key_priority_after, 5);
}
#[test]
fn rank_vector_marks_missing_routing_priorities_unspecified() {
let facts = RoutingCandidateFacts {
candidate_kind: CandidateKind::Provider,
provider_id: "provider-a".to_string(),
endpoint_id: "endpoint-a".to_string(),
model_id: "model-a".to_string(),
key_id: Some("key-a".to_string()),
provider_priority: 10,
key_priority: 20,
};
let vector = rank_vector_for_candidate(&RankingOverlay::default(), &facts);
assert_eq!(vector.provider_priority_after, ROUTING_PRIORITY_UNSPECIFIED);
assert_eq!(vector.key_priority_after, ROUTING_PRIORITY_UNSPECIFIED);
}
#[test]
fn rank_vector_uses_pool_priority_for_pool_groups() {
let overlay = RankingOverlay {
pool_priority_overrides: BTreeMap::from([("provider-a".to_string(), 4)]),
..RankingOverlay::default()
};
let facts = RoutingCandidateFacts {
candidate_kind: CandidateKind::PoolGroup,
provider_id: "provider-a".to_string(),
endpoint_id: "endpoint-a".to_string(),
model_id: "model-a".to_string(),
key_id: None,
provider_priority: 10,
key_priority: 20,
};
let vector = rank_vector_for_candidate(&overlay, &facts);
assert_eq!(vector.key_priority_after, 4);
}
}