Struct CacheKey 

pub struct CacheKey(pub Hash128);

Compose a cache key for one node evaluation.

The key folds together:

• the canvas (tile_size + pad), so cached buffers always match shape
• the tile id (or omitted for world-anchored nodes)
• the node’s own param hash
• each input’s cache hash (Merkle-style chain)

Tuple Fields

0: Hash128

Implementations

impl CacheKey

pub fn build( canvas: CanvasInfo, tile: Option<TileId>, params_hash: Hash128, inputs: &[Hash128], ) -> Self

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

impl Eq for CacheKey

impl StructuralPartialEq for CacheKey