Struct solstice_2d::Ellipse
source · pub struct Ellipse {
pub x: f32,
pub y: f32,
pub radius_x: f32,
pub radius_y: f32,
pub segments: u32,
}
Fields§
§x: f32
§y: f32
§radius_x: f32
§radius_y: f32
§segments: u32
Trait Implementations§
source§impl From<Ellipse> for SimpleConvexPolygon
impl From<Ellipse> for SimpleConvexPolygon
source§impl PartialEq<Ellipse> for Ellipse
impl PartialEq<Ellipse> for Ellipse
source§impl SimpleConvexGeometry for Ellipse
impl SimpleConvexGeometry for Ellipse
type Vertices = <SimpleConvexPolygon as SimpleConvexGeometry>::Vertices
fn vertices(&self) -> Self::Vertices
fn vertex_count(&self) -> usize
impl Copy for Ellipse
impl StructuralPartialEq for Ellipse
Auto Trait Implementations§
impl RefUnwindSafe for Ellipse
impl Send for Ellipse
impl Sync for Ellipse
impl Unpin for Ellipse
impl UnwindSafe for Ellipse
Blanket Implementations§
§impl<T> Pointable for T
impl<T> Pointable 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.