Struct CellBox 

pub struct CellBox { /* private fields */ }

A box of primary cells: lo[a] ≤ cell[a] < hi[a] (node indices).

Implementations

impl CellBox

pub fn new(a: [usize; 3], b: [usize; 3]) -> Self

The cells between the nodes a and b (corners in any order). Along an axis where a and b coincide the box is extended to the cell above the node (or below it at the last node), so that every box holds at least one cell per axis.

pub fn whole(grid: &Grid) -> Self

Every cell of grid.

pub fn fitted(self, nodes: [usize; 3]) -> Result<Self>

Clamps degenerate axes to one cell and checks that the box fits a grid of nodes nodes (at least 2 per axis).

pub fn lo(&self) -> [usize; 3]

Lowest node (the lower corner of the first cell).

pub fn hi(&self) -> [usize; 3]

Highest node (exclusive cell bound).

pub fn cells(&self) -> [usize; 3]

Number of cells per axis.

pub fn num_cells(&self) -> usize

Total number of cells.

pub fn lines<'g>(&self, grid: &'g Grid, axis: Axis) -> &'g [f64]

The node lines of the box along axis [m] (cells + 1 values).

Trait Implementations

impl Clone for CellBox

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for CellBox

impl Debug for CellBox

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

Formats the value using the given formatter.

impl Eq for CellBox

impl Hash for CellBox

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 CellBox

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for CellBox