Fix clippy and fmt (#84)

* fmt

* clippy

Author: mockersf

src/async_helpers.rs

@@ -20,7 +20,7 @@ pub struct FuturePath<'m> {
     pub(crate) ending_polygon: u32,
 }
 
-impl<'m> fmt::Debug for FuturePath<'m> {
+impl fmt::Debug for FuturePath<'_> {
     fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
         f.debug_struct("FuturePath")
             .field("from", &self.from)
@@ -29,7 +29,7 @@ impl<'m> fmt::Debug for FuturePath<'m> {
     }
 }
 
-impl<'m> Future for FuturePath<'m> {
+impl Future for FuturePath<'_> {
     type Output = Option<Path>;
 
     fn poll(

src/input/triangulation.rs

@@ -138,7 +138,10 @@ impl Triangulation {
     }
 
     /// Add obstacles delimited by the list of points on their edges.
-    pub fn add_obstacles(&mut self, obstacles: impl IntoIterator<Item = impl IntoIterator<Item  = Vec2>>) {
+    pub fn add_obstacles(
+        &mut self,
+        obstacles: impl IntoIterator<Item = impl IntoIterator<Item = Vec2>>,
+    ) {
         let (exterior, interiors) =
             std::mem::replace(&mut self.inner, GeoPolygon::new(LineString(vec![]), vec![]))
                 .into_inner();

src/stitching.rs

@@ -726,8 +726,7 @@ mod tests {
             vec![vec2(2.0, 2.0), vec2(2.0, 1.75), vec2(1.75, 2.0)],
         ] {
             triangulation_a.add_obstacle(obstacle.clone());
-            triangulation_b
-                .add_obstacle(obstacle.into_iter().map(|v| v - vec2(1.0, 0.0)));
+            triangulation_b.add_obstacle(obstacle.into_iter().map(|v| v - vec2(1.0, 0.0)));
         }
         let mut mesh = Mesh::default();
         let mut layer_a = triangulation_a.as_layer();

tests/triangulation.rs

@@ -173,14 +173,11 @@ fn is_in_mesh_simplified() {
     // adding a circle obstacle in the middle
     let nb_points = 100;
     let radius = 2.5;
-    triangulation.add_obstacle(
-        (0..nb_points)
-            .map(|i| {
-                let angle = i as f32 * std::f32::consts::TAU / nb_points as f32;
-                let (x, y) = angle.sin_cos();
-                vec2(x, y) * radius + vec2(5.0, 5.0)
-            })
-    );
+    triangulation.add_obstacle((0..nb_points).map(|i| {
+        let angle = i as f32 * std::f32::consts::TAU / nb_points as f32;
+        let (x, y) = angle.sin_cos();
+        vec2(x, y) * radius + vec2(5.0, 5.0)
+    }));
     let polygons_before = triangulation.as_navmesh().layers[0].polygons.clone();
     triangulation.simplify(0.1);
     let mesh: Mesh = triangulation.as_navmesh();
@@ -208,14 +205,11 @@ fn is_in_mesh_overlapping_simplified() {
     // adding a circle obstacle in the middle
     let nb_points = 1000;
     let radius = 2.5;
-    triangulation.add_obstacle(
-        (0..nb_points)
-            .map(|i| {
-                let angle = i as f32 * std::f32::consts::TAU / nb_points as f32;
-                let (x, y) = angle.sin_cos();
-                vec2(x, y) * radius + vec2(5.0, 5.0)
-            })
-    );
+    triangulation.add_obstacle((0..nb_points).map(|i| {
+        let angle = i as f32 * std::f32::consts::TAU / nb_points as f32;
+        let (x, y) = angle.sin_cos();
+        vec2(x, y) * radius + vec2(5.0, 5.0)
+    }));
     triangulation.add_obstacle(vec![
         vec2(2.5, 2.5),
         vec2(2.5, 5.0),