Struct HeuristicKey 

pub struct HeuristicKey {
    pub m: i32,
    pub n: i32,
    pub k: i32,
    pub dtype: u32,
    pub transa: bool,
    pub transb: bool,
    pub epilogue: Epilogue,
    pub sm_arch: u32,
}

Cache key — fully self-describing so two requests with the same shape/layout/dtype/epilogue/arch trio land in the same bucket.

Fields

m: i32

n: i32

k: i32

dtype: u32

Stable dtype tag. Captured as a u32 (rather than DTypeKind) so the key derives cleanly even if DTypeKind grows new variants.

transa: bool

transb: bool

epilogue: Epilogue

sm_arch: u32

Implementations

impl HeuristicKey

pub fn new( m: i32, n: i32, k: i32, dtype: DTypeKind, transa: bool, transb: bool, epilogue: Epilogue, sm_arch: u32, ) -> Self

Trait Implementations

impl Clone for HeuristicKey

fn clone(&self) -> HeuristicKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HeuristicKey

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

Formats the value using the given formatter.

impl Hash for HeuristicKey

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 HeuristicKey

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

impl Eq for HeuristicKey

impl StructuralPartialEq for HeuristicKey