pub struct ResidentGraphCacheIdentity {
pub domain: ResidentGraphCacheDomain,
pub backend_id: &'static str,
pub backend_version: &'static str,
pub layout_hash: u64,
pub node_count: u32,
pub edge_count: u32,
pub frontier_words: u32,
}Expand description
Backend-neutral resident graph cache identity shared by IFDS and fixed-point resident caches.
The tuple is intentionally not just layout_hash: resident handles are
backend-owned, backend-version-sensitive resources, and solver scratch
compatibility depends on the shape carried beside the layout hash.
Fields§
§domain: ResidentGraphCacheDomainResident cache domain and analysis family.
backend_id: &'static strStable backend/device family id.
backend_version: &'static strStable backend implementation version.
layout_hash: u64Deterministic graph layout/content hash.
node_count: u32Graph node count used by resident solver scratch.
edge_count: u32Graph edge count used by resident uploads and diagnostics.
frontier_words: u32Frontier bitset word count required by the resident solve.
Implementations§
Source§impl ResidentGraphCacheIdentity
impl ResidentGraphCacheIdentity
Sourcepub const fn ifds_csr(
backend_id: &'static str,
backend_version: &'static str,
layout_hash: u64,
node_count: u32,
edge_count: u32,
frontier_words: u32,
) -> Self
pub const fn ifds_csr( backend_id: &'static str, backend_version: &'static str, layout_hash: u64, node_count: u32, edge_count: u32, frontier_words: u32, ) -> Self
Identity for a prepared IFDS resident CSR.
Sourcepub const fn fixed_point(
backend_id: &'static str,
backend_version: &'static str,
analysis_kind: FixedPointAnalysisKind,
layout_hash: u64,
node_count: u32,
edge_count: u32,
frontier_words: u32,
) -> Self
pub const fn fixed_point( backend_id: &'static str, backend_version: &'static str, analysis_kind: FixedPointAnalysisKind, layout_hash: u64, node_count: u32, edge_count: u32, frontier_words: u32, ) -> Self
Identity for a fixed-point resident graph.
Sourcepub fn stable_digest64(&self) -> u64
pub fn stable_digest64(&self) -> u64
Tuple-boundary-preserving 64-bit digest for compact release evidence.
Sourcepub fn cmp_stable(&self, other: &Self) -> Ordering
pub fn cmp_stable(&self, other: &Self) -> Ordering
Deterministic ordering for cache snapshots and release evidence.
Trait Implementations§
Source§impl Clone for ResidentGraphCacheIdentity
impl Clone for ResidentGraphCacheIdentity
Source§fn clone(&self) -> ResidentGraphCacheIdentity
fn clone(&self) -> ResidentGraphCacheIdentity
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ResidentGraphCacheIdentity
impl Debug for ResidentGraphCacheIdentity
impl Eq for ResidentGraphCacheIdentity
Source§impl Hash for ResidentGraphCacheIdentity
impl Hash for ResidentGraphCacheIdentity
impl StructuralPartialEq for ResidentGraphCacheIdentity
Auto Trait Implementations§
impl Freeze for ResidentGraphCacheIdentity
impl RefUnwindSafe for ResidentGraphCacheIdentity
impl Send for ResidentGraphCacheIdentity
impl Sync for ResidentGraphCacheIdentity
impl Unpin for ResidentGraphCacheIdentity
impl UnsafeUnpin for ResidentGraphCacheIdentity
impl UnwindSafe for ResidentGraphCacheIdentity
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.