Struct kurbo::QuadBez[][src]

pub struct QuadBez {
    pub p0: Point,
    pub p1: Point,
    pub p2: Point,
}

A single quadratic Bézier segment.

Fields

p0: Pointp1: Pointp2: Point

Implementations

impl QuadBez[src]

pub fn new<V: Into<Point>>(p0: V, p1: V, p2: V) -> QuadBez[src]

Create a new quadratic Bézier segment.

pub fn raise(&self) -> CubicBez[src]

Raise the order by 1.

Returns a cubic Bézier segment that exactly represents this quadratic.

pub fn is_finite(&self) -> bool[src]

Is this quadratic Bezier curve finite?

pub fn is_nan(&self) -> bool[src]

Is this quadratic Bezier curve NaN?

Trait Implementations

impl Clone for QuadBez[src]

impl Copy for QuadBez[src]

impl Debug for QuadBez[src]

impl<'de> Deserialize<'de> for QuadBez[src]

impl From<QuadBez> for PathSeg[src]

impl Mul<QuadBez> for Affine[src]

type Output = QuadBez

The resulting type after applying the * operator.

impl Mul<QuadBez> for TranslateScale[src]

type Output = QuadBez

The resulting type after applying the * operator.

impl ParamCurve for QuadBez[src]

fn subdivide(&self) -> (QuadBez, QuadBez)[src]

Subdivide into halves, using de Casteljau.

impl ParamCurveArclen for QuadBez[src]

fn arclen(&self, _accuracy: f64) -> f64[src]

Arclength of a quadratic Bézier segment.

This computation is based on an analytical formula. Since that formula suffers from numerical instability when the curve is very close to a straight line, we detect that case and fall back to Legendre-Gauss quadrature.

Accuracy should be better than 1e-13 over the entire range.

Adapted from http://www.malczak.linuxpl.com/blog/quadratic-bezier-curve-length/ with permission.

impl ParamCurveArea for QuadBez[src]

impl ParamCurveCurvature for QuadBez[src]

impl ParamCurveDeriv for QuadBez[src]

type DerivResult = Line

The parametric curve obtained by taking the derivative of this one.

impl ParamCurveExtrema for QuadBez[src]

impl ParamCurveNearest for QuadBez[src]

fn nearest(&self, p: Point, _accuracy: f64) -> Nearest[src]

Find nearest point, using analytical algorithm based on cubic root finding.

impl PartialEq<QuadBez> for QuadBez[src]

impl Serialize for QuadBez[src]

impl Shape for QuadBez[src]

type PathElementsIter = QuadBezIter

The iterator returned by the path_elements method. Read more

impl StructuralPartialEq for QuadBez[src]

Auto Trait Implementations

impl RefUnwindSafe for QuadBez

impl Send for QuadBez

impl Sync for QuadBez

impl Unpin for QuadBez

impl UnwindSafe for QuadBez

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> DeserializeOwned for T where
    T: for<'de> Deserialize<'de>, 
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.