Struct GraphAnalysis 

pub struct GraphAnalysis {
    pub execution_order: Vec<usize>,
    pub parallel_levels: Vec<Vec<usize>>,
}

Combined graph analysis results for Salsa tracking.

This struct caches both execution order and parallel levels computed from a single graph construction, eliminating redundant graph builds. Both fields are computed together since they require the same GraphEngine.

Fields

execution_order: Vec<usize>

Topological execution order (cell indices)

parallel_levels: Vec<Vec<usize>>

Parallel execution levels (groups of cell indices that can run concurrently)

Implementations

impl GraphAnalysis

pub fn empty() -> Self

Create an empty analysis (no cells or graph error).

pub fn is_empty(&self) -> bool

Check if the analysis is empty (no cells to execute).

Trait Implementations

impl Clone for GraphAnalysis

fn clone(&self) -> GraphAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphAnalysis

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

Formats the value using the given formatter.

impl Hash for GraphAnalysis

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 GraphAnalysis

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

impl StructuralPartialEq for GraphAnalysis