pub struct Cycle { /* private fields */ }Expand description
A cycle of connected half-edges
Implementations§
source§impl Cycle
impl Cycle
sourcepub fn new(half_edges: impl IntoIterator<Item = Handle<HalfEdge>>) -> Self
pub fn new(half_edges: impl IntoIterator<Item = Handle<HalfEdge>>) -> Self
sourcepub fn half_edges(&self) -> HalfEdgesOfCycle<'_>
pub fn half_edges(&self) -> HalfEdgesOfCycle<'_>
Access the half-edges that make up the cycle
Trait Implementations§
source§impl Approx for &Cycle
impl Approx for &Cycle
§type Approximation = CycleApprox
type Approximation = CycleApprox
The approximation of the object
§type Cache = CurveCache
type Cache = CurveCache
The cache used to cache approximation results
source§fn approx_with_cache(
self,
tolerance: impl Into<Tolerance>,
cache: &mut Self::Cache
) -> Self::Approximation
fn approx_with_cache(
self,
tolerance: impl Into<Tolerance>,
cache: &mut Self::Cache
) -> Self::Approximation
Approximate the object, using the provided cache Read more
source§impl HasPartial for Cycle
impl HasPartial for Cycle
§type Partial = PartialCycle
type Partial = PartialCycle
The type representing the partial variant of this object
source§impl Ord for Cycle
impl Ord for Cycle
source§impl PartialEq<Cycle> for Cycle
impl PartialEq<Cycle> for Cycle
source§impl PartialOrd<Cycle> for Cycle
impl PartialOrd<Cycle> for Cycle
1.0.0 · source§fn 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 moresource§impl TransformObject for Cycle
impl TransformObject for Cycle
source§fn transform_with_cache(
self,
transform: &Transform,
objects: &mut Service<Objects>,
cache: &mut TransformCache
) -> Self
fn transform_with_cache(
self,
transform: &Transform,
objects: &mut Service<Objects>,
cache: &mut TransformCache
) -> Self
Transform the object using the provided cache
source§fn transform(self, transform: &Transform, objects: &mut Service<Objects>) -> Self
fn transform(self, transform: &Transform, objects: &mut Service<Objects>) -> Self
Transform the object
source§impl Validate for Cycle
impl Validate for Cycle
§type Error = CycleValidationError
type Error = CycleValidationError
The error that validation of the implementing type can result in
source§fn validate_with_config(&self, _: &ValidationConfig) -> Result<(), Self::Error>
fn validate_with_config(&self, _: &ValidationConfig) -> Result<(), Self::Error>
Validate the object
impl Eq for Cycle
impl StructuralEq for Cycle
impl StructuralPartialEq for Cycle
Auto Trait Implementations§
impl !RefUnwindSafe for Cycle
impl Send for Cycle
impl Sync for Cycle
impl Unpin for Cycle
impl !UnwindSafe for Cycle
Blanket Implementations§
§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.§fn 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.§fn 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.§fn 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.§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.