cmporder 0.1.0

macros for prioritized Ord/PartialOrd
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70

use cmporder::{cmp_order, partial_cmp_order};
use rand::seq::SliceRandom;

#[test]
fn test_cmporder() {
    #[derive(Debug, Clone, Copy, PartialEq, Eq)]
    struct ABC {
        a: u8,
        b: u8,
    }

    impl Ord for ABC {
        fn cmp(&self, other: &Self) -> std::cmp::Ordering {
            cmp_order!(self.a.cmp(&other.a), self.b.cmp(&other.b))
        }
    }

    impl PartialOrd for ABC {
        fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
            Some(self.cmp(other))
        }
    }

    let abc1 = ABC { a: 10, b: 10 };
    let abc2 = ABC { a: 20, b: 10 };
    let abc3 = ABC { a: 10, b: 20 };

    let list = vec![abc1, abc2, abc3];

    let mut rng = rand::rng();
    let mut list = list.clone();
    list.shuffle(&mut rng);

    list.sort();
    assert_eq!(list, vec![abc1, abc3, abc2]);
}

#[test]
fn test_partial_cmporder() {
    #[derive(Debug, Clone, Copy, PartialEq, Eq)]
    struct ABC {
        a: u8,
        b: u8,
    }

    impl PartialOrd for ABC {
        fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
            partial_cmp_order!(self.a.partial_cmp(&other.a), self.b.partial_cmp(&other.b))
        }
    }

    impl Ord for ABC {
        fn cmp(&self, other: &Self) -> std::cmp::Ordering {
            self.partial_cmp(other).unwrap_or(std::cmp::Ordering::Equal)
        }
    }

    let abc1 = ABC { a: 20, b: 20 };
    let abc2 = ABC { a: 20, b: 10 };
    let abc3 = ABC { a: 10, b: 20 };

    let list = vec![abc1, abc2, abc3];

    let mut rng = rand::rng();
    let mut list = list.clone();
    list.shuffle(&mut rng);

    list.sort();
    assert_eq!(list, vec![abc3, abc2, abc1]);
}