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
|
/*
* Licensed to Elasticsearch under one or more contributor
* license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright
* ownership. Elasticsearch licenses this file to you 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 org.elasticsearch.common.util;
import com.carrotsearch.hppc.LongLongHashMap;
import com.carrotsearch.hppc.LongLongMap;
import com.carrotsearch.hppc.cursors.LongLongCursor;
import org.elasticsearch.test.ESSingleNodeTestCase;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
public class LongHashTests extends ESSingleNodeTestCase {
LongHash hash;
private void newHash() {
if (hash != null) {
hash.close();
}
// Test high load factors to make sure that collision resolution works fine
final float maxLoadFactor = 0.6f + randomFloat() * 0.39f;
hash = new LongHash(randomIntBetween(0, 100), maxLoadFactor, BigArraysTests.randombigArrays());
}
@Override
public void setUp() throws Exception {
super.setUp();
newHash();
}
public void testDuell() {
final Long[] values = new Long[randomIntBetween(1, 100000)];
for (int i = 0; i < values.length; ++i) {
values[i] = randomLong();
}
final LongLongMap valueToId = new LongLongHashMap();
final long[] idToValue = new long[values.length];
final int iters = randomInt(1000000);
for (int i = 0; i < iters; ++i) {
final Long value = randomFrom(values);
if (valueToId.containsKey(value)) {
assertEquals(-1 - valueToId.get(value), hash.add(value));
} else {
assertEquals(valueToId.size(), hash.add(value));
idToValue[valueToId.size()] = value;
valueToId.put(value, valueToId.size());
}
}
assertEquals(valueToId.size(), hash.size());
for (Iterator<LongLongCursor> iterator = valueToId.iterator(); iterator.hasNext(); ) {
final LongLongCursor next = iterator.next();
assertEquals(next.value, hash.find(next.key));
}
for (long i = 0; i < hash.capacity(); ++i) {
final long id = hash.id(i);
if (id >= 0) {
assertEquals(idToValue[(int) id], hash.get(id));
}
}
for (long i = 0; i < hash.size(); i++) {
assertEquals(idToValue[(int) i], hash.get(i));
}
hash.close();
}
public void testSize() {
int num = scaledRandomIntBetween(2, 20);
for (int j = 0; j < num; j++) {
final int mod = 1 + randomInt(40);
for (int i = 0; i < 797; i++) {
long count = hash.size();
long key = hash.add(randomLong());
if (key < 0)
assertEquals(hash.size(), count);
else
assertEquals(hash.size(), count + 1);
if (i % mod == 0) {
newHash();
}
}
}
hash.close();
}
public void testKey() {
int num = scaledRandomIntBetween(2, 20);
for (int j = 0; j < num; j++) {
Map<Long, Long> longs = new HashMap<>();
int uniqueCount = 0;
for (int i = 0; i < 797; i++) {
long ref = randomLong();
long count = hash.size();
long key = hash.add(ref);
if (key >= 0) {
assertNull(longs.put(ref, key));
assertEquals(uniqueCount, key);
uniqueCount++;
assertEquals(hash.size(), count + 1);
} else {
assertTrue((-key) - 1L < count);
assertEquals(hash.size(), count);
}
}
for (Map.Entry<Long, Long> entry : longs.entrySet()) {
long expected = entry.getKey();
long keyIdx = entry.getValue();
assertEquals(expected, hash.get(keyIdx));
}
newHash();
}
hash.close();
}
public void testAdd() {
int num = scaledRandomIntBetween(2, 20);
for (int j = 0; j < num; j++) {
Set<Long> longs = new HashSet<>();
int uniqueCount = 0;
for (int i = 0; i < 797; i++) {
long ref = randomLong();
long count = hash.size();
long key = hash.add(ref);
if (key >= 0) {
assertTrue(longs.add(ref));
assertEquals(uniqueCount, key);
assertEquals(hash.size(), count + 1);
uniqueCount++;
} else {
assertFalse(longs.add(ref));
assertTrue((-key) - 1 < count);
assertEquals(ref, hash.get((-key) - 1));
assertEquals(count, hash.size());
}
}
assertAllIn(longs, hash);
newHash();
}
hash.close();
}
public void testFind() throws Exception {
int num = scaledRandomIntBetween(2, 20);
for (int j = 0; j < num; j++) {
Set<Long> longs = new HashSet<>();
int uniqueCount = 0;
for (int i = 0; i < 797; i++) {
long ref = randomLong();
long count = hash.size();
long key = hash.find(ref);
if (key >= 0) { // found in hash
assertFalse(longs.add(ref));
assertTrue(key < count);
assertEquals(ref, hash.get(key));
assertEquals(count, hash.size());
} else {
key = hash.add(ref);
assertTrue(longs.add(ref));
assertEquals(uniqueCount, key);
assertEquals(hash.size(), count + 1);
uniqueCount++;
}
}
assertAllIn(longs, hash);
newHash();
}
hash.close();
}
private static void assertAllIn(Set<Long> longs, LongHash hash) {
long count = hash.size();
for (Long l : longs) {
long key = hash.add(l); // add again to check duplicates
assertEquals(l.longValue(), hash.get((-key) - 1));
assertEquals(count, hash.size());
assertTrue("key: " + key + " count: " + count + " long: " + l, key < count);
}
}
}
|
