double-map 0.14.0

A HashMap with double key to single data/value
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175

// use super::{InsertError, TryInsertError, OccupiedError};
// use super::ErrorKind;
use super::DHashMap;

#[test]
fn test_zero_capacities() {
    type HM = DHashMap<i32, i32, i32>;
    use std::collections::hash_map::RandomState;

    let m = HM::new();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let m = HM::with_hasher(RandomState::new());
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let m = HM::with_capacity(0);
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let m = HM::with_capacity_and_hasher(0, RandomState::new());
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    m.insert(1, 1, 1);
    m.insert(2, 2, 2);
    assert_eq!(m.get_key1(&1), Some(&1));
    assert_eq!(m.get_key1(&2), Some(&2));
    m.remove_key1(&1);
    m.remove_key1(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    m.insert(1, 1, 1);
    m.insert(2, 2, 2);
    assert_eq!(m.get_key2(&1), Some(&1));
    assert_eq!(m.get_key2(&2), Some(&2));
    m.remove_key2(&1);
    m.remove_key2(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    let _ = m.try_insert(1, 1, 1);
    let _ = m.try_insert(2, 2, 2);
    assert_eq!(m.get_key1(&1), Some(&1));
    assert_eq!(m.get_key1(&2), Some(&2));
    m.remove_key1(&1);
    m.remove_key1(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    let _ = m.try_insert(1, 1, 1);
    let _ = m.try_insert(2, 2, 2);
    assert_eq!(m.get_key2(&1), Some(&1));
    assert_eq!(m.get_key2(&2), Some(&2));
    m.remove_key2(&1);
    m.remove_key2(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    m.insert_unchecked(1, 1, 1);
    m.insert_unchecked(2, 2, 2);
    assert_eq!(m.get_key1(&1), Some(&1));
    assert_eq!(m.get_key1(&2), Some(&2));
    m.remove_key1(&1);
    m.remove_key1(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    m.insert_unchecked(1, 1, 1);
    m.insert_unchecked(2, 2, 2);
    assert_eq!(m.get_key2(&1), Some(&1));
    assert_eq!(m.get_key2(&2), Some(&2));
    m.remove_key2(&1);
    m.remove_key2(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    let _ = m.entry(1, 1).map(|e| e.or_insert(1));
    let _ = m.entry(2, 2).map(|e| e.or_insert(2));
    assert_eq!(m.get_key1(&1), Some(&1));
    assert_eq!(m.get_key1(&2), Some(&2));
    m.remove_key1(&1);
    m.remove_key1(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    let _ = m.entry(1, 1).map(|e| e.or_insert(1));
    let _ = m.entry(2, 2).map(|e| e.or_insert(2));
    assert_eq!(m.get_key2(&1), Some(&1));
    assert_eq!(m.get_key2(&2), Some(&2));
    m.remove_key2(&1);
    m.remove_key2(&2);
    m.shrink_to_fit();
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);

    let mut m = HM::new();
    m.reserve(0);
    assert_eq!(m.capacity(), 0);
    assert_eq!(m.value_map.capacity(), 0);
    assert_eq!(m.key_map.capacity(), 0);
}

#[test]
fn test_create_capacity_zero() {
    let mut m = DHashMap::with_capacity(0);

    assert!(m.insert(1, 1, 10).is_none());

    assert_eq!(m.get_key1(&1), Some(&10));
    assert_eq!(m.get_key1(&0), None);
    assert_eq!(m.get_key2(&1), Some(&10));
    assert_eq!(m.get_key2(&0), None);
    //assert!(m.contains_key1(&1));
    //assert!(!m.contains_key1(&0));
}

#[test]
fn test_insert() {
    let mut m = DHashMap::new();
    assert_eq!(m.len(), 0);
    assert!(m.insert(1, 3, 10).is_none());
    assert_eq!(m.len(), 1);
    assert!(m.insert(2, 4, 20).is_none());
    assert_eq!(m.len(), 2);
    assert_eq!(*m.get_key1(&1).unwrap(), 10);
    assert_eq!(*m.get_key1(&2).unwrap(), 20);
    assert_eq!(*m.get_key2(&3).unwrap(), 10);
    assert_eq!(*m.get_key2(&4).unwrap(), 20);
}

#[test]
fn test_clone() {
    let mut m = DHashMap::new();
    assert_eq!(m.len(), 0);
    assert!(m.insert(1, 3, 10).is_none());
    assert_eq!(m.len(), 1);
    assert!(m.insert(2, 4, 20).is_none());
    assert_eq!(m.len(), 2);
    let m2 = m.clone();
    assert_eq!(*m2.get_key1(&1).unwrap(), 10);
    assert_eq!(*m2.get_key1(&2).unwrap(), 20);
    assert_eq!(*m2.get_key2(&3).unwrap(), 10);
    assert_eq!(*m2.get_key2(&4).unwrap(), 20);
    assert_eq!(m2.len(), 2);
}