intid-core 0.3.9

Defines the IntegerId trait without a dependency on intid_derive
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

//! Implements [`OrderByInt`].

use crate::{EquivalentId, IntegerId, IntegerIdContiguous, IntegerIdCounter};
use core::cmp::Ordering;
use core::hash::{Hash, Hasher};

/// A wrapper around an [`IntegerId`] which implements [`Eq`], [`Ord`], and [`Hash`]
/// based on the integer value.
#[derive(Copy, Clone, Debug, Default)]
pub struct OrderByInt<T: IntegerId>(pub T);
impl<T: IntegerId> IntegerId for OrderByInt<T> {
    impl_newtype_id_body!(for OrderByInt(T));
}
impl<T: IntegerIdContiguous> IntegerIdContiguous for OrderByInt<T> {}
impl<T: IntegerIdCounter> IntegerIdCounter for OrderByInt<T> {
    const START: Self = OrderByInt(T::START);
    const START_INT: Self::Int = T::START_INT;
}
impl<T: IntegerId> Ord for OrderByInt<T> {
    #[inline]
    fn cmp(&self, other: &Self) -> Ordering {
        self.0.to_int().cmp(&other.0.to_int())
    }
}
impl<T: IntegerId> PartialOrd for OrderByInt<T> {
    #[inline]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}
impl<T: IntegerId> Eq for OrderByInt<T> {}
impl<T: IntegerId> PartialEq for OrderByInt<T> {
    #[inline]
    fn eq(&self, other: &Self) -> bool {
        self.0.to_int() == other.0.to_int()
    }
}
impl<T: IntegerId> PartialEq<T> for OrderByInt<T> {
    #[inline]
    fn eq(&self, other: &T) -> bool {
        self.0 == *other
    }
}

impl<T: IntegerId> PartialOrd<T> for OrderByInt<T> {
    #[inline]
    fn partial_cmp(&self, other: &T) -> Option<Ordering> {
        Some(self.cmp(&OrderByInt(*other)))
    }
}
impl<T: IntegerId> Hash for OrderByInt<T> {
    #[inline]
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.0.to_int().hash(state);
    }
}
impl<T: IntegerId> EquivalentId<T> for OrderByInt<T> {
    #[inline]
    fn as_id(&self) -> T {
        self.0
    }
}
impl<T: IntegerId> EquivalentId<T> for &'_ OrderByInt<T> {
    #[inline]
    fn as_id(&self) -> T {
        self.0
    }
}
impl<T: IntegerId> From<T> for OrderByInt<T> {
    #[inline]
    fn from(value: T) -> Self {
        OrderByInt(value)
    }
}
impl<T: IntegerId> AsRef<T> for OrderByInt<T> {
    #[inline]
    fn as_ref(&self) -> &T {
        &self.0
    }
}
impl<T: IntegerId> AsMut<T> for OrderByInt<T> {
    #[inline]
    fn as_mut(&mut self) -> &mut T {
        &mut self.0
    }
}
/// NOTE: We cannot implement `Borrow`, because our `Hash + Eq` might be different.
#[cfg(any())]
impl<T> Borrow for OrderByInt<T> {}