chore: made clippy happy for all targets

src/catch/pp.rs

@@ -728,7 +728,7 @@ mod test {
     fn fruits_missing_objects() {
         let (map, attrs) = test_data();
 
-        let state = CatchPP::new(&map)
+        let state = CatchPP::new(map)
             .attributes(attrs)
             .fruits(N_FRUITS - 10)
             .droplets(N_DROPLETS - 1)

src/mania/pp.rs

@@ -948,6 +948,7 @@ mod tests {
     ///
     /// Very slow but accurate.
     /// Only slight optimizations have been applied so that it doesn't run unreasonably long.
+    #[allow(clippy::too_many_arguments)]
     fn brute_force_best(
         acc: f64,
         n320: Option<usize>,
@@ -1225,7 +1226,7 @@ mod tests {
     fn hitresults_n320_n_misses_best() {
         let (map, attrs) = test_data();
 
-        let state = ManiaPP::new(&map)
+        let state = ManiaPP::new(map)
             .attributes(attrs)
             .n320(500)
             .n_misses(2)
@@ -1248,7 +1249,7 @@ mod tests {
     fn hitresults_n100_n50_n_misses_worst() {
         let (map, attrs) = test_data();
 
-        let state = ManiaPP::new(&map)
+        let state = ManiaPP::new(map)
             .attributes(attrs)
             .n100(200)
             .n50(50)

src/util/limited_queue.rs

@@ -118,7 +118,7 @@ mod test {
         assert!(!queue.is_empty());
         assert_eq!(queue.len(), 1);
         assert_eq!(queue.last(), Some(&elem));
-        assert!(queue.iter().eq(vec![elem].iter()));
+        assert!(queue.iter().eq([elem].iter()));
         assert_eq!(queue[0], elem);
     }