pub struct CubicBezierPolynomial<S> {
pub a0: Vector<S>,
pub a1: Vector<S>,
pub a2: Vector<S>,
pub a3: Vector<S>,
}
Expand description
The polynomial form of a cubic bézier segment.
The sample
implementation uses Horner’s method and tends to be faster than
CubicBezierSegment::sample
.
Fields§
§a0: Vector<S>
§a1: Vector<S>
§a2: Vector<S>
§a3: Vector<S>
Implementations§
Auto Trait Implementations§
impl<S> Freeze for CubicBezierPolynomial<S>where
S: Freeze,
impl<S> RefUnwindSafe for CubicBezierPolynomial<S>where
S: RefUnwindSafe,
impl<S> Send for CubicBezierPolynomial<S>where
S: Send,
impl<S> Sync for CubicBezierPolynomial<S>where
S: Sync,
impl<S> Unpin for CubicBezierPolynomial<S>where
S: Unpin,
impl<S> UnwindSafe for CubicBezierPolynomial<S>where
S: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more