Struct NormalizedCsrGraph 

pub struct NormalizedCsrGraph { /* private fields */ }

Owned canonical CSR layout for cache keys, packed graph state, and reuse.

Implementations

impl NormalizedCsrGraph

pub const fn empty() -> Self

Create an empty reusable normalized graph output.

pub fn node_count(&self) -> u32

Number of nodes in the normalized graph domain.

pub fn edge_count(&self) -> u32

Number of canonical edges after duplicate row entries are removed.

pub fn edge_offsets(&self) -> &[u32]

Canonical CSR row offsets.

pub fn edge_targets(&self) -> &[u32]

Canonical CSR edge targets.

pub fn edge_kind_mask(&self) -> &[u32]

Canonical CSR edge-kind masks.

pub fn edge_offsets_capacity(&self) -> usize

Retained canonical offset capacity.

pub fn edge_targets_capacity(&self) -> usize

Retained canonical target capacity.

pub fn edge_kind_mask_capacity(&self) -> usize

Retained canonical edge-kind capacity.

pub fn stable_layout_hash(&self) -> u64

Stable hash of the canonical CSR graph layout.

Cache identity belongs to the shared graph contract: domain size, canonical row offsets, targets, and edge-kind masks. It intentionally excludes transient dispatch buffers such as zeroed ProgramGraph node arrays.

Trait Implementations

impl Clone for NormalizedCsrGraph

fn clone(&self) -> NormalizedCsrGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NormalizedCsrGraph

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

Formats the value using the given formatter.

impl Eq for NormalizedCsrGraph

impl PartialEq for NormalizedCsrGraph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for NormalizedCsrGraph