pub struct Simplex {
pub vertices: Vec<usize>,
pub dimension: usize,
pub filtration: f64,
}Expand description
A simplex defined by its vertices, dimension, and filtration value.
A k-simplex has k+1 vertices (e.g., 0-simplex = vertex, 1-simplex = edge).
Fields§
§vertices: Vec<usize>Sorted vertex indices forming this simplex.
dimension: usizeHomological dimension (0 = vertex, 1 = edge, 2 = triangle, …).
filtration: f64Filtration value at which this simplex enters the complex.
Implementations§
Source§impl Simplex
impl Simplex
Sourcepub fn new(vertices: Vec<usize>, filtration: f64) -> Self
pub fn new(vertices: Vec<usize>, filtration: f64) -> Self
Create a new simplex from a list of vertices and filtration value.
The dimension is inferred as vertices.len() - 1.
Vertices are sorted in ascending order.
Trait Implementations§
impl StructuralPartialEq for Simplex
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.