Struct CacheKey 

pub struct CacheKey {
    pub plan_hash: u64,
    pub capability_version: u64,
}

Composite cache lookup key: plan-hash + capability version.

Fields

plan_hash: u64

SipHash digest of the plan’s postcard byte form.

capability_version: u64

CapabilityIndex::version() snapshot at plan time.

Implementations

impl CacheKey

pub fn for_plan(plan: &ExecutionPlan, capability_version: u64) -> Option<Self>

Hash a plan into a cache key for the given capability version. Per locked decision #1, plans are byte-identical- deterministic, so encode + hash is stable across runs.

Returns None when the plan contains a node postcard can’t encode (currently: any Filter / Discovered node, because PredicateWire uses #[serde(tag)]). Callers treat that as a transparent cache bypass.

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 Copy for CacheKey

impl Debug for CacheKey

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

Formats the value using the given formatter.

impl Eq for CacheKey

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 StructuralPartialEq for CacheKey