Struct fj_kernel::algorithms::approx::curve::CurveApprox
source · [−]pub struct CurveApprox {
pub points: Vec<ApproxPoint<2>>,
}Expand description
An approximation of a Curve
Fields
points: Vec<ApproxPoint<2>>The points that approximate the curve
Implementations
sourceimpl CurveApprox
impl CurveApprox
sourcepub fn with_points(
self,
points: impl IntoIterator<Item = ApproxPoint<2>>
) -> Self
pub fn with_points(
self,
points: impl IntoIterator<Item = ApproxPoint<2>>
) -> Self
Add points to the approximation
Trait Implementations
sourceimpl Debug for CurveApprox
impl Debug for CurveApprox
sourceimpl Hash for CurveApprox
impl Hash for CurveApprox
sourceimpl Ord for CurveApprox
impl Ord for CurveApprox
sourcefn cmp(&self, other: &CurveApprox) -> Ordering
fn cmp(&self, other: &CurveApprox) -> 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<CurveApprox> for CurveApprox
impl PartialEq<CurveApprox> for CurveApprox
sourcefn eq(&self, other: &CurveApprox) -> bool
fn eq(&self, other: &CurveApprox) -> bool
sourceimpl PartialOrd<CurveApprox> for CurveApprox
impl PartialOrd<CurveApprox> for CurveApprox
sourcefn partial_cmp(&self, other: &CurveApprox) -> Option<Ordering>
fn partial_cmp(&self, other: &CurveApprox) -> 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 CurveApprox
impl StructuralEq for CurveApprox
impl StructuralPartialEq for CurveApprox
Auto Trait Implementations
impl !RefUnwindSafe for CurveApprox
impl !Send for CurveApprox
impl !Sync for CurveApprox
impl Unpin for CurveApprox
impl !UnwindSafe for CurveApprox
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.