-
Notifications
You must be signed in to change notification settings - Fork 24.3k
/
CountedBitSetTests.java
97 lines (81 loc) · 3.81 KB
/
CountedBitSetTests.java
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
/*
* 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.index.translog;
import org.apache.lucene.util.FixedBitSet;
import org.elasticsearch.test.ESTestCase;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import static org.hamcrest.Matchers.equalTo;
public class CountedBitSetTests extends ESTestCase {
public void testCompareToFixedBitset() {
int numBits = (short) randomIntBetween(8, 4096);
final FixedBitSet fixedBitSet = new FixedBitSet(numBits);
final CountedBitSet countedBitSet = new CountedBitSet((short) numBits);
for (int i = 0; i < numBits; i++) {
if (randomBoolean()) {
fixedBitSet.set(i);
countedBitSet.set(i);
}
assertThat(countedBitSet.cardinality(), equalTo(fixedBitSet.cardinality()));
assertThat(countedBitSet.length(), equalTo(fixedBitSet.length()));
}
for (int i = 0; i < numBits; i++) {
assertThat(countedBitSet.get(i), equalTo(fixedBitSet.get(i)));
}
}
public void testReleaseInternalBitSet() {
int numBits = (short) randomIntBetween(8, 4096);
final CountedBitSet countedBitSet = new CountedBitSet((short) numBits);
final List<Integer> values = IntStream.range(0, numBits).boxed().collect(Collectors.toList());
for (int i = 1; i < numBits; i++) {
final int value = values.get(i);
assertThat(countedBitSet.get(value), equalTo(false));
assertThat(countedBitSet.isInternalBitsetReleased(), equalTo(false));
countedBitSet.set(value);
assertThat(countedBitSet.get(value), equalTo(true));
assertThat(countedBitSet.isInternalBitsetReleased(), equalTo(false));
assertThat(countedBitSet.length(), equalTo(numBits));
assertThat(countedBitSet.cardinality(), equalTo(i));
}
// The missing piece to fill all bits.
{
final int value = values.get(0);
assertThat(countedBitSet.get(value), equalTo(false));
assertThat(countedBitSet.isInternalBitsetReleased(), equalTo(false));
countedBitSet.set(value);
assertThat(countedBitSet.get(value), equalTo(true));
assertThat(countedBitSet.isInternalBitsetReleased(), equalTo(true));
assertThat(countedBitSet.length(), equalTo(numBits));
assertThat(countedBitSet.cardinality(), equalTo(numBits));
}
// Tests with released internal bitset.
final int iterations = iterations(1000, 10000);
for (int i = 0; i < iterations; i++) {
final int value = randomInt(numBits - 1);
assertThat(countedBitSet.get(value), equalTo(true));
assertThat(countedBitSet.isInternalBitsetReleased(), equalTo(true));
assertThat(countedBitSet.length(), equalTo(numBits));
assertThat(countedBitSet.cardinality(), equalTo(numBits));
if (frequently()) {
assertThat(countedBitSet.get(value), equalTo(true));
}
}
}
}