Using alloc instead of std

src/k_smallest.rs

@@ -1,11 +1,12 @@
 use core::cmp::{Ord, Ordering, Reverse};
 use core::mem::{replace, transmute, MaybeUninit};
+use alloc::vec::IntoIter;
 
 fn k_smallest_dynamic<T, I: Iterator<Item = T>>(
     iter: I,
     k: usize,
     order: impl Fn(&T, &T) -> Ordering,
-) -> std::vec::IntoIter<T> {
+) -> IntoIter<T> {
     let mut storage = Vec::new();
     storage.resize_with(k, MaybeUninit::uninit);
     let num_elements = capped_heapsort(iter, &mut storage, order);
@@ -31,19 +32,19 @@ where
 pub(crate) fn k_smallest<T: Ord, I: Iterator<Item = T>>(
     iter: I,
     k: usize,
-) -> std::vec::IntoIter<T> {
+) -> IntoIter<T> {
     k_smallest_dynamic(iter, k, T::cmp)
 }
 
-pub(crate) fn k_smallest_by<T, I, F>(iter: I, k: usize, cmp: F) -> std::vec::IntoIter<T>
+pub(crate) fn k_smallest_by<T, I, F>(iter: I, k: usize, cmp: F) -> IntoIter<T>
 where
     I: Iterator<Item = T>,
     F: Fn(&T, &T) -> Ordering,
 {
     k_smallest_dynamic(iter, k, cmp)
 }
 
-pub(crate) fn k_smallest_by_key<T, I, F, K>(iter: I, k: usize, key: F) -> std::vec::IntoIter<T>
+pub(crate) fn k_smallest_by_key<T, I, F, K>(iter: I, k: usize, key: F) -> IntoIter<T>
 where
     I: Iterator<Item = T>,
     F: Fn(&T) -> K,