Struct CacheKey 

pub struct CacheKey {
    pub eval_key: String,
    pub deps_hash: u64,
}

Cache key: combines evaluation logic ID with hash of all dependent values Zero-copy design: stores references to logic and dependency paths

Fields

eval_key: String

Evaluation key (e.g., “$params.foo”)

deps_hash: u64

Single hash of all dependency values combined (for efficiency)

Implementations

impl CacheKey

pub fn new( eval_key: String, dependencies: &IndexSet<String>, values: &[(String, &Value)], ) -> Self

Create cache key from evaluation key and dependency values Dependencies are pre-filtered by caller (JSONEval) Hashes all dependency values together in one pass for efficiency

pub fn simple(eval_key: String) -> Self

Create a simple cache key without dependencies (for evaluations with no deps)

Trait Implementations

impl Clone for CacheKey

fn clone(&self) -> CacheKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CacheKey

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

Formats the value using the given formatter.

impl Hash for CacheKey

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 CacheKey

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

impl StructuralPartialEq for CacheKey