pub struct Ordered<const N: usize, const SHAPE: u32> { /* private fields */ }Expand description
A Topology whose nodes are topologically sorted by their deps: edges.
Implementations§
Trait Implementations§
Source§impl<const N: usize, const SHAPE: u32> Topology<N> for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> Topology<N> for Ordered<N, 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 N: usize, const SHAPE: u32> Freeze for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> RefUnwindSafe for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> Send for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> Sync for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> Unpin for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> UnsafeUnpin for Ordered<N, SHAPE>
impl<const N: usize, const SHAPE: u32> UnwindSafe for Ordered<N, 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