com.gemstone.gemfire.internal.util.concurrent.CompactConcurrentHashSetJUnitTest Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of gemfire-junit Show documentation
Show all versions of gemfire-junit Show documentation
SnappyData store based off Pivotal GemFireXD
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF 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 com.gemstone.gemfire.internal.util.concurrent;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Random;
import java.util.Set;
import com.gemstone.gemfire.internal.concurrent.CompactConcurrentHashSet2;
import junit.framework.TestCase;
public class CompactConcurrentHashSetJUnitTest extends TestCase {
static int RANGE = 100000;
static int SET_SIZE = 1000;
Random ran = new Random();
public void testEquals() {
Set s1, s2;
s1 = new CompactConcurrentHashSet2();
s2 = new HashSet();
for (int i=0; i<10000; i++) {
int nexti = ran.nextInt(RANGE);
s1.add(nexti);
s2.add(nexti);
assertTrue("expected s1 and s2 to be equal", s1.equals(s2));
assertTrue("expected s1 and s2 to be equal", s2.equals(s1));
}
assertTrue(s1.hashCode() != 0);
s2 = new CompactConcurrentHashSet2(2);
s2.addAll(s1);
assertTrue("expected s1 and s2 to be equal", s1.equals(s2));
assertTrue("expected s1 and s2 to be equal", s2.equals(s1));
}
public void testIterator() {
Set s1;
s1 = new CompactConcurrentHashSet2();
for (int i=0; i<10000; i++) {
int nexti = ran.nextInt(RANGE);
s1.add(nexti);
}
for (Iterator it=s1.iterator(); it.hasNext(); ) {
Integer i = it.next();
assertTrue(s1.contains(i));
it.remove();
if (s1.contains(i)) {
assertTrue(!s1.contains(i));
}
}
assertTrue(s1.size() == 0);
}
public void testSize() {
Set s1, s2;
s1 = new CompactConcurrentHashSet2();
s2 = new HashSet();
for (int i=0; i<10000; i++) {
int nexti = ran.nextInt(RANGE);
s1.add(nexti);
s2.add(nexti);
}
int size = s2.size(); // trust HashSet.size()
assertTrue(s1.size() == size);
s2 = new CompactConcurrentHashSet2(s1);
assertTrue(s2.size() == size);
int i = size-1;
for (Iterator it = s2.iterator(); it.hasNext(); i--) {
s1.remove(it.next());
assertTrue(s1.size() == i);
}
assertTrue(s1.size() == 0);
assertTrue(s1.isEmpty());
assertTrue( !s2.isEmpty() );
s2.clear();
assertTrue(s2.isEmpty());
}
}