Struct CacheKey 

pub struct CacheKey {
    pub graph_id: Option<String>,
    pub node_id: usize,
    pub input_hash: u64,
}

Cache key for tensor identification

Fields

graph_id: Option<String>

node_id: usize

input_hash: u64

Implementations

impl CacheKey

pub fn new(node_id: usize) -> Self

pub fn with_graph(self, graph_id: impl Into<String>) -> Self

pub fn with_inputs<T: Hash>(self, inputs: &[T]) -> 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 Eq for CacheKey

impl StructuralPartialEq for CacheKey