mirror of
https://github.com/GraphiteEditor/Graphite.git
synced 2026-09-16 23:08:05 +08:00
Replace the legacy Bezier struct with kurbo::PathSeg throughout (#4455)
This commit is contained in:
committed by
Dennis Kobert
parent
30333d6ec4
commit
07829c6e0c
@@ -382,6 +382,8 @@ fn grid<T: GridSpacing>(
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
use kurbo::ParamCurve;
|
||||
use vector_types::vector::misc::point_to_dvec2;
|
||||
#[test]
|
||||
fn isometric_grid_test() {
|
||||
// Doesn't crash with weird angles
|
||||
@@ -391,14 +393,11 @@ mod tests {
|
||||
// Works properly
|
||||
let grid = grid(&(), (), GridType::Isometric, 10., 5, 5, (30., 30.).into(), true);
|
||||
assert_eq!(grid.point_domain.ids().len(), 5 * 5);
|
||||
assert_eq!(grid.segment_bezier_iter().count(), 4 * 5 + 4 * 9);
|
||||
for (_, bezier, _, _) in grid.segment_bezier_iter() {
|
||||
assert_eq!(bezier.handles, subpath::BezierHandles::Linear);
|
||||
assert!(
|
||||
((bezier.start - bezier.end).length() - 10.).abs() < 1e-5,
|
||||
"Length of {} should be 10",
|
||||
(bezier.start - bezier.end).length()
|
||||
);
|
||||
assert_eq!(grid.segment_iter().count(), 4 * 5 + 4 * 9);
|
||||
for (_, segment, _, _) in grid.segment_iter() {
|
||||
assert!(matches!(segment, kurbo::PathSeg::Line(_)));
|
||||
let span = point_to_dvec2(segment.start()) - point_to_dvec2(segment.end());
|
||||
assert!((span.length() - 10.).abs() < 1e-5, "Length of {} should be 10", span.length());
|
||||
}
|
||||
}
|
||||
|
||||
@@ -406,10 +405,10 @@ mod tests {
|
||||
fn skew_isometric_grid_test() {
|
||||
let grid = grid(&(), (), GridType::Isometric, 10., 5, 5, (40., 30.).into(), true);
|
||||
assert_eq!(grid.point_domain.ids().len(), 5 * 5);
|
||||
assert_eq!(grid.segment_bezier_iter().count(), 4 * 5 + 4 * 9);
|
||||
for (_, bezier, _, _) in grid.segment_bezier_iter() {
|
||||
assert_eq!(bezier.handles, subpath::BezierHandles::Linear);
|
||||
let vector = bezier.start - bezier.end;
|
||||
assert_eq!(grid.segment_iter().count(), 4 * 5 + 4 * 9);
|
||||
for (_, segment, _, _) in grid.segment_iter() {
|
||||
assert!(matches!(segment, kurbo::PathSeg::Line(_)));
|
||||
let vector = point_to_dvec2(segment.start()) - point_to_dvec2(segment.end());
|
||||
let angle = (vector.angle_to(DVec2::X).to_degrees() + 180.) % 180.;
|
||||
assert!([90f64, 150., 40.].into_iter().any(|target| (target - angle).abs() < 1e-10), "unexpected angle of {angle}")
|
||||
}
|
||||
|
||||
@@ -738,16 +738,6 @@ pub mod extrude_algorithms {
|
||||
use vector_types::vector::StrokeId;
|
||||
use vector_types::vector::misc::ExtrudeJoiningAlgorithm;
|
||||
|
||||
/// Convert [`vector_types::subpath::Bezier`] to [`kurbo::PathSeg`].
|
||||
fn bezier_to_path_seg(bezier: vector_types::subpath::Bezier) -> kurbo::PathSeg {
|
||||
let [start, end] = [(bezier.start().x, bezier.start().y), (bezier.end().x, bezier.end().y)];
|
||||
match bezier.handles {
|
||||
BezierHandles::Linear => kurbo::Line::new(start, end).into(),
|
||||
BezierHandles::Quadratic { handle } => kurbo::QuadBez::new(start, (handle.x, handle.y), end).into(),
|
||||
BezierHandles::Cubic { handle_start, handle_end } => kurbo::CubicBez::new(start, (handle_start.x, handle_start.y), (handle_end.x, handle_end.y), end).into(),
|
||||
}
|
||||
}
|
||||
|
||||
/// Convert [`kurbo::CubicBez`] to [`vector_types::subpath::BezierHandles`].
|
||||
fn cubic_to_handles(cubic_bez: kurbo::CubicBez) -> BezierHandles {
|
||||
BezierHandles::Cubic {
|
||||
@@ -778,9 +768,9 @@ pub mod extrude_algorithms {
|
||||
let mut next_segment = vector.segment_domain.next_id();
|
||||
|
||||
for segment_index in 0..segment_count {
|
||||
let (_, _, bezier) = vector.segment_points_from_index(segment_index);
|
||||
let (_, _, segment) = vector.segment_points_from_index(segment_index);
|
||||
let mut start_index = vector.segment_domain.start_point()[segment_index];
|
||||
let pathseg = bezier_to_path_seg(bezier).to_cubic();
|
||||
let pathseg = segment.to_cubic();
|
||||
let mut start_t = 0.;
|
||||
|
||||
for split_t in find_splits(pathseg, direction) {
|
||||
|
||||
Reference in New Issue
Block a user