Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub by_name: BTreeMap<Arc<str>, SigId>,
    pub dep: DepGraph,
    pub cuts: Vec<Cut>,
    pub sinks: Vec<SigId>,
}

The signal graph of one program.

Fields

nodes: Vec<Node>

by_name: BTreeMap<Arc<str>, SigId>

Declared signal names to their vertices. Inner vertices are not in here — they have no name a program can write.

dep: DepGraph

The condensation, for cycles and for order.

cuts: Vec<Cut>

sinks: Vec<SigId>

Vertices nothing reads. A view is one; so is a materialised read model.

Implementations

impl Graph

pub fn node(&self, id: SigId) -> &Node

pub fn order(&self) -> Vec<SigId>

Every vertex, dependencies before dependents, cycle members adjacent.

pub fn consumers(&self, id: SigId) -> Vec<SigId>

What reads this vertex.

pub fn find(&self, f: impl Fn(&Op) -> bool) -> Vec<SigId>

pub fn states(&self) -> Vec<SigId>

The durable accumulators, in declaration order — what the log is of.

pub fn ingress(&self) -> Vec<SigId>

pub fn presences(&self) -> Vec<SigId>

The connection sets — what is not in the log.

pub fn decides(&self) -> Vec<SigId>

pub fn label(&self, id: SigId) -> &str

The name a report should use for a vertex.

pub fn build(program: &Program, diags: &mut Diagnostics) -> Option<Graph>

Build the graph a checked program declares, or refuse it by name.

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

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.