pub struct SmoothReport {
pub max: f64,
pub rms: f64,
pub limited: usize,
}Expand description
What a smoothing moved.
Fields§
§max: f64The farthest a vertex ended from where it started.
rms: f64The root mean square of how far each vertex with a face ended from where it started.
limited: usizeHow many vertices max_move held back.
Trait Implementations§
Source§impl Clone for SmoothReport
impl Clone for SmoothReport
impl Copy for SmoothReport
Source§impl Debug for SmoothReport
impl Debug for SmoothReport
Source§impl PartialEq for SmoothReport
impl PartialEq for SmoothReport
impl StructuralPartialEq for SmoothReport
Auto Trait Implementations§
impl Freeze for SmoothReport
impl RefUnwindSafe for SmoothReport
impl Send for SmoothReport
impl Sync for SmoothReport
impl Unpin for SmoothReport
impl UnsafeUnpin for SmoothReport
impl UnwindSafe for SmoothReport
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.