i_key_sort 0.10.1

Counting sort algorithm.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

use crate::sort::key::KeyFn;

pub(crate) trait MinMax<T> {
    fn min_max<K, F>(&self, key: F) -> (K, K)
    where
        K: Copy + Ord,
        F: KeyFn<T, K>;
}

impl<T> MinMax<T> for [T] {
    #[inline(always)]
    fn min_max<K, F: KeyFn<T, K>>(&self, key: F) -> (K, K)
    where
        K: Copy + Ord,
    {
        debug_assert!(!self.is_empty());
        let first_val = self.first().unwrap();
        let first_key = key(first_val);

        let mut min_key = first_key;
        let mut max_key = first_key;

        for val in self.iter().skip(1) {
            let k = key(val);
            min_key = min_key.min(k);
            max_key = max_key.max(k);
        }

        (min_key, max_key)
    }
}