Struct QuadraticBezierPolynomial 

pub struct QuadraticBezierPolynomial<S> {
    pub a0: Vector2D<S, UnknownUnit>,
    pub a1: Vector2D<S, UnknownUnit>,
    pub a2: Vector2D<S, UnknownUnit>,
}

Available on crate feature geometry only.

The polynomial form of a quadratic bézier segment.

The sample implementation uses Horner’s method and tends to be faster than QuadraticBezierSegment::sample.

Fields

a0: Vector2D<S, UnknownUnit>

a1: Vector2D<S, UnknownUnit>

a2: Vector2D<S, UnknownUnit>

Implementations

impl<S> QuadraticBezierPolynomial<S>

where S: Scalar,

pub fn sample(&self, t: S) -> Point2D<S, UnknownUnit>

Trait Implementations

impl<S> Clone for QuadraticBezierPolynomial<S>

where S: Clone,

fn clone(&self) -> QuadraticBezierPolynomial<S>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<S> Debug for QuadraticBezierPolynomial<S>

where S: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<S> PartialEq for QuadraticBezierPolynomial<S>

where S: PartialEq,

fn eq(&self, other: &QuadraticBezierPolynomial<S>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<S> Copy for QuadraticBezierPolynomial<S>

where S: Copy,

impl<S> StructuralPartialEq for QuadraticBezierPolynomial<S>