Struct Graph 

pub struct Graph { /* private fields */ }

A graph is only constructed through GraphBuilder::finish, which verifies it.

Implementations

impl Graph

pub fn values(&self) -> &[Value]

pub fn value(&self, id: ValueId) -> &Value

pub fn inputs(&self) -> &[ValueId]

Graph inputs in declared order.

pub fn outputs(&self) -> &[ValueId]

pub fn output_names(&self) -> &[String]

pub fn label(&self, id: ValueId) -> String

The value’s name, or %<id> when it has none.

impl Graph

pub fn verify(&self) -> Result<(), Error>

pub fn verify_limits(&self, limits: &Limits) -> Result<(), Error>

Re-checks the resource limits the builder enforced. The builder cannot build a graph that breaks them, so this exists for the pass manager: a pass must not grow a graph past the limits it started under.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.

impl Display for Graph

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

Formats the value using the given formatter.

impl Eq for Graph

impl PartialEq for Graph

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Graph