pub struct QuadraticBezierSegment<S> {
    pub from: Point2D<S, UnknownUnit>,
    pub ctrl: Point2D<S, UnknownUnit>,
    pub to: Point2D<S, UnknownUnit>,
}
Available on crate feature canvas only.
Expand description

A 2d curve segment defined by three points: the beginning of the segment, a control point and the end of the segment.

The curve is defined by equation: ∀ t ∈ [0..1], P(t) = (1 - t)² * from + 2 * (1 - t) * t * ctrl + t² * to

Fields§

§from: Point2D<S, UnknownUnit>§ctrl: Point2D<S, UnknownUnit>§to: Point2D<S, UnknownUnit>

Implementations§

§

impl<S> QuadraticBezierSegment<S>
where S: Scalar,

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

Sample the curve at t (expecting t between 0 and 1).

pub fn x(&self, t: S) -> S

Sample the x coordinate of the curve at t (expecting t between 0 and 1).

pub fn y(&self, t: S) -> S

Sample the y coordinate of the curve at t (expecting t between 0 and 1).

pub fn derivative(&self, t: S) -> Vector2D<S, UnknownUnit>

Sample the curve’s derivative at t (expecting t between 0 and 1).

pub fn dx(&self, t: S) -> S

Sample the x coordinate of the curve’s derivative at t (expecting t between 0 and 1).

pub fn dy(&self, t: S) -> S

Sample the y coordinate of the curve’s derivative at t (expecting t between 0 and 1).

pub fn flip(&self) -> QuadraticBezierSegment<S>

Swap the beginning and the end of the segment.

pub fn y_maximum_t(&self) -> S

Find the advancement of the y-most position in the curve.

This returns the advancement along the curve, not the actual y position.

pub fn y_minimum_t(&self) -> S

Find the advancement of the y-least position in the curve.

This returns the advancement along the curve, not the actual y position.

pub fn local_y_extremum_t(&self) -> Option<S>

Return the y inflection point or None if this curve is y-monotonic.

pub fn x_maximum_t(&self) -> S

Find the advancement of the x-most position in the curve.

This returns the advancement along the curve, not the actual x position.

pub fn x_minimum_t(&self) -> S

Find the advancement of the x-least position in the curve.

This returns the advancement along the curve, not the actual x position.

pub fn local_x_extremum_t(&self) -> Option<S>

Return the x inflection point or None if this curve is x-monotonic.

pub fn split_range(&self, t_range: Range<S>) -> QuadraticBezierSegment<S>

Return the sub-curve inside a given range of t.

This is equivalent splitting at the range’s end points.

pub fn split( &self, t: S ) -> (QuadraticBezierSegment<S>, QuadraticBezierSegment<S>)

Split this curve into two sub-curves.

pub fn before_split(&self, t: S) -> QuadraticBezierSegment<S>

Return the curve before the split point.

pub fn after_split(&self, t: S) -> QuadraticBezierSegment<S>

Return the curve after the split point.

pub fn to_cubic(&self) -> CubicBezierSegment<S>

Elevate this curve to a third order bézier.

pub fn baseline(&self) -> LineSegment<S>

pub fn is_a_point(&self, tolerance: S) -> bool

Returns whether the curve can be approximated with a single point, given a tolerance threshold.

pub fn is_linear(&self, tolerance: S) -> bool

Returns true if the curve can be approximated with a single line segment given a tolerance threshold.

pub fn fat_line(&self) -> (LineEquation<S>, LineEquation<S>)

Computes a “fat line” of this segment.

A fat line is two conservative lines between which the segment is fully contained.

pub fn transformed<T>(&self, transform: &T) -> QuadraticBezierSegment<S>
where T: Transformation<S>,

Applies the transform to this curve and returns the results.

pub fn flattening_step(&self, tolerance: S) -> S

Find the interval of the beginning of the curve that can be approximated with a line segment.

pub fn for_each_flattened<F>(&self, tolerance: S, callback: &mut F)
where F: FnMut(&LineSegment<S>),

Approximates the curve with sequence of line segments.

The tolerance parameter defines the maximum distance between the curve and its approximation.

This implements the algorithm described by Raph Levien at https://raphlinus.github.io/graphics/curves/2019/12/23/flatten-quadbez.html

pub fn for_each_flattened_with_t<F>(&self, tolerance: S, callback: &mut F)
where F: FnMut(&LineSegment<S>, Range<S>),

Compute a flattened approximation of the curve, invoking a callback at each step.

The tolerance parameter defines the maximum distance between the curve and its approximation.

The end of the t parameter range at the final segment is guaranteed to be equal to 1.0.

This implements the algorithm described by Raph Levien at https://raphlinus.github.io/graphics/curves/2019/12/23/flatten-quadbez.html

pub fn flattened(&self, tolerance: S) -> Flattened<S>

Returns the flattened representation of the curve as an iterator, starting after the current point.

pub fn flattened_t(&self, tolerance: S) -> FlattenedT<S>

Returns the flattened representation of the curve as an iterator, starting after the current point.

pub fn for_each_monotonic_range<F>(&self, cb: &mut F)
where F: FnMut(Range<S>),

Invokes a callback for each monotonic part of the segment.

pub fn for_each_monotonic<F>(&self, cb: &mut F)

Invokes a callback for each monotonic part of the segment.

pub fn for_each_y_monotonic_range<F>(&self, cb: &mut F)
where F: FnMut(Range<S>),

Invokes a callback for each y-monotonic part of the segment.

pub fn for_each_y_monotonic<F>(&self, cb: &mut F)

Invokes a callback for each y-monotonic part of the segment.

pub fn for_each_x_monotonic_range<F>(&self, cb: &mut F)
where F: FnMut(Range<S>),

Invokes a callback for each x-monotonic part of the segment.

pub fn for_each_x_monotonic<F>(&self, cb: &mut F)

Invokes a callback for each x-monotonic part of the segment.

pub fn bounding_triangle(&self) -> Triangle<S>

Returns a triangle containing this curve segment.

pub fn fast_bounding_box(&self) -> Box2D<S, UnknownUnit>

Returns a conservative rectangle that contains the curve.

pub fn fast_bounding_range_x(&self) -> (S, S)

Returns a conservative range of x that contains this curve.

pub fn fast_bounding_range_y(&self) -> (S, S)

Returns a conservative range of y that contains this curve.

pub fn bounding_box(&self) -> Box2D<S, UnknownUnit>

Returns the smallest rectangle the curve is contained in

pub fn bounding_range_x(&self) -> (S, S)

Returns the smallest range of x that contains this curve.

pub fn bounding_range_y(&self) -> (S, S)

Returns the smallest range of y that contains this curve.

pub fn is_x_monotonic(&self) -> bool

Returns whether this segment is monotonic on the x axis.

pub fn is_y_monotonic(&self) -> bool

Returns whether this segment is monotonic on the y axis.

pub fn is_monotonic(&self) -> bool

Returns whether this segment is fully monotonic.

pub fn line_intersections_t(&self, line: &Line<S>) -> ArrayVec<S, 2>

Computes the intersections (if any) between this segment a line.

The result is provided in the form of the t parameters of each point along curve. To get the intersection points, sample the curve at the corresponding values.

pub fn line_intersections( &self, line: &Line<S> ) -> ArrayVec<Point2D<S, UnknownUnit>, 2>

Computes the intersection points (if any) between this segment a line.

pub fn line_segment_intersections_t( &self, segment: &LineSegment<S> ) -> ArrayVec<(S, S), 2>

Computes the intersections (if any) between this segment and a line segment.

The result is provided in the form of the t parameters of each point along curve and segment. To get the intersection points, sample the segments at the corresponding values.

pub fn from(&self) -> Point2D<S, UnknownUnit>

pub fn to(&self) -> Point2D<S, UnknownUnit>

pub fn line_segment_intersections( &self, segment: &LineSegment<S> ) -> ArrayVec<Point2D<S, UnknownUnit>, 2>

Computes the intersection points (if any) between this segment a line segment.

pub fn closest_point(&self, pos: Point2D<S, UnknownUnit>) -> S

Analytic solution to finding the closest point on the curve to pos.

pub fn distance_to_point(&self, pos: Point2D<S, UnknownUnit>) -> S

Returns the shortest distance between this segment and a point.

pub fn square_distance_to_point(&self, pos: Point2D<S, UnknownUnit>) -> S

Returns the shortest squared distance between this segment and a point.

May be useful to avoid the cost of a square root when comparing against a distance that can be squared instead.

pub fn drag( &self, t: S, new_position: Point2D<S, UnknownUnit> ) -> QuadraticBezierSegment<S>

pub fn length(&self) -> S

Computes the length of this segment.

Implements Raph Levien’s analytical approach described in https://raphlinus.github.io/curves/2018/12/28/bezier-arclength.html

pub fn to_f32(&self) -> QuadraticBezierSegment<f32>

pub fn to_f64(&self) -> QuadraticBezierSegment<f64>

Trait Implementations§

§

impl<S> Clone for QuadraticBezierSegment<S>
where S: Clone,

§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
§

impl<S> Debug for QuadraticBezierSegment<S>
where S: Debug,

§

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

Formats the value using the given formatter. Read more
§

impl<S> PartialEq for QuadraticBezierSegment<S>
where S: PartialEq,

§

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

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

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

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

impl<S> Segment for QuadraticBezierSegment<S>
where S: Scalar,

§

type Scalar = S

§

fn from(&self) -> Point2D<S, UnknownUnit>

Start of the curve.
§

fn to(&self) -> Point2D<S, UnknownUnit>

End of the curve.
§

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

Sample the curve at t (expecting t between 0 and 1).
§

fn x(&self, t: S) -> S

Sample x at t (expecting t between 0 and 1).
§

fn y(&self, t: S) -> S

Sample y at t (expecting t between 0 and 1).
§

fn derivative(&self, t: S) -> Vector2D<S, UnknownUnit>

Sample the derivative at t (expecting t between 0 and 1).
§

fn dx(&self, t: S) -> S

Sample x derivative at t (expecting t between 0 and 1).
§

fn dy(&self, t: S) -> S

Sample y derivative at t (expecting t between 0 and 1).
§

fn split(&self, t: S) -> (QuadraticBezierSegment<S>, QuadraticBezierSegment<S>)

Split this curve into two sub-curves.
§

fn before_split(&self, t: S) -> QuadraticBezierSegment<S>

Return the curve before the split point.
§

fn after_split(&self, t: S) -> QuadraticBezierSegment<S>

Return the curve after the split point.
§

fn split_range(&self, t_range: Range<S>) -> QuadraticBezierSegment<S>

Return the curve inside a given range of t. Read more
§

fn flip(&self) -> QuadraticBezierSegment<S>

Swap the direction of the segment.
§

fn approximate_length(&self, tolerance: S) -> S

Compute the length of the segment using a flattened approximation.
§

fn for_each_flattened_with_t( &self, tolerance: <QuadraticBezierSegment<S> as Segment>::Scalar, callback: &mut dyn FnMut(&LineSegment<S>, Range<S>) )

Approximates the curve with sequence of line segments. Read more
§

impl<S> Copy for QuadraticBezierSegment<S>
where S: Copy,

§

impl<S> StructuralPartialEq for QuadraticBezierSegment<S>

Auto Trait Implementations§

§

impl<S> RefUnwindSafe for QuadraticBezierSegment<S>
where S: RefUnwindSafe,

§

impl<S> Send for QuadraticBezierSegment<S>
where S: Send,

§

impl<S> Sync for QuadraticBezierSegment<S>
where S: Sync,

§

impl<S> Unpin for QuadraticBezierSegment<S>
where S: Unpin,

§

impl<S> UnwindSafe for QuadraticBezierSegment<S>
where S: UnwindSafe,

Blanket Implementations§

source§

impl<S, D, Swp, Dwp, T> AdaptInto<D, Swp, Dwp, T> for S
where T: Real + Zero + Arithmetics + Clone, Swp: WhitePoint<T>, Dwp: WhitePoint<T>, D: AdaptFrom<S, Swp, Dwp, T>,

source§

fn adapt_into_using<M>(self, method: M) -> D
where M: TransformMatrix<T>,

Convert the source color to the destination color using the specified method.
source§

fn adapt_into(self) -> D

Convert the source color to the destination color using the bradford method by default.
source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T, C> ArraysFrom<C> for T
where C: IntoArrays<T>,

source§

fn arrays_from(colors: C) -> T

Cast a collection of colors into a collection of arrays.
source§

impl<T, C> ArraysInto<C> for T
where C: FromArrays<T>,

source§

fn arrays_into(self) -> C

Cast this collection of arrays into a collection of colors.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T, C> ComponentsFrom<C> for T
where C: IntoComponents<T>,

source§

fn components_from(colors: C) -> T

Cast a collection of colors into a collection of color components.
§

impl<T> Downcast<T> for T

§

fn downcast(&self) -> &T

§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

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.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

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.
§

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.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> FromAngle<T> for T

source§

fn from_angle(angle: T) -> T

Performs a conversion from angle.
source§

impl<T, U> FromStimulus<U> for T
where U: IntoStimulus<T>,

source§

fn from_stimulus(other: U) -> T

Converts other into Self, while performing the appropriate scaling, rounding and clamping.
§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> IntoAngle<U> for T
where U: FromAngle<T>,

source§

fn into_angle(self) -> U

Performs a conversion into T.
source§

impl<T, U> IntoColor<U> for T
where U: FromColor<T>,

source§

fn into_color(self) -> U

Convert into T with values clamped to the color defined bounds Read more
source§

impl<T, U> IntoColorUnclamped<U> for T
where U: FromColorUnclamped<T>,

source§

fn into_color_unclamped(self) -> U

Convert into T. The resulting color might be invalid in its color space Read more
source§

impl<T> IntoStimulus<T> for T

source§

fn into_stimulus(self) -> T

Converts self into T, while performing the appropriate scaling, rounding and clamping.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, C> TryComponentsInto<C> for T
where C: TryFromComponents<T>,

§

type Error = <C as TryFromComponents<T>>::Error

The error for when try_into_colors fails to cast.
source§

fn try_components_into(self) -> Result<C, <T as TryComponentsInto<C>>::Error>

Try to cast this collection of color components into a collection of colors. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

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

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<T, U> TryIntoColor<U> for T
where U: TryFromColor<T>,

source§

fn try_into_color(self) -> Result<U, OutOfBounds<U>>

Convert into T, returning ok if the color is inside of its defined range, otherwise an OutOfBounds error is returned which contains the unclamped color. Read more
source§

impl<C, U> UintsFrom<C> for U
where C: IntoUints<U>,

source§

fn uints_from(colors: C) -> U

Cast a collection of colors into a collection of unsigned integers.
source§

impl<C, U> UintsInto<C> for U
where C: FromUints<U>,

source§

fn uints_into(self) -> C

Cast this collection of unsigned integers into a collection of colors.
§

impl<T> Upcast<T> for T

§

fn upcast(&self) -> Option<&T>

§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
source§

impl<T> MaybeSend for T
where T: Send,

source§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> WasmNotSend for T
where T: Send,

§

impl<T> WasmNotSendSync for T

§

impl<T> WasmNotSync for T
where T: Sync,