Struct CacheAware 

pub struct CacheAware { /* private fields */ }

A relative prefill-work policy. Its scores are not latency predictions.

Implementations

impl CacheAware

pub fn new(costs: Vec<f64>, max_age: Duration) -> Result<Self>

Costs correspond to runtime targets in order; all must be finite and positive.

Trait Implementations

impl Algorithm for CacheAware

fn name(&self) -> &str

Stable, low-cardinality name identifying this algorithm — the algorithm attribute on every span, metric, and log line the crate emits for its runs.

fn route<'async_trait>( self: Arc<Self>, driver: Driver, request: Request, ) -> Pin<Box<dyn Future<Output = Result<RoutingOutcome>> + Send + 'async_trait>>

where Self: 'async_trait,

Select a route, requesting external work through Driver as needed. run_stream runs this method and exposes its work to the host.

fn run_stream( self: Arc<Self>, request: Request, models: Arc<RuntimeModels>, ) -> StepStream

Expose work requests and the final outcome so the host can control execution.