Expand description
Arity of a compound structure.
MeshArity
represents the arity of a compound structure, which may be
uniform or non-uniform. This is typically the value-level arity for
mesh data structures like MeshGraph
and MeshBuffer
.
Variants
Uniform(usize)
A compound structure has uniform arity if all of its components have
the same arity, such as a MeshBuffer
composed entirely of trigons.
NonUniform(usize, usize)
A compound structure has non-uniform arity if the arity of its
components differ, such as a MeshGraph
composed of trigons and
tetragons.
Non-uniform arity is represented as an inclusive range known as an interval. This is the minimum and maximum arity of the components, in that order.
Implementations
sourceimpl MeshArity
impl MeshArity
pub fn from_components<T, I>(components: I) -> Self where
T: DynamicArity<Dynamic = usize>,
I: IntoIterator,
I::Item: Borrow<T>,
Trait Implementations
impl Copy for MeshArity
impl StructuralPartialEq for MeshArity
Auto Trait Implementations
impl RefUnwindSafe for MeshArity
impl Send for MeshArity
impl Sync for MeshArity
impl Unpin for MeshArity
impl UnwindSafe for MeshArity
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> FromGeometry<T> for T
impl<T> FromGeometry<T> for T
fn from_geometry(other: T) -> T
sourceimpl<T, U> IntoGeometry<U> for T where
U: FromGeometry<T>,
impl<T, U> IntoGeometry<U> for T where
U: FromGeometry<T>,
fn into_geometry(self) -> U
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
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.