Struct CsmCudaGraphKey 

pub struct CsmCudaGraphKey {
    pub join_kind: CsmCudaGraphJoinKind,
    pub key_arity: u8,
    pub key_bytes: u32,
    pub probe_capacity_class: u32,
    pub output_capacity_class: u32,
    pub scan_topology: ScanTopology,
    pub node_layout_version: u32,
}

Fields

join_kind: CsmCudaGraphJoinKind

key_arity: u8

key_bytes: u32

probe_capacity_class: u32

output_capacity_class: u32

scan_topology: ScanTopology

node_layout_version: u32

Implementations

impl CsmCudaGraphKey

pub fn inner( key_arity: usize, key_bytes: u32, probe_capacity: u32, output_capacity: u32, ) -> Result<Self>

Trait Implementations

impl Clone for CsmCudaGraphKey

fn clone(&self) -> CsmCudaGraphKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CsmCudaGraphKey

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

Formats the value using the given formatter.

impl Hash for CsmCudaGraphKey

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 CsmCudaGraphKey

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

impl StructuralPartialEq for CsmCudaGraphKey