pub struct Simplex {
pub name: String,
pub members: Vec<u64>,
pub dimension: u8,
}Expand description
A simplex — a named record of jointly-required cells/graph shapes (T49).
A simplex declares that a set of cells (or graph shapes) must all be present together. If any member is missing, the load or commit is rejected. This is the “jointly-required” constraint: you can’t have a face without its edges, or an edge without its vertices.
Fields§
§name: StringHuman-readable name (e.g. “triangle”, “tetrahedron”).
members: Vec<u64>The IDs of the jointly-required members.
dimension: u8The dimension of the simplex (0=vertex, 1=edge, 2=face, 3=cell, …).
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Simplex
impl RefUnwindSafe for Simplex
impl Send for Simplex
impl Sync for Simplex
impl Unpin for Simplex
impl UnsafeUnpin for Simplex
impl UnwindSafe for Simplex
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