1/*2 * Licensed to the Apache Software Foundation (ASF) under one3 * or more contributor license agreements. See the NOTICE file4 * distributed with this work for additional information5 * regarding copyright ownership. The ASF licenses this file6 * to you under the Apache License, Version 2.0 (the7 * "License"); you may not use this file except in compliance8 * with the License. You may obtain a copy of the License at9 *10 * http://www.apache.org/licenses/LICENSE-2.011 *12 * Unless required by applicable law or agreed to in writing, software13 * distributed under the License is distributed on an "AS IS" BASIS,14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.15 * See the License for the specific language governing permissions and16 * limitations under the License.17 */1819package org.apache.giraph.comm;
2021import org.apache.giraph.utils.IncreasingBitSet;
22import org.junit.Test;
2324importstatic org.junit.Assert.assertEquals;
25importstatic org.junit.Assert.assertFalse;
26importstatic org.junit.Assert.assertTrue;
2728/**29 * Test IncreasingBitSetTest30 */31publicclassIncreasingBitSetTest {
32 @Test
33publicvoid add256kIntegers() {
34 IncreasingBitSet IncreasingBitSet = new IncreasingBitSet();
35for (int i = 0; i < 256 * 1024; ++i) {
36 assertFalse(IncreasingBitSet.has(i));
37 assertTrue(IncreasingBitSet.add(i));
38 assertTrue(IncreasingBitSet.has(i));
39 assertTrue(IncreasingBitSet.size() <=
40 IncreasingBitSet.MIN_BITS_TO_SHIFT);
41 }
42 assertEquals(256 * 1024L, IncreasingBitSet.getLastBaseKey());
43 }
4445 @Test
46publicvoid add256kIntegersAlternate() {
47 IncreasingBitSet IncreasingBitSet = new IncreasingBitSet();
48for (int i = 0; i < 256 * 1024; i += 2) {
49 assertFalse(IncreasingBitSet.has(i));
50 assertTrue(IncreasingBitSet.add(i));
51 assertTrue(IncreasingBitSet.has(i));
52 assertFalse(IncreasingBitSet.has(i + 1));
53 assertTrue(IncreasingBitSet.size() <= 256 * 1024);
54 }
55 assertEquals(128 * 1024L, IncreasingBitSet.cardinality());
56for (int i = 1; i < 256 * 1024; i += 2) {
57 assertFalse(IncreasingBitSet.has(i));
58 assertTrue(IncreasingBitSet.add(i));
59 assertTrue(IncreasingBitSet.has(i));
60 assertTrue(IncreasingBitSet.has(i - 1));
61 assertTrue(IncreasingBitSet.size() <= 256 * 1024);
62 }
63 assertEquals(256 * 1024L, IncreasingBitSet.cardinality());
64 }
6566 @Test
67publicvoid add256kIntegersOutOfOrder() {
68 IncreasingBitSet IncreasingBitSet = new IncreasingBitSet();
69for (int i = 128 * 1024; i < 256 * 1024; ++i) {
70 assertFalse(IncreasingBitSet.has(i));
71 assertTrue(IncreasingBitSet.add(i));
72 assertTrue(IncreasingBitSet.has(i));
73 assertTrue(IncreasingBitSet.size() <= 512 * 1024);
74 }
75 assertEquals(128 * 1024L, IncreasingBitSet.cardinality());
76for (int i = 0; i < 128 * 1024; ++i) {
77 assertFalse(IncreasingBitSet.has(i));
78 assertTrue(IncreasingBitSet.add(i));
79 assertTrue(IncreasingBitSet.has(i));
80 assertTrue(IncreasingBitSet.size() <= 512 * 1024);
81 }
82 assertEquals(256 * 1024L, IncreasingBitSet.cardinality());
83 assertEquals(256 * 1024L, IncreasingBitSet.getLastBaseKey());
84 }
85 }