algorithmica 0.1.10

Rust Algorithms
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
53

use std::cmp::Ord;

pub fn is_sorted<T>(list: &[T]) -> bool
where
    T: Ord,
{
    if list.is_empty() {
        return true;
    }
    let mut previous = &list[0];
    for current in list.iter().skip(1) {
        if previous > current {
            return false;
        }
        previous = current;
    }
    true
}

pub fn is_sorted_desc<T>(list: &[T]) -> bool
where
    T: Ord,
{
    if list.is_empty() {
        return true;
    }
    let mut previous = &list[0];
    for current in list.iter().skip(1) {
        if previous < current {
            return false;
        }
        previous = current;
    }
    true
}

pub fn is_sorted_by<T, F>(list: &[T], f: F) -> bool
where
    T: Ord,
    F: Fn(&T, &T) -> bool,
{
    if list.is_empty() {
        return true;
    }
    let mut previous = &list[0];
    for current in list.iter().skip(1) {
        if f(previous, current) {
            return false;
        }
        previous = current;
    }
    true
}