Struct CubicalCell 

pub struct CubicalCell {
    pub coordinates: Vec<usize>,
    pub dimension: usize,
}

A single cell in a cubical complex.

Cells are identified by their grid coordinates and dimension.

• 0-cell (vertex): coordinates are integer grid indices [x, y]
• 1-cell (edge): one coordinate is half-integer (encoded as doubled + 1)
• 2-cell (face): two coordinates are half-integer
• 3-cell (voxel): three coordinates are half-integer

To avoid floating point, we use “doubled coordinates”: each coordinate is stored as 2*k for integers (vertices) and 2*k+1 for half-integers (edge midpoints).

Fields

coordinates: Vec<usize>

Doubled coordinates: even entries are integer, odd entries are half-integer.

dimension: usize

Dimension of the cell (number of coordinates that are odd / half-integer).

Implementations

impl CubicalCell

pub fn new(coordinates: Vec<usize>) -> Self

Construct a cell from doubled coordinates (validity is checked by counting odd entries).

pub fn sort_key(&self) -> (usize, &[usize])

Return the lexicographic sort key: (dimension, coordinates).

Trait Implementations

impl Clone for CubicalCell

fn clone(&self) -> CubicalCell

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CubicalCell

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

Formats the value using the given formatter.

impl Hash for CubicalCell

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 PartialEq for CubicalCell

fn eq(&self, other: &CubicalCell) -> 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 Eq for CubicalCell

impl StructuralPartialEq for CubicalCell