package com.github.kratorius.cuckoohash;

public class ViewsTest {
}

@@ -39,31 +39,1201 @@
 h;%0A%0A
-public class ViewsTest %7B
+import junit.framework.TestCase;%0A%0Aimport java.util.AbstractMap;%0Aimport java.util.Map;%0Aimport java.util.Set;%0A%0A/**%0A * Tests for entrySet(), keySet() and values().%0A */%0Apublic class ViewsTest extends TestCase %7B%0A  @SuppressWarnings(%22MismatchedQueryAndUpdateOfCollection%22)%0A  public void testEmptyEntrySet() %7B%0A    CuckooHashMap%3CString, Integer%3E m = new CuckooHashMap%3C%3E();%0A    assertTrue(m.entrySet().isEmpty());%0A  %7D%0A%0A  public void testSimpleEntrySet() %7B%0A    CuckooHashMap%3CString, Integer%3E m = new CuckooHashMap%3C%3E();%0A%0A    m.put(%22key1%22, 1);%0A    assertEquals(1, m.entrySet().size());%0A%0A    Map.Entry%3CString, Integer%3E item = m.entrySet().iterator().next();%0A    assertEquals(1, (int) item.getValue());%0A  %7D%0A%0A  public void testLargeEntrySet() %7B%0A    final int size = 1024;%0A    CuckooHashMap%3CString, Integer%3E m = new CuckooHashMap%3C%3E();%0A%0A    for (int i = 0; i %3C size; i++)%7B%0A      m.put(%22key-%22 + i, 100);%0A    %7D%0A%0A    Set%3CMap.Entry%3CString, Integer%3E%3E entrySet = m.entrySet();%0A    assertEquals(size, entrySet.size());%0A    assertEquals(size, m.size());%0A%0A    for (int i = 0; i %3C size; i++) %7B%0A      assertTrue(entrySet.contains(new AbstractMap.SimpleEntry%3C%3E(%22key-%22 + i, 100)));%0A    %7D%0A  %7D%0A%0A  // TODO keySet() and values()
 %0A%7D%0A

Add thorough tests for entrySet()