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
#![deny(
rust_2018_idioms,
missing_debug_implementations,
missing_docs,
clippy::doc_markdown,
clippy::unimplemented
)]
use std::cmp::Ordering;
use std::hash::{Hash, Hasher};
#[derive(Debug, Copy, Clone, Eq)]
pub struct UnorderedPair<T>(pub T, pub T);
impl<T> From<(T, T)> for UnorderedPair<T> {
fn from(tuple: (T, T)) -> UnorderedPair<T> {
UnorderedPair(tuple.0, tuple.1)
}
}
impl<T> Into<(T, T)> for UnorderedPair<T> {
fn into(self) -> (T, T) {
(self.0, self.1)
}
}
impl<T> PartialEq for UnorderedPair<T>
where
T: PartialEq,
{
fn eq(&self, other: &UnorderedPair<T>) -> bool {
(self.0 == other.0 && self.1 == other.1) || (self.0 == other.1 && self.1 == other.0)
}
}
impl<T> Hash for UnorderedPair<T>
where
T: Ord + Hash,
{
fn hash<H>(&self, state: &mut H)
where
H: Hasher,
{
let UnorderedPair(first, second) = self;
match first.cmp(second) {
Ordering::Greater => {
second.hash(state);
first.hash(state);
}
_ => {
first.hash(state);
second.hash(state);
}
}
}
}