Fix lints

Author: Icelk

src/percentile.rs

@@ -579,6 +579,7 @@ pub mod pivot_fn {
             // Next, we sort each chunk. Each group is a fixed length, so each sort
             // takes constant time. Since we have n/5 chunks, this operation
             // is also O(n)
+            #[allow(clippy::manual_inspect)]
             let sorted_chunks = chunks.map(|c| {
                 c.sort_unstable_by(compare);
                 c
@@ -736,14 +737,14 @@ pub mod cluster {
         list: &'a mut [Cluster],
         len: usize,
     }
-    impl<'a> Deref for ClusterMut<'a> {
+    impl Deref for ClusterMut<'_> {
         type Target = [Cluster];
         #[inline]
         fn deref(&self) -> &Self::Target {
             self.list
         }
     }
-    impl<'a> DerefMut for ClusterMut<'a> {
+    impl DerefMut for ClusterMut<'_> {
         #[inline]
         fn deref_mut(&mut self) -> &mut Self::Target {
             self.list
@@ -767,7 +768,7 @@ pub mod cluster {
             }
         }
     }
-    impl<'a> ClusterMut<'a> {
+    impl ClusterMut<'_> {
         #[inline]
         fn list(&self) -> ClusterList {
             ClusterList::from(self)

src/regression.rs

@@ -1915,7 +1915,7 @@ pub mod theil_sen {
             vec
         }
     }
-    impl<'a, T: Copy + Debug> Iterator for PermutationIter<'a, T> {
+    impl<T: Copy + Debug> Iterator for PermutationIter<'_, T> {
         type Item = PermutationIterBuffer<T>;
         #[inline]
         fn next(&mut self) -> Option<Self::Item> {
@@ -4017,7 +4017,7 @@ mod utils {
         }
     }
     pub(super) struct BorrowedPolynomial<'a>(pub(super) &'a [f64]);
-    impl<'a> Predictive for BorrowedPolynomial<'a> {
+    impl Predictive for BorrowedPolynomial<'_> {
         #[inline(always)]
         fn predict_outcome(&self, predictor: f64) -> f64 {
             match self.0.len() {