Merge pull request #720 from hannobraun/approx

Make minor cleanups in approximation code

crates/fj-kernel/src/algorithms/approx/cycles.rs

@@ -2,7 +2,7 @@ use fj_math::Segment;
 
 use crate::{geometry, objects::Cycle};
 
-use super::{curves::approx_curve, edges::approximate_edge, Tolerance};
+use super::{curves::approx_curve, edges::approx_edge, Tolerance};
 
 /// An approximation of a [`Cycle`]
 #[derive(Debug, Eq, PartialEq, Hash)]
@@ -22,7 +22,7 @@ impl CycleApprox {
         for edge in cycle.edges() {
             let mut edge_points = Vec::new();
             approx_curve(&edge.curve(), tolerance, &mut edge_points);
-            approximate_edge(edge.vertices, &mut edge_points);
+            approx_edge(edge.vertices, &mut edge_points);
 
             points.extend(edge_points);
         }

crates/fj-kernel/src/algorithms/approx/edges.rs

@@ -1,6 +1,6 @@
 use crate::{geometry, objects::VerticesOfEdge};
 
-pub fn approximate_edge(
+pub fn approx_edge(
     vertices: VerticesOfEdge,
     points: &mut Vec<geometry::Point<1, 3>>,
 ) {
@@ -41,7 +41,7 @@ mod test {
     };
 
     #[test]
-    fn approximate_edge() {
+    fn approx_edge() {
         let mut shape = Shape::new();
 
         let a = Point::from([1., 2., 3.]);
@@ -64,12 +64,12 @@ mod test {
 
         // Regular edge
         let mut points = vec![b, c];
-        super::approximate_edge(vertices, &mut points);
+        super::approx_edge(vertices, &mut points);
         assert_eq!(points, vec![a, b, c, d]);
 
         // Continuous edge
         let mut points = vec![b, c];
-        super::approximate_edge(VerticesOfEdge::none(), &mut points);
+        super::approx_edge(VerticesOfEdge::none(), &mut points);
         assert_eq!(points, vec![b, c, b]);
     }
 }