Struct ScGraph 

pub struct ScGraph {
    pub name: String,
    pub ops: Vec<ScOp>,
    pub(crate) next_id: u32,
}

A complete SC compute graph.

Operations are stored in topological order: every operand referenced by an operation must be defined by an earlier operation.

Fields

name: String

Module name (used as the SV module name during emission).

ops: Vec<ScOp>

Operations in topological (definition) order.

next_id: u32

Next available ValueId counter.

Implementations

impl ScGraph

pub fn new(name: impl Into<String>) -> Self

Create a new empty graph.

pub fn fresh_id(&mut self) -> ValueId

Allocate a fresh ValueId.

pub fn push(&mut self, op: ScOp) -> ValueId

Append an operation and return its result ValueId.

pub fn len(&self) -> usize

Number of operations.

pub fn is_empty(&self) -> bool

Whether the graph is empty.

pub fn inputs(&self) -> Vec<&ScOp>

Collect all Input operations.

pub fn outputs(&self) -> Vec<&ScOp>

Collect all Output operations.

Trait Implementations

impl Clone for ScGraph

fn clone(&self) -> ScGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ScGraph

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

Formats the value using the given formatter.

impl PartialEq for ScGraph

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