Struct AiCacheKey 

pub struct AiCacheKey {
    pub content_hash: u128,
    pub model_id: u32,
    pub task: Task,
    pub params_version: u64,
}

Cache key. All fields are Copy, so lookups need no allocation and no borrowed-key indirection.

• content_hash: xxh3-128 of the input text (see content_hash).
• model_id: a stable per-model integer assigned by the caller (the registry), distinguishing models without hashing their names on lookup.
• params_version: a hash of the request parameters (see params_version).

Fields

content_hash: u128

xxh3-128 hash of the input content.

model_id: u32

Stable integer id of the model.

task: Task

The task — a model can serve several (e.g. classify and sentiment), and they produce different outputs for the same input, so it must key the cache or results would collide across tasks.

params_version: u64

Hash of the request parameters that affect the output.

Trait Implementations

impl Clone for AiCacheKey

fn clone(&self) -> AiCacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AiCacheKey

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

Formats the value using the given formatter.

impl Hash for AiCacheKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for AiCacheKey

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

impl Eq for AiCacheKey

impl StructuralPartialEq for AiCacheKey