pub struct Polygon<const D: usize, I: IsInserted = IsInsertedNo> {
pub face: I::T<Face>,
pub edges: [Handle<HalfEdge>; D],
pub vertices: [Handle<Vertex>; D],
}Expand description
A polygon
§Implementation Note
Currently code that deals with Polygon might assume that the polygon has
no holes. Unless you create a Polygon yourself, or modify a Polygon’s
face field to have interior cycles, this should not affect you.
Fields§
§face: I::T<Face>The face that forms the polygon
edges: [Handle<HalfEdge>; D]The edges of the polygon
vertices: [Handle<Vertex>; D]The vertices of the polygon
Trait Implementations§
Source§impl<const D: usize> UpdateFace for Polygon<D>
impl<const D: usize> UpdateFace for Polygon<D>
Source§fn update_exterior(
&self,
f: impl FnOnce(&Handle<Cycle>) -> Handle<Cycle>,
) -> Self
fn update_exterior( &self, f: impl FnOnce(&Handle<Cycle>) -> Handle<Cycle>, ) -> Self
Update the exterior of the face
Source§fn add_interiors(&self, _: impl IntoIterator<Item = Handle<Cycle>>) -> Self
fn add_interiors(&self, _: impl IntoIterator<Item = Handle<Cycle>>) -> Self
Add the provides interiors to the face
Auto Trait Implementations§
impl<const D: usize, I> Freeze for Polygon<D, I>
impl<const D: usize, I = IsInsertedNo> !RefUnwindSafe for Polygon<D, I>
impl<const D: usize, I> Send for Polygon<D, I>
impl<const D: usize, I> Sync for Polygon<D, I>
impl<const D: usize, I> Unpin for Polygon<D, I>
impl<const D: usize, I = IsInsertedNo> !UnwindSafe for Polygon<D, I>
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> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§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.Source§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.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.