Struct fj_kernel::algorithms::approx::cycle::CycleApprox
source · [−]pub struct CycleApprox {
pub half_edges: Vec<HalfEdgeApprox>,
}Expand description
An approximation of a Cycle
Fields
half_edges: Vec<HalfEdgeApprox>The approximated edges that make up the approximated cycle
Implementations
sourceimpl CycleApprox
impl CycleApprox
Trait Implementations
sourceimpl Debug for CycleApprox
impl Debug for CycleApprox
sourceimpl Hash for CycleApprox
impl Hash for CycleApprox
sourceimpl Ord for CycleApprox
impl Ord for CycleApprox
sourcefn cmp(&self, other: &CycleApprox) -> Ordering
fn cmp(&self, other: &CycleApprox) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl PartialEq<CycleApprox> for CycleApprox
impl PartialEq<CycleApprox> for CycleApprox
sourcefn eq(&self, other: &CycleApprox) -> bool
fn eq(&self, other: &CycleApprox) -> bool
sourceimpl PartialOrd<CycleApprox> for CycleApprox
impl PartialOrd<CycleApprox> for CycleApprox
sourcefn partial_cmp(&self, other: &CycleApprox) -> Option<Ordering>
fn partial_cmp(&self, other: &CycleApprox) -> Option<Ordering>
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self and other) and is used by the <=
operator. Read moreimpl Eq for CycleApprox
impl StructuralEq for CycleApprox
impl StructuralPartialEq for CycleApprox
Auto Trait Implementations
impl !RefUnwindSafe for CycleApprox
impl !Send for CycleApprox
impl !Sync for CycleApprox
impl Unpin for CycleApprox
impl !UnwindSafe for CycleApprox
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
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
impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read morefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read morefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s. Read morefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s. Read moreimpl<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 morefn 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.