Struct calyx_opt::analysis::DataflowOrder

pub struct DataflowOrder { /* private fields */ }

Given a set of assignment, generates an ordering that respects combinatinal dataflow.

Implementations

impl DataflowOrder

pub fn new<'a>( primitives: impl Iterator<Item = &'a Primitive> ) -> CalyxResult<Self>

pub fn dataflow_sort<T>( &self, assigns: Vec<Assignment<T>> ) -> CalyxResult<Vec<Assignment<T>>>where T: ToString + Clone + Eq,