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
|
/**
* Created on Sunday, March 28 2010 21:01
*/
package com.jogamp.common.util;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Random;
import org.junit.BeforeClass;
import org.junit.Test;
import static org.junit.Assert.*;
import static java.lang.System.*;
/**
*
* @author Michael Bien
* @author Simon Goller
*/
public class LongIntHashMapTest {
private static int iterations;
private static long[] rndKeys;
private static int[] rndValues;
@BeforeClass
public static void init() {
iterations = 20000;
final int keySeed = 42;
final int valueSeed = 23;
Random keyRnd = new Random(/*keySeed*/);
Random valueRnd = new Random(/*valueSeed*/);
rndKeys = new long[iterations];
rndValues = new int[iterations];
for (int i = 0; i < iterations; i++) {
rndValues[i] = valueRnd.nextInt();
rndKeys[i] = keyRnd.nextLong();
}
}
/**
* Test of put method, of class LongIntHashMap.
*/
@Test
public void testPutRemove() {
final LongIntHashMap intmap = new LongIntHashMap();
final HashMap<Long, Integer> map = new HashMap<Long, Integer>();
// put
for (int i = 0; i < iterations; i++) {
intmap.put(rndKeys[i], rndValues[i]);
assertTrue(intmap.containsValue(rndValues[i]));
assertTrue(intmap.containsKey(rndKeys[i]));
}
for (int i = 0; i < iterations; i++) {
map.put(rndKeys[i], rndValues[i]);
}
assertEquals(map.size(), intmap.size());
for (Entry<Long, Integer> entry : map.entrySet()) {
assertTrue(intmap.containsKey(entry.getKey()));
assertTrue(intmap.containsValue(entry.getValue()));
}
int i = 0;
for (Entry<Long, Integer> entry : map.entrySet()) {
assertEquals((int)entry.getValue(), intmap.remove(entry.getKey()));
assertEquals(map.size() - i - 1, intmap.size());
i++;
}
}
@Test
public void benchmark() {
// simple benchmark
final LongIntHashMap intmap = new LongIntHashMap(1024);
final HashMap<Long, Integer> map = new HashMap<Long, Integer>(1024);
out.println("put");
long time = currentTimeMillis();
for (int i = 0; i < iterations; i++) {
intmap.put(rndKeys[i], rndValues[i]);
}
long intmapTime = (currentTimeMillis() - time);
out.println(" iimap: " + intmapTime+"ms");
time = currentTimeMillis();
for (int i = 0; i < iterations; i++) {
map.put(rndKeys[i], rndValues[i]);
}
long mapTime = (currentTimeMillis() - time);
out.println(" map: " + mapTime+"ms");
assertTrue(intmapTime <= mapTime);
System.out.println();
System.out.println("get");
intmapTime = (currentTimeMillis() - time);
out.println(" iimap: " + intmapTime+"ms");
for (int i = 0; i < iterations; i++) {
intmap.get(rndValues[i]);
}
mapTime = (currentTimeMillis() - time);
out.println(" map: " + mapTime+"ms");
for (int i = 0; i < iterations; i++) {
map.get(rndValues[i]);
}
assertTrue(intmapTime <= mapTime);
out.println();
out.println("remove");
intmapTime = (currentTimeMillis() - time);
out.println(" iimap: " + intmapTime+"ms");
for (int i = 0; i < iterations; i++) {
intmap.remove(rndValues[i]);
}
mapTime = (currentTimeMillis() - time);
out.println(" map: " + mapTime+"ms");
for (int i = 0; i < iterations; i++) {
map.remove(rndValues[i]);
}
assertTrue(intmapTime <= mapTime);
}
}
|
