pub struct DataflowOrder { /* private fields */ }
Expand description
Given a set of assignment, generates an ordering that respects combinatinal dataflow.
Implementations§
Source§impl DataflowOrder
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>>>
Auto Trait Implementations§
impl Freeze for DataflowOrder
impl RefUnwindSafe for DataflowOrder
impl Send for DataflowOrder
impl Sync for DataflowOrder
impl Unpin for DataflowOrder
impl UnwindSafe for DataflowOrder
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more