Struct DirectResidentIfdsGraphKey 

pub struct DirectResidentIfdsGraphKey { /* private fields */ }

Opaque identity for a stable direct-resident IFDS graph.

Build this once for an invariant graph, then pass it to [DirectResidentIfdsBatch::solve_many_with_graph_key] or [DirectResidentIfdsBatch::solve_with_graph_key] to avoid re-hashing every edge family at the call site. The keyed solve path still checks the graph dimensions, edge-family lengths, and edge-family hash before touching resident cache state.

Implementations

impl DirectResidentIfdsGraphKey

pub fn from_edges( num_procs: u32, blocks_per_proc: u32, facts_per_proc: u32, intra_edges: &[(u32, u32, u32)], inter_edges: &[(u32, u32, u32, u32)], flow_gen: &[(u32, u32, u32)], flow_kill: &[(u32, u32, u32)], ) -> Self

Build a stable graph key from IFDS dimensions and invariant edge families.

Trait Implementations

impl Clone for DirectResidentIfdsGraphKey

fn clone(&self) -> DirectResidentIfdsGraphKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DirectResidentIfdsGraphKey

impl Debug for DirectResidentIfdsGraphKey

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

Formats the value using the given formatter.

impl Eq for DirectResidentIfdsGraphKey

impl Hash for DirectResidentIfdsGraphKey

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 DirectResidentIfdsGraphKey

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for DirectResidentIfdsGraphKey