Struct Simplex 

pub struct Simplex<const N: usize> {
    pub neighbours: [usize; N],
    pub vertices: [usize; N],
}

Euclidean (N-1)-simplex, built from N vertices.

The intended neighbours and vertices ordering is such that the vertex corresponding to a neighbouring simplex is the vertex opposite the simplex. Additionally the overall ordering is supposed to be consistent, such that the simplices are oriented.

Fields

neighbours: [usize; N]

vertices: [usize; N]

Implementations

impl<const N: usize> Simplex<N>

Methods for working with Simplex<N> when neighbours are encoded by half-faces, see Triangulation

pub fn get_neighbour(&self, index: usize) -> usize

Returns the label of the neighbouring (N-1)-simplex on the index side.

Panic

This method will panic index >= N

pub fn get_neighbour_backindex(&self, index: usize) -> (usize, usize)

Returns the label and backindex of neighbouring (N-1)-simplex on the index side.

Panic

This method will panic index >= N

pub fn get_neighbours(&self) -> [usize; N]

Returns the neighbouring (N-1)-simplex labels of the Simplex

pub fn get_neighbours_backindices(&self) -> [(usize, usize); N]

Returns the neighbouring (N-1)-simplex labels and back indices in tuple pairs

Trait Implementations

impl<const N: usize> Clone for Simplex<N>

fn clone(&self) -> Simplex<N>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const N: usize> Debug for Simplex<N>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const N: usize> Default for Simplex<N>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, const N: usize> Deserialize<'de> for Simplex<N>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, const N: usize> From<CausalSimplex<K, N>> for Simplex<N>

fn from(value: CausalSimplex<K, N>) -> Self

Convert CausalSimplex to Simplex by simply dropping time and kind information.

impl<const N: usize> Hash for Simplex<N>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<const N: usize> PartialEq for Simplex<N>

fn eq(&self, other: &Simplex<N>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const N: usize> Serialize for Simplex<N>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<const N: usize> Copy for Simplex<N>

impl<const N: usize> Eq for Simplex<N>

impl<const N: usize> StructuralPartialEq for Simplex<N>