Simplifying generic parameters in k_smallest_general

Author: ejmount

src/k_smallest.rs

@@ -2,15 +2,15 @@ use alloc::vec::Vec;
 use core::cmp::{Ordering, Reverse};
 
 /// Consumes a given iterator, returning the minimum elements in **ascending** order.
-pub(crate) fn k_smallest_general<T, I: Iterator<Item = T>, F: FnMut(&T, &T) -> Ordering>(
+pub(crate) fn k_smallest_general<I: Iterator, F: FnMut(&I::Item, &I::Item) -> Ordering>(
     mut iter: I,
     k: usize,
     mut comparator: F,
-) -> Vec<T> {
+) -> Vec<I::Item> {
     if k == 0 {
         return Vec::new();
     }
-    let mut storage: Vec<T> = iter.by_ref().take(k).collect();
+    let mut storage: Vec<I::Item> = iter.by_ref().take(k).collect();
 
     // Rearrange the into a valid heap by reordering from the second-bottom-most layer up
     // Slightly faster than ordering on each insert, but only by a factor of lg(k)