Struct QuadraticBezierPolynomial

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

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: Vector<S>

a1: Vector<S>

a2: Vector<S>

Implementations

impl<S: Scalar> QuadraticBezierPolynomial<S>

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

Trait Implementations

impl<S: Clone> Clone for QuadraticBezierPolynomial<S>

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> Debug for QuadraticBezierPolynomial<S>

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

Formats the value using the given formatter.

impl<S: PartialEq> PartialEq for QuadraticBezierPolynomial<S>

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> Copy for QuadraticBezierPolynomial<S>

impl<S> StructuralPartialEq for QuadraticBezierPolynomial<S>