is_sorted 0.1.1

Is an Iterator sorted?
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

//! Implementation of comparison callables.
#![allow(non_upper_case_globals)]

pub mod types {
    use cmp::Ordering;

    /// Equivalent to `Ord::partial_cmp(a, b)`
    pub struct Increasing();

    impl<'a, 'b, T: PartialOrd> FnOnce<(&'a T, &'b T)> for Increasing {
        type Output = Option<Ordering>;
        extern "rust-call" fn call_once(
            self, arg: (&'a T, &'b T),
        ) -> Self::Output {
            arg.0.partial_cmp(arg.1)
        }
    }

    impl<'a, 'b, T: PartialOrd> FnMut<(&'a T, &'b T)> for Increasing {
        extern "rust-call" fn call_mut(
            &mut self, arg: (&'a T, &'b T),
        ) -> Self::Output {
            arg.0.partial_cmp(arg.1)
        }
    }

    /// Equivalent to `Ord::partial_cmp(a, b).reverse()`
    pub struct Decreasing();

    impl<'a, 'b, T: PartialOrd> FnOnce<(&'a T, &'b T)> for Decreasing {
        type Output = Option<Ordering>;
        extern "rust-call" fn call_once(
            self, arg: (&'a T, &'b T),
        ) -> Self::Output {
            arg.0.partial_cmp(arg.1).map(|v| v.reverse())
        }
    }

    impl<'a, 'b, T: PartialOrd> FnMut<(&'a T, &'b T)> for Decreasing {
        extern "rust-call" fn call_mut(
            &mut self, arg: (&'a T, &'b T),
        ) -> Self::Output {
            arg.0.partial_cmp(arg.1).map(|v| v.reverse())
        }
    }
}

/// Increasing ordering: callable equivalent to `a.partial_cmp(b)`.
pub const Increasing: types::Increasing = types::Increasing();

/// Decreasing ordering: callable equivalent to `a.partial_cmp(b).reverse()`.
pub const Decreasing: types::Decreasing = types::Decreasing();