Making return types consistent

Author: ejmount

src/lib.rs

@@ -2732,7 +2732,7 @@ pub trait Itertools : Iterator {
     /// itertools::assert_equal(five_smallest, 0..5);
     /// ```
     #[cfg(feature = "use_alloc")]
-    fn k_smallest(self, k: usize) -> std::vec::IntoIter<Self::Item>
+    fn k_smallest(self, k: usize) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         Self::Item: Ord,
@@ -2746,7 +2746,7 @@ pub trait Itertools : Iterator {
     /// [Itertools::k_smallest] corresponds to `self.sorted().take(k)`, in both semantics and complexity.
     /// Particularly, the comparison is not cloned.
     #[cfg(feature = "use_alloc")]
-    fn k_smallest_by<F>(self, k: usize, cmp: F) -> std::vec::IntoIter<Self::Item>
+    fn k_smallest_by<F>(self, k: usize, cmp: F) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         F: Fn(&Self::Item, &Self::Item) -> Ordering,
@@ -2760,7 +2760,7 @@ pub trait Itertools : Iterator {
     /// [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) -> std::vec::IntoIter<Self::Item>
+    fn k_smallest_by_key<F, K>(self, k: usize, key: F) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         F: Fn(&Self::Item) -> K,
@@ -2784,7 +2784,7 @@ pub trait Itertools : Iterator {
     /// itertools::assert_equal(five_largest, vec![14,13,12,11,10]);
     /// ```
     #[cfg(feature = "use_alloc")]
-    fn k_largest(self, k: usize) -> std::vec::IntoIter<Self::Item>
+    fn k_largest(self, k: usize) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         Self::Item: Ord,
@@ -2795,7 +2795,7 @@ pub trait Itertools : Iterator {
     /// Sort the k largest elements into a new iterator using the provided comparison.
     /// Functionally equivalent to `k_smallest` with a reversed `Ord`
     #[cfg(feature = "use_alloc")]
-    fn k_largest_by<F>(self, k: usize, cmp: F) -> std::vec::IntoIter<Self::Item>
+    fn k_largest_by<F>(self, k: usize, cmp: F) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         F: Fn(&Self::Item, &Self::Item) -> Ordering,
@@ -2805,7 +2805,7 @@ pub trait Itertools : Iterator {
 
     /// Return the elements producing the k largest outputs of the provided function
     #[cfg(feature = "use_alloc")]
-    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> std::vec::IntoIter<Self::Item>
+    fn k_largest_by_key<F, K>(self, k: usize, key: F) -> VecIntoIter<Self::Item>
     where
         Self: Sized,
         F: Fn(&Self::Item) -> K,