pub struct Flat<const SHAPE: u32>;Expand description
The Topology of a graph with no deps: edges anywhere: zero-sized,
every dep list is empty by type, and the topological order is declaration
order. The walks a Supervisor runs over it fold to plain index loops,
and the dependency cascades (activate, deactivate, restart) collapse
to their seed sets.
Implementations§
Trait Implementations§
Source§impl<const N: usize, const SHAPE: u32> Topology<N> for Flat<SHAPE>
impl<const N: usize, const SHAPE: u32> Topology<N> for Flat<SHAPE>
Source§const SHAPE: u32 = SHAPE
const SHAPE: u32 = SHAPE
Structural-fact bits (see
shape). An unset bit promises the
structure is absent from the whole graph.Auto Trait Implementations§
impl<const SHAPE: u32> Freeze for Flat<SHAPE>
impl<const SHAPE: u32> RefUnwindSafe for Flat<SHAPE>
impl<const SHAPE: u32> Send for Flat<SHAPE>
impl<const SHAPE: u32> Sync for Flat<SHAPE>
impl<const SHAPE: u32> Unpin for Flat<SHAPE>
impl<const SHAPE: u32> UnsafeUnpin for Flat<SHAPE>
impl<const SHAPE: u32> UnwindSafe for Flat<SHAPE>
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