pub struct Rim {
pub edges: Vec<u32>,
pub length: f64,
pub span: f64,
}Expand description
A closed loop of open edges.
Fields§
§edges: Vec<u32>Its half-edges, each starting where the one before ended, starting from the lowest-numbered and running with the faces on the left, as the faces wind.
length: f64The sum of the edges’ lengths.
span: f64The greatest distance between two of its vertices.
Implementations§
Trait Implementations§
impl StructuralPartialEq for Rim
Auto Trait Implementations§
impl Freeze for Rim
impl RefUnwindSafe for Rim
impl Send for Rim
impl Sync for Rim
impl Unpin for Rim
impl UnsafeUnpin for Rim
impl UnwindSafe for Rim
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> Scalar 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.