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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/*
* Copyright (C) 2017-2022 Sebastiano Vigna
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package it.unimi.dsi.fastutil.ints;
import org.junit.Ignore;
@Ignore
public class StripedInt2IntOpenHashMapTest {
//
//
// private static java.util.Random r = new java.util.Random(0);
//
// private static int genKey() {
// return r.nextInt();
// }
//
// private static int genValue() {
// return r.nextInt();
// }
//
// private static boolean valEquals(Object o1, Object o2) {
// return o1 == null ? o2 == null : o1.equals(o2);
// }
//
// @SuppressWarnings({ "unchecked", "boxing" })
// protected static void test(int n, float f) throws IOException, ClassNotFoundException {
// StripedInt2IntOpenHashMap m = new StripedInt2IntOpenHashMap();
// Map t = new java.util.HashMap();
// /* First of all, we fill t with random data. */
// for (int i = 0; i < n; i++)
// t.put((Integer.valueOf(genKey())), (Integer.valueOf(genValue())));
// /* Now we add to m the same data */
// m.putAll(t);
// assertTrue("Error: !m.equals(t) after insertion", m.equals(t));
// assertTrue("Error: !t.equals(m) after insertion", t.equals(m));
// /*
// * Now we check that m actually holds that data.
// */
// for (java.util.Iterator i = t.entrySet().iterator(); i.hasNext();) {
// java.util.Map.Entry e = (java.util.Map.Entry)i.next();
// assertTrue("Error: m and t differ on an entry (" + e + ") after insertion (iterating on t)", valEquals(e.getValue(), m.get(e.getKey())));
// }
// /* Now we check that m actually holds that data, but iterating on m. */
// for (java.util.Iterator i = m.entrySet().iterator(); i.hasNext();) {
// java.util.Map.Entry e = (java.util.Map.Entry)i.next();
// assertTrue("Error: m and t differ on an entry (" + e + ") after insertion (iterating on m)", valEquals(e.getValue(), t.get(e.getKey())));
// }
// /* Now we check that m actually holds the same keys. */
// for (java.util.Iterator i = t.keySet().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a key (" + o + ") after insertion (iterating on t)", m.containsKey(o));
// assertTrue("Error: m and t differ on a key (" + o + ", in keySet()) after insertion (iterating on t)", m.keySet().contains(o));
// }
// /* Now we check that m actually holds the same keys, but iterating on m. */
// for (java.util.Iterator i = m.keySet().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a key after insertion (iterating on m)", t.containsKey(o));
// assertTrue("Error: m and t differ on a key (in keySet()) after insertion (iterating on m)", t.keySet().contains(o));
// }
// /* Now we check that m actually hold the same values. */
// for (java.util.Iterator i = t.values().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a value after insertion (iterating on t)", m.containsValue(o));
// assertTrue("Error: m and t differ on a value (in values()) after insertion (iterating on t)", m.values().contains(o));
// }
// /* Now we check that m actually hold the same values, but iterating on m. */
// for (java.util.Iterator i = m.values().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a value after insertion (iterating on m)", t.containsValue(o));
// assertTrue("Error: m and t differ on a value (in values()) after insertion (iterating on m)", t.values().contains(o));
// }
// /*
// * Now we check that inquiries about random data give the same answer in m and t. For m we
// * use the polymorphic method.
// */
// for (int i = 0; i < n; i++) {
// int T = genKey();
// assertTrue("Error: divergence in keys between t and m (polymorphic method)", m.containsKey((Integer.valueOf(T))) == t.containsKey((Integer.valueOf(T))));
// assertTrue("Error: divergence between t and m (polymorphic method)",
// !(m.get(T) != (0)) != ((t.get((Integer.valueOf(T))) == null ? (0) : ((((Integer)(t.get((Integer.valueOf(T))))).intValue()))) != (0)) ||
// t.get((Integer.valueOf(T))) != null &&
// !m.get((Integer.valueOf(T))).equals(t.get((Integer.valueOf(T)))));
// }
// /*
// * Again, we check that inquiries about random data give the same answer in m and t, but for
// * m we use the standard method.
// */
// for (int i = 0; i < n; i++) {
// int T = genKey();
// assertTrue("Error: divergence between t and m (standard method)", valEquals(m.get((Integer.valueOf(T))), t.get((Integer.valueOf(T)))));
// }
// /* Now we put and remove random data in m and t, checking that the result is the same. */
// for (int i = 0; i < 20 * n; i++) {
// int T = genKey();
// int U = genValue();
// assertTrue("Error: divergence in put() between t and m",
// valEquals(m.put((Integer.valueOf(T)), (Integer.valueOf(U))), t.put((Integer.valueOf(T)), (Integer.valueOf(U)))));
// T = genKey();
// assertTrue("Error: divergence in remove() between t and m", valEquals(m.remove((Integer.valueOf(T))), t.remove((Integer.valueOf(T)))));
// }
// assertTrue("Error: !m.equals(t) after removal", m.equals(t));
// assertTrue("Error: !t.equals(m) after removal", t.equals(m));
// /*
// * Now we check that m actually holds the same data.
// */
// for (java.util.Iterator i = t.entrySet().iterator(); i.hasNext();) {
// java.util.Map.Entry e = (java.util.Map.Entry)i.next();
// assertTrue("Error: m and t differ on an entry (" + e + ") after removal (iterating on t)", valEquals(e.getValue(), m.get(e.getKey())));
// }
// /* Now we check that m actually holds that data, but iterating on m. */
// for (java.util.Iterator i = m.entrySet().iterator(); i.hasNext();) {
// java.util.Map.Entry e = (java.util.Map.Entry)i.next();
// assertTrue("Error: m and t differ on an entry (" + e + ") after removal (iterating on m)", valEquals(e.getValue(), t.get(e.getKey())));
// }
// /* Now we check that m actually holds the same keys. */
// for (java.util.Iterator i = t.keySet().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a key (" + o + ") after removal (iterating on t)", m.containsKey(o));
// assertTrue("Error: m and t differ on a key (" + o + ", in keySet()) after removal (iterating on t)", m.keySet().contains(o));
// }
// /* Now we check that m actually holds the same keys, but iterating on m. */
// for (java.util.Iterator i = m.keySet().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a key after removal (iterating on m)", t.containsKey(o));
// assertTrue("Error: m and t differ on a key (in keySet()) after removal (iterating on m)", t.keySet().contains(o));
// }
// /* Now we check that m actually hold the same values. */
// for (java.util.Iterator i = t.values().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a value after removal (iterating on t)", m.containsValue(o));
// assertTrue("Error: m and t differ on a value (in values()) after removal (iterating on t)", m.values().contains(o));
// }
// /* Now we check that m actually hold the same values, but iterating on m. */
// for (java.util.Iterator i = m.values().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on a value after removal (iterating on m)", t.containsValue(o));
// assertTrue("Error: m and t differ on a value (in values()) after removal (iterating on m)", t.values().contains(o));
// }
// int h = m.hashCode();
// /* Now we save and read m. */
// java.io.File ff = new java.io.File("it.unimi.dsi.fastutil.test.junit." + m.getClass().getSimpleName() + "." + n);
// java.io.OutputStream os = new java.io.FileOutputStream(ff);
// java.io.ObjectOutputStream oos = new java.io.ObjectOutputStream(os);
// oos.writeObject(m);
// oos.close();
// java.io.InputStream is = new java.io.FileInputStream(ff);
// java.io.ObjectInputStream ois = new java.io.ObjectInputStream(is);
// m = (StripedInt2IntOpenHashMap)ois.readObject();
// ois.close();
// ff.delete();
// assertEquals("Error: hashCode() changed after save/read", m.hashCode(), h);
// /* Now we check that m actually holds that data. */
// for (java.util.Iterator i = t.keySet().iterator(); i.hasNext();) {
// Object o = i.next();
// assertTrue("Error: m and t differ on an entry after save/read", valEquals(m.get(o), t.get(o)));
// }
// /* Now we put and remove random data in m and t, checking that the result is the same. */
// for (int i = 0; i < 20 * n; i++) {
// int T = genKey();
// int U = genValue();
// assertTrue("Error: divergence in put() between t and m after save/read",
// valEquals(m.put((Integer.valueOf(T)), (Integer.valueOf(U))), t.put((Integer.valueOf(T)), (Integer.valueOf(U)))));
// T = genKey();
// Integer result;
// assertTrue("Error: divergence in remove() between t and m after save/read", valEquals(m.remove(T), (result = (Integer)t.remove((Integer.valueOf(T)))) != null ? result.intValue() : 0));
// }
// assertTrue("Error: !m.equals(t) after post-save/read removal", m.equals(t));
// assertTrue("Error: !t.equals(m) after post-save/read removal", t.equals(m));
// /*
// * Now we take out of m everything , and check that it is empty.
// */
// for (java.util.Iterator i = t.keySet().iterator(); i.hasNext();)
// m.remove(i.next());
// assertTrue("Error: m is not empty (as it should be)", m.isEmpty());
// m = new StripedInt2IntOpenHashMap();
// t.clear();
// for(int i = n; i-- != 0;) m.put(i, 1);
// t.putAll(m);
// for(int i = n; i-- != 0;) assertEquals("Error: m and t differ on a key during torture-test insertion.", m.put(i, 2), t.put(Integer.valueOf(i), 2));
//
// assertTrue("Error: !m.equals(t) after torture-test removal", m.equals(t));
// assertTrue("Error: !t.equals(m) after torture-test removal", t.equals(m));
// //assertTrue("Error: !m.equals(m.clone()) after torture-test removal", m.equals(m.clone()));
// //assertTrue("Error: !m.clone().equals(m) after torture-test removal", m.clone().equals(m));
// //m.trim();
// assertTrue("Error: !m.equals(t) after trim()", m.equals(t));
// assertTrue("Error: !t.equals(m) after trim()", t.equals(m));
// return;
// }
//
// @Test
// public void test1() throws IOException, ClassNotFoundException {
// test(1, Hash.DEFAULT_LOAD_FACTOR);
// test(1, Hash.FAST_LOAD_FACTOR);
// test(1, Hash.VERY_FAST_LOAD_FACTOR);
// }
//
// @Test
// public void test10() throws IOException, ClassNotFoundException {
// test(10, Hash.DEFAULT_LOAD_FACTOR);
// test(10, Hash.FAST_LOAD_FACTOR);
// test(10, Hash.VERY_FAST_LOAD_FACTOR);
// }
//
// @Test
// public void test100() throws IOException, ClassNotFoundException {
// test(100, Hash.DEFAULT_LOAD_FACTOR);
// test(100, Hash.FAST_LOAD_FACTOR);
// test(100, Hash.VERY_FAST_LOAD_FACTOR);
// }
//
// @Ignore("Too long")
// @Test
// public void test1000() throws IOException, ClassNotFoundException {
// test(1000, Hash.DEFAULT_LOAD_FACTOR);
// test(1000, Hash.FAST_LOAD_FACTOR);
// test(1000, Hash.VERY_FAST_LOAD_FACTOR);
// }
}
|
