Skip to main content

AdaptiveTraversalPlanCacheKey

Struct AdaptiveTraversalPlanCacheKey 

Source
pub struct AdaptiveTraversalPlanCacheKey {
    pub layout_hash: u64,
    pub node_count: u32,
    pub edge_count: u32,
    pub words: u32,
    pub queue_capacity: u32,
    pub allow_mask: u32,
    pub dense_threshold_pct: u32,
    pub device_features: u64,
    pub kind: AdaptiveTraversalProgramKind,
}
Expand description

Stable cache key for resident adaptive traversal Programs.

The key deliberately includes program layout identity, frontier width, queue capacity, traversal masks, threshold policy, and backend feature bits so a cached Program cannot be reused across incompatible CUDA/WGSL/SPIR-V shapes. Resident graph contents are represented by dispatch handles, not shader source, so same-shape resident graphs reuse compiled Programs.

Fields§

§layout_hash: u64

Shape-only hash of the resident Program layout.

§node_count: u32

Number of graph nodes.

§edge_count: u32

Number of logical CSR edges.

§words: u32

Number of u32 words in one frontier bitset.

§queue_capacity: u32

Active-source queue capacity for sparse-queue Programs.

§allow_mask: u32

Allowed edge-kind mask baked into traversal Programs.

§dense_threshold_pct: u32

Dense cutover threshold baked into sparse/dense Programs.

§device_features: u64

Backend feature fingerprint from the dispatcher.

§kind: AdaptiveTraversalProgramKind

Resident Program shape represented by this key.

Implementations§

Source§

impl AdaptiveTraversalPlanCacheKey

Source

pub const fn new( layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, allow_mask: u32, dense_threshold_pct: u32, device_features: u64, kind: AdaptiveTraversalProgramKind, ) -> Self

Construct a cache key for a resident adaptive traversal Program.

Source

pub const fn popcount( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, device_features: u64, ) -> Self

Cache key for the frontier popcount Program.

Source

pub const fn clear_frontier_out( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, device_features: u64, ) -> Self

Cache key for clearing the output frontier.

Source

pub const fn sparse_dense( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, allow_mask: u32, dense_threshold_pct: u32, device_features: u64, ) -> Self

Cache key for device-selected sparse/dense traversal.

Source

pub const fn queue_len_init( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, device_features: u64, ) -> Self

Cache key for the active-queue length initialization Program.

Source

pub const fn frontier_to_queue( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, device_features: u64, ) -> Self

Cache key for frontier-to-active-queue compaction.

Source

pub const fn frontier_word_counts( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, device_features: u64, ) -> Self

Cache key for packed-frontier word-count scan.

Source

pub const fn frontier_word_block_offsets( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, device_features: u64, ) -> Self

Cache key for packed-frontier block-offset scan.

Source

pub const fn frontier_word_prefix_queue( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, device_features: u64, ) -> Self

Cache key for deterministic packed-frontier queue scatter.

Source

pub const fn frontier_word_block_offsets_queue( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, device_features: u64, ) -> Self

Cache key for deterministic packed-frontier queue scatter with block offsets.

Source

pub const fn queue_forward( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, allow_mask: u32, device_features: u64, ) -> Self

Cache key for queue-driven CSR traversal.

Source

pub const fn queue_forward_strided( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, allow_mask: u32, device_features: u64, ) -> Self

Cache key for row-strided queue-driven CSR traversal.

Source

pub const fn queue_split_low( _layout_hash: u64, node_count: u32, edge_count: u32, words: u32, queue_capacity: u32, high_queue_capacity: u32, high_degree_threshold: u32, allow_mask: u32, device_features: u64, ) -> Self

Cache key for the low-row half of mixed queue-driven CSR traversal.

Source

pub const fn four_russians_dense( _layout_hash: u64, node_count: u32, words: u32, device_features: u64, ) -> Self

Cache key for dense Four-Russians traversal through a resident LUT.

Trait Implementations§

Source§

impl Clone for AdaptiveTraversalPlanCacheKey

Source§

fn clone(&self) -> AdaptiveTraversalPlanCacheKey

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for AdaptiveTraversalPlanCacheKey

Source§

impl Debug for AdaptiveTraversalPlanCacheKey

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Eq for AdaptiveTraversalPlanCacheKey

Source§

impl Hash for AdaptiveTraversalPlanCacheKey

Source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for AdaptiveTraversalPlanCacheKey

Source§

fn eq(&self, other: &AdaptiveTraversalPlanCacheKey) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for AdaptiveTraversalPlanCacheKey

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more