order_struct 0.1.0

Qol rust crate for custom ordering of types that already implement Ord types you can't implement it yourself
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

use std::{
    borrow::Borrow,
    cmp::Ordering,
    hash::Hash,
    ops::{AddAssign, DivAssign, MulAssign, SubAssign},
};

/// Custom struct to be able to compare items using another types `Ord` implementation
/// This implements Hash if T implements hash and only uses T for hashing
#[derive(Debug)]
pub struct OrderVal<T, O: Ord> {
    ord: O,
    val: T,
}

impl<T, O: Ord> OrderVal<T, O> {
    /// Create a new OrderVal
    #[inline]
    pub fn new(val: T, ord: O) -> Self {
        Self { ord, val }
    }

    /// Convert back to `T`
    #[inline]
    pub fn into_inner(self) -> T {
        self.val
    }

    /// Borrow inner value
    #[inline]
    pub fn inner(&self) -> &T {
        &self.val
    }

    /// Get assigned score
    #[inline]
    pub fn ord(&self) -> &O {
        &self.ord
    }

    /// Sets the order
    #[inline]
    pub fn set_ord(&mut self, ord: O) {
        self.ord = ord;
    }
}

impl<T: PartialEq, O: Ord> PartialOrd for OrderVal<T, O> {
    #[inline]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.ord.cmp(&other.ord))
    }
}

impl<T: PartialEq, O: Ord> Ord for OrderVal<T, O> {
    #[inline]
    fn cmp(&self, other: &Self) -> Ordering {
        self.ord.cmp(&other.ord)
    }
}

impl<T: PartialEq, O: Ord> PartialEq for OrderVal<T, O> {
    #[inline]
    fn eq(&self, other: &Self) -> bool {
        self.inner() == other.inner()
    }
}

impl<T: PartialEq, O: Ord> Eq for OrderVal<T, O> {}

impl<T: Clone, O: Ord + Clone> Clone for OrderVal<T, O> {
    #[inline]
    fn clone(&self) -> Self {
        Self {
            ord: self.ord.clone(),
            val: self.val.clone(),
        }
    }
}

impl<T: Copy, O: Ord + Copy> Copy for OrderVal<T, O> {}

impl<T, O: Ord> Borrow<T> for OrderVal<T, O> {
    #[inline]
    fn borrow(&self) -> &T {
        self.inner()
    }
}

impl<T, O: Ord> AsRef<T> for OrderVal<T, O> {
    #[inline]
    fn as_ref(&self) -> &T {
        self.inner()
    }
}

impl<T, O: Ord + AddAssign<O>> AddAssign<O> for OrderVal<T, O> {
    #[inline]
    fn add_assign(&mut self, rhs: O) {
        self.ord.add_assign(rhs)
    }
}

impl<T, O: Ord + SubAssign<O>> SubAssign<O> for OrderVal<T, O> {
    #[inline]
    fn sub_assign(&mut self, rhs: O) {
        self.ord.sub_assign(rhs)
    }
}

impl<T, O: Ord + DivAssign<O>> DivAssign<O> for OrderVal<T, O> {
    #[inline]
    fn div_assign(&mut self, rhs: O) {
        self.ord.div_assign(rhs)
    }
}

impl<T, O: Ord + MulAssign<O>> MulAssign<O> for OrderVal<T, O> {
    #[inline]
    fn mul_assign(&mut self, rhs: O) {
        self.ord.mul_assign(rhs)
    }
}

impl<T: Hash, O: Hash + Ord> Hash for OrderVal<T, O> {
    #[inline]
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        self.val.hash(state);
    }
}