it.unimi.dsi.fastutil.objects.ObjectOpenHashSetTest Maven / Gradle / Ivy
The newest version!
package it.unimi.dsi.fastutil.objects;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertNull;
import static org.junit.Assert.assertSame;
import static org.junit.Assert.assertTrue;
import it.unimi.dsi.fastutil.Hash;
import org.junit.Ignore;
import org.junit.Test;
@SuppressWarnings("rawtypes")
public class ObjectOpenHashSetTest {
@Test
@SuppressWarnings("boxing")
public void testStrangeRetainAllCase() {
ObjectArrayList initialElements = ObjectArrayList.wrap(new Integer[] { 586, 940,
1086, 1110, 1168, 1184, 1185, 1191, 1196, 1229, 1237, 1241,
1277, 1282, 1284, 1299, 1308, 1309, 1310, 1314, 1328, 1360,
1366, 1370, 1378, 1388, 1392, 1402, 1406, 1411, 1426, 1437,
1455, 1476, 1489, 1513, 1533, 1538, 1540, 1541, 1543, 1547,
1548, 1551, 1557, 1568, 1575, 1577, 1582, 1583, 1584, 1588,
1591, 1592, 1601, 1610, 1618, 1620, 1633, 1635, 1653, 1654,
1655, 1660, 1661, 1665, 1674, 1686, 1688, 1693, 1700, 1705,
1717, 1720, 1732, 1739, 1740, 1745, 1746, 1752, 1754, 1756,
1765, 1766, 1767, 1771, 1772, 1781, 1789, 1790, 1793, 1801,
1806, 1823, 1825, 1827, 1828, 1829, 1831, 1832, 1837, 1839,
1844, 2962, 2969, 2974, 2990, 3019, 3023, 3029, 3030, 3052,
3072, 3074, 3075, 3093, 3109, 3110, 3115, 3116, 3125, 3137,
3142, 3156, 3160, 3176, 3180, 3188, 3193, 3198, 3207, 3209,
3210, 3213, 3214, 3221, 3225, 3230, 3231, 3236, 3240, 3247,
3261, 4824, 4825, 4834, 4845, 4852, 4858, 4859, 4867, 4871,
4883, 4886, 4887, 4905, 4907, 4911, 4920, 4923, 4924, 4925,
4934, 4942, 4953, 4957, 4965, 4973, 4976, 4980, 4982, 4990,
4993, 6938, 6949, 6953, 7010, 7012, 7034, 7037, 7049, 7076,
7094, 7379, 7384, 7388, 7394, 7414, 7419, 7458, 7459, 7466,
7467 });
ObjectArrayList retainElements = ObjectArrayList.wrap(new Integer[] { 586 });
// Initialize both implementations with the same data
ObjectOpenHashSet instance = new ObjectOpenHashSet(initialElements);
ObjectRBTreeSet referenceInstance = new ObjectRBTreeSet(initialElements);
instance.retainAll(retainElements);
referenceInstance.retainAll(retainElements);
// print the correct result {586}
// System.out.println("ref: " + referenceInstance);
// prints {586, 7379}, which is clearly wrong
// System.out.println("ohm: " + instance);
// Fails
assertEquals(referenceInstance, instance);
}
private static java.util.Random r = new java.util.Random(0);
private static Object genKey() {
return Integer.toBinaryString(r.nextInt());
}
private static void checkTable(ObjectOpenHashSet s) {
final Object[] key = s.key;
assert (s.n & -s.n) == s.n : "Table length is not a power of two: " + s.n;
assert s.n == key.length - 1;
int n = s.n;
while (n-- != 0)
if (key[n] != null && !s.contains(key[n])) throw new AssertionError("Hash table has key " + key[n]
+ " marked as occupied, but the key does not belong to the table");
if (s.containsNull && ! s.contains(null)) throw new AssertionError("Hash table should contain null by internal state, but it doesn't when queried");
if (! s.containsNull && s.contains(null)) throw new AssertionError("Hash table should not contain null by internal state, but it does when queried");
java.util.HashSet t = new java.util.HashSet();
for (int i = s.size(); i-- != 0;)
if (key[i] != null && !t.add((String)key[i])) throw new AssertionError("Key " + key[i] + " appears twice");
}
private static void printProbes(ObjectOpenHashSet m) {
long totProbes = 0;
double totSquareProbes = 0;
int maxProbes = 0;
final Object[] key = m.key;
final double f = (double)m.size / m.n;
for (int i = 0, c = 0; i < m.n; i++) {
if (key[i] != null) c++;
else {
if (c != 0) {
final long p = (c + 1) * (c + 2) / 2;
totProbes += p;
totSquareProbes += (double)p * p;
}
maxProbes = Math.max(c, maxProbes);
c = 0;
totProbes++;
totSquareProbes++;
}
}
final double expected = (double)totProbes / m.n;
System.err.println("Expected probes: " + (
3 * Math.sqrt(3) * (f / ((1 - f) * (1 - f))) + 4 / (9 * f) - 1
) + "; actual: " + expected + "; stddev: " + Math.sqrt(totSquareProbes / m.n - expected * expected) + "; max probes: " + maxProbes);
}
@SuppressWarnings("unchecked")
private static void test(int n, float f) {
int c;
ObjectOpenHashSet m = new ObjectOpenHashSet(Hash.DEFAULT_INITIAL_SIZE, f);
java.util.Set t = new java.util.HashSet();
/* First of all, we fill t with random data. */
for (int i = 0; i < f * n; i++)
t.add((genKey()));
/* Now we add to m the same data */
m.addAll(t);
assertTrue("Error: !m.equals(t) after insertion", m.equals(t));
assertTrue("Error: !t.equals(m) after insertion", t.equals(m));
printProbes(m);
checkTable(m);
/* Now we check that m actually holds that data. */
for (java.util.Iterator i = t.iterator(); i.hasNext();) {
Object e = i.next();
assertTrue("Error: m and t differ on a key (" + e + ") after insertion (iterating on t)", m.contains(e));
}
/* Now we check that m actually holds that data, but iterating on m. */
c = 0;
for (java.util.Iterator i = m.iterator(); i.hasNext();) {
Object e = i.next();
c++;
assertTrue("Error: m and t differ on a key (" + e + ") after insertion (iterating on m)", t.contains(e));
}
assertEquals("Error: m has only " + c + " keys instead of " + t.size() + " after insertion (iterating on m)", c, t.size());
/*
* Now we check that inquiries about random data give the same answer in m and t. For m we
* use the polymorphic method.
*/
for (int i = 0; i < n; i++) {
Object T = genKey();
assertTrue("Error: divergence in keys between t and m (polymorphic method)", m.contains(T) == t.contains((T)));
}
/*
* Again, we check that inquiries about random data give the same answer in m and t, but for
* m we use the standard method.
*/
for (int i = 0; i < n; i++) {
Object T = genKey();
assertTrue("Error: divergence between t and m (standard method)", m.contains((T)) == t.contains((T)));
}
/*
* Check that addOrGet does indeed return the original instance, not a copy
*/
for (java.util.Iterator i = m.iterator(); i.hasNext();) {
Object e = i.next();
Object e2 = m.addOrGet(new StringBuilder((String)e).toString()); // Make a new object!
assertTrue("addOrGet does not return the same object", e == e2);
}
/* This should not have modified the table */
assertTrue("Error: !m.equals(t) after addOrGet no-op", m.equals(t));
assertTrue("Error: !t.equals(m) after addOrGet no-op", t.equals(m));
/* Now we put and remove random data in m and t, checking that the result is the same. */
for (int i = 0; i < 20 * n; i++) {
Object T = genKey();
assertTrue("Error: divergence in add() between t and m", m.add((T)) == t.add((T)));
T = genKey();
assertTrue("Error: divergence in remove() between t and m", m.remove((T)) == t.remove((T)));
}
assertTrue("Error: !m.equals(t) after removal", m.equals(t));
assertTrue("Error: !t.equals(m) after removal", t.equals(m));
checkTable(m);
printProbes(m);
/*
* Now we check that m actually holds that data.
*/
for (java.util.Iterator i = t.iterator(); i.hasNext();) {
Object e = i.next();
assertTrue("Error: m and t differ on a key (" + e + ") after removal (iterating on t)", m.contains(e));
}
/* Now we check that m actually holds that data, but iterating on m. */
for (java.util.Iterator i = m.iterator(); i.hasNext();) {
Object e = i.next();
assertTrue("Error: m and t differ on a key (" + e + ") after removal (iterating on m)", t.contains(e));
}
/* Now we make m into an array, make it again a set and check it is OK. */
Object a[] = m.toArray();
assertTrue("Error: toArray() output (or array-based constructor) is not OK", new ObjectOpenHashSet(a).equals(m));
/* Now we check cloning. */
assertTrue("Error: m does not equal m.clone()", m.equals(m.clone()));
assertTrue("Error: m.clone() does not equal m", m.clone().equals(m));
int h = m.hashCode();
/* Now we save and read m. */
try {
java.io.File ff = new java.io.File("it.unimi.dsi.fastutil.test");
java.io.OutputStream os = new java.io.FileOutputStream(ff);
java.io.ObjectOutputStream oos = new java.io.ObjectOutputStream(os);
oos.writeObject(m);
oos.close();
java.io.InputStream is = new java.io.FileInputStream(ff);
java.io.ObjectInputStream ois = new java.io.ObjectInputStream(is);
m = (ObjectOpenHashSet)ois.readObject();
ois.close();
ff.delete();
}
catch (Exception e) {
e.printStackTrace();
System.exit(1);
}
assertEquals("Error: hashCode() changed after save/read", h, m.hashCode());
checkTable(m);
printProbes(m);
/* Now we check that m actually holds that data, but iterating on m. */
for (java.util.Iterator i = m.iterator(); i.hasNext();) {
Object e = i.next();
assertTrue("Error: m and t differ on a key (" + e + ") after save/read", t.contains(e));
}
/* Now we put and remove random data in m and t, checking that the result is the same. */
for (int i = 0; i < 20 * n; i++) {
Object T = genKey();
assertTrue("Error: divergence in add() between t and m after save/read", m.add((T)) == t.add((T)));
T = genKey();
assertTrue("Error: divergence in remove() between t and m after save/read", m.remove((T)) == t.remove((T)));
}
assertTrue("Error: !m.equals(t) after post-save/read removal", m.equals(t));
assertTrue("Error: !t.equals(m) after post-save/read removal", t.equals(m));
/*
* Now we take out of m everything , and check that it is empty.
*/
for (java.util.Iterator i = m.iterator(); i.hasNext();) {
i.next();
i.remove();
}
assertTrue("Error: m is not empty (as it should be)", m.isEmpty());
return;
}
@Test
public void test1() {
test(1, Hash.DEFAULT_LOAD_FACTOR);
test(1, Hash.FAST_LOAD_FACTOR);
test(1, Hash.VERY_FAST_LOAD_FACTOR);
}
@Test
public void test10() {
test(10, Hash.DEFAULT_LOAD_FACTOR);
test(10, Hash.FAST_LOAD_FACTOR);
test(10, Hash.VERY_FAST_LOAD_FACTOR);
}
@Test
public void test100() {
test(100, Hash.DEFAULT_LOAD_FACTOR);
test(100, Hash.FAST_LOAD_FACTOR);
test(100, Hash.VERY_FAST_LOAD_FACTOR);
}
@Ignore("Too long")
@Test
public void test1000() {
test(1000, Hash.DEFAULT_LOAD_FACTOR);
test(1000, Hash.FAST_LOAD_FACTOR);
test(1000, Hash.VERY_FAST_LOAD_FACTOR);
}
@Test
public void testGet() {
final ObjectOpenHashSet s = new ObjectOpenHashSet();
String a = "a";
assertTrue(s.add(a));
assertSame(a, s.get("a"));
assertNull(s.get("b"));
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy