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
use core::hash::{Hash, Hasher};
#[repr(transparent)]
pub struct Unordered<T: ?Sized>(T);
pub trait BorrowUnordered {
fn unordered(&self) -> &Unordered<Self>;
}
impl<T> BorrowUnordered for T {
fn unordered(&self) -> &Unordered<Self> {
unsafe { core::mem::transmute(self) }
}
}
pub trait UnorderedPartialEq {
fn unordered_eq(&self, other: &Self) -> bool;
}
impl<T: UnorderedPartialEq> PartialEq for Unordered<T> {
fn eq(&self, other: &Self) -> bool {
self.0.unordered_eq(&other.0)
}
}
pub trait UnorderedEq: UnorderedPartialEq {}
impl<T: UnorderedEq> Eq for Unordered<T> {}
pub trait UnorderedHash {
fn unordered_hash<H: Hasher>(&self, state: &mut H);
}
impl<T: UnorderedHash> Hash for Unordered<T> {
fn hash<H: Hasher>(&self, state: &mut H) {
self.0.unordered_hash(state)
}
}