Struct Graph 

pub struct Graph<'a> {
    pub name: &'a str,
    pub tensors: &'a [Tensor<'a>],
    pub shapes: &'a [Shape<'a>],
    pub operators: &'a [Operator<'a>],
    pub inputs: &'a [&'a str],
    pub outputs: &'a [&'a str],
}

A static TOSA graph containing one region and one basic block.

Fields

name: &'a str

tensors: &'a [Tensor<'a>]

shapes: &'a [Shape<'a>]

operators: &'a [Operator<'a>]

inputs: &'a [&'a str]

outputs: &'a [&'a str]

Implementations

impl<'a> Graph<'a>

pub const fn new( name: &'a str, tensors: &'a [Tensor<'a>], operators: &'a [Operator<'a>], inputs: &'a [&'a str], outputs: &'a [&'a str], ) -> Self

pub const fn with_shapes(self, shapes: &'a [Shape<'a>]) -> Self

Add compile-time shape values to this graph.

pub fn build(self, target: Target) -> Result<Vec<u8>, BuildError>

Serialize and semantically validate this graph for target.

The returned vector is the only allocation retained by the caller. Construction is linear in graph metadata and constant bytes. Validation runs once on this cold authoring path; providers still perform their own authoritative admission during load_program.

Trait Implementations

impl<'a> Clone for Graph<'a>

fn clone(&self) -> Graph<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for Graph<'a>

impl<'a> Debug for Graph<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for Graph<'a>

impl<'a> From<Graph<'a>> for OwnedGraph<'a>

fn from(graph: Graph<'a>) -> Self

Converts to this type from the input type.

impl<'a> PartialEq for Graph<'a>

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