Small tweaks

Author: ejmount

src/lib.rs

@@ -2961,7 +2961,7 @@ pub trait Itertools: Iterator {
         use alloc::collections::BinaryHeap;
 
         if k == 0 {
-            return vec![].into_iter();
+            return Vec::new().into_iter();
         }
 
         let mut heap = self.by_ref().take(k).collect::<BinaryHeap<_>>();
@@ -2997,7 +2997,6 @@ pub trait Itertools: Iterator {
     ///
     /// This corresponds to `self.sorted_by_key(cmp).take(k)` in the same way that
     /// [Itertools::k_smallest] corresponds to `self.sorted().take(k)`, in both semantics and time complexity.
-    /// This method will use an _additional_ `k * sizeof(K)` memory compared to that method.
     #[cfg(feature = "use_alloc")]
     fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> VecIntoIter<Self::Item>
     where

tests/test_std.rs

@@ -518,19 +518,19 @@ qc::quickcheck! {
 
         // Check the variations produce the same answers and that they're right
         for (a,b,c,d) in izip!(
-            sorted[..num_elements].iter().cloned(), 
-            smallest, 
-            smallest_by, 
+            sorted[..num_elements].iter().cloned(),
+            smallest,
+            smallest_by,
             smallest_by_key) {
             assert_eq!(a,b);
             assert_eq!(a,c);
             assert_eq!(a,d);
         }
 
         for (a,b,c,d) in izip!(
-            sorted[sorted.len()-num_elements..].iter().rev().cloned(), 
-            largest, 
-            largest_by, 
+            sorted[sorted.len()-num_elements..].iter().rev().cloned(),
+            largest,
+            largest_by,
             largest_by_key) {
             assert_eq!(a,b);
             assert_eq!(a,c);