pub enum PathSeg {
Line(Line),
Quad(QuadBez),
Cubic(CubicBez),
}
Expand description
A segment of a Bézier path.
Variants§
Line(Line)
A line segment.
Quad(QuadBez)
A quadratic bezier segment.
Cubic(CubicBez)
A cubic bezier segment.
Implementations§
source§impl PathSeg
impl PathSeg
sourcepub fn reverse(&self) -> PathSeg
pub fn reverse(&self) -> PathSeg
Returns a new PathSeg
describing the same path as self
, but with
the points reversed.
sourcepub fn intersect_line(&self, line: Line) -> ArrayVec<LineIntersection, 3>
pub fn intersect_line(&self, line: Line) -> ArrayVec<LineIntersection, 3>
Compute intersections against a line.
Returns a vector of the intersections. For each intersection,
the t
value of the segment and line are given.
Note: This test is designed to be inclusive of points near the endpoints
of the segment. This is so that testing a line against multiple
contiguous segments of a path will be guaranteed to catch at least one
of them. In such cases, use higher level logic to coalesce the hits
(the t
value may be slightly outside the range of 0..1).
Examples
let seg = PathSeg::Line(Line::new((0.0, 0.0), (2.0, 0.0)));
let line = Line::new((1.0, 2.0), (1.0, -2.0));
let intersection = seg.intersect_line(line);
assert_eq!(intersection.len(), 1);
let intersection = intersection[0];
assert_eq!(intersection.segment_t, 0.5);
assert_eq!(intersection.line_t, 0.5);
let point = seg.eval(intersection.segment_t);
assert_eq!(point, Point::new(1.0, 0.0));
sourcepub fn min_dist(&self, other: PathSeg, accuracy: f64) -> MinDistance
pub fn min_dist(&self, other: PathSeg, accuracy: f64) -> MinDistance
Minimum distance between two PathSegs
Returns a tuple of the distance, the path time t1
of the closest point
on the first PathSeg, and the path time t2
of the closest point on the
second PathSeg.
Trait Implementations§
source§impl<'de> Deserialize<'de> for PathSeg
impl<'de> Deserialize<'de> for PathSeg
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
source§impl JsonSchema for PathSeg
impl JsonSchema for PathSeg
source§fn schema_name() -> String
fn schema_name() -> String
source§fn json_schema(gen: &mut SchemaGenerator) -> Schema
fn json_schema(gen: &mut SchemaGenerator) -> Schema
source§fn is_referenceable() -> bool
fn is_referenceable() -> bool
$ref
keyword. Read moresource§impl Mul<PathSeg> for TranslateScale
impl Mul<PathSeg> for TranslateScale
source§impl ParamCurve for PathSeg
impl ParamCurve for PathSeg
source§fn subsegment(&self, range: Range<f64>) -> PathSeg
fn subsegment(&self, range: Range<f64>) -> PathSeg
source§fn subdivide(&self) -> (Self, Self)
fn subdivide(&self) -> (Self, Self)
source§impl ParamCurveArclen for PathSeg
impl ParamCurveArclen for PathSeg
source§impl ParamCurveArea for PathSeg
impl ParamCurveArea for PathSeg
source§fn signed_area(&self) -> f64
fn signed_area(&self) -> f64
source§impl ParamCurveExtrema for PathSeg
impl ParamCurveExtrema for PathSeg
source§fn extrema_ranges(&self) -> ArrayVec<Range<f64>, { _ }>
fn extrema_ranges(&self) -> ArrayVec<Range<f64>, { _ }>
source§fn bounding_box(&self) -> Rect
fn bounding_box(&self) -> Rect
source§impl ParamCurveNearest for PathSeg
impl ParamCurveNearest for PathSeg
source§impl PartialEq<PathSeg> for PathSeg
impl PartialEq<PathSeg> for PathSeg
source§impl Shape for PathSeg
impl Shape for PathSeg
source§fn area(&self) -> f64
fn area(&self) -> f64
The area under the curve.
We could just return 0, but this seems more useful.
§type PathElementsIter<'iter> = PathSegIter
type PathElementsIter<'iter> = PathSegIter
path_elements
method.