Struct splashsurf_lib::mesh::HexCell
source · #[repr(transparent)]pub struct HexCell(pub [usize; 8]);
Expand description
Cell type for HexMesh3d
Tuple Fields§
§0: [usize; 8]
Trait Implementations§
source§impl CellConnectivity for HexCell
impl CellConnectivity for HexCell
source§fn expected_num_vertices() -> usize
fn expected_num_vertices() -> usize
Returns the expected number of vertices per cell (helpful for connectivities with a constant or upper bound on the number of vertices to reserve storage)
source§fn vertices(&self) -> &[usize]
fn vertices(&self) -> &[usize]
Returns a reference to the vertex indices connected by this cell
source§fn vertices_mut(&mut self) -> &mut [usize]
fn vertices_mut(&mut self) -> &mut [usize]
Returns a reference to the vertex indices connected by this cell
source§fn num_vertices(&self) -> usize
fn num_vertices(&self) -> usize
Returns the number of vertices per cell (may vary between cells)
source§impl HasVtkCellType for HexCell
Available on crate feature vtk_extras
only.
impl HasVtkCellType for HexCell
Available on crate feature
vtk_extras
only.source§fn vtk_cell_type(&self) -> CellType
fn vtk_cell_type(&self) -> CellType
Returns the corresponding
vtkio::model::CellType
of the cellimpl Copy for HexCell
impl Pod for HexCell
Auto Trait Implementations§
impl RefUnwindSafe for HexCell
impl Send for HexCell
impl Sync for HexCell
impl Unpin for HexCell
impl UnwindSafe for HexCell
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> CheckedBitPattern for Twhere
T: AnyBitPattern,
impl<T> CheckedBitPattern for Twhere T: AnyBitPattern,
§type Bits = T
type Bits = T
Self
must have the same layout as the specified Bits
except for
the possible invalid bit patterns being checked during
is_valid_bit_pattern
.source§fn is_valid_bit_pattern(_bits: &T) -> bool
fn is_valid_bit_pattern(_bits: &T) -> bool
If this function returns true, then it must be valid to reinterpret
bits
as &Self
.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.