@Override public int size() { return map.size(); }
@Override public int size() { return map.size(); }
/** * @return * @see java.util.Map#size() */ @Override public int size() { return map.size(); }
@Override public int size() { return map.size(); }
@Override public int size() { return map.size(); }
public void testEmpty() { PMap<?,?> empty = HashTreePMap.empty(); UtilityTest.assertEqualsAndHash(new HashMap<Object,Object>(), empty); assertEquals(0, empty.size()); assertTrue(empty.isEmpty()); for(@SuppressWarnings("unused") Object e : empty.entrySet()) fail(); }
public void testEmpty() { PMap<?,?> empty = IntTreePMap.empty(); UtilityTest.assertEqualsAndHash(new HashMap<Object,Object>(), empty); assertEquals(0, empty.size()); assertTrue(empty.isEmpty()); for(@SuppressWarnings("unused") Object e : empty.entrySet()) fail(); }
public void testMap() { PMap<Object,String> m = HashTreePMap.<Object,String>empty(); assertEquals(m.size(),0); m = m.plus(1,"One"); assertEquals(m.get(1),"One"); // last three have same hashCode: Object[] keys = {1,2,0,3,ConsPStack.empty()}; String[] values = {"one","two","","three","emptyList"}; for(int i=0;i<keys.length;i++) { m = m.plus(keys[i],values[i]); m = m.minus(keys[i]); m = m.plus(keys[i],values[i]); assertEquals(m.size(),i+1); assertEquals(m.get(keys[i]),values[i]); } for(int i=keys.length-1;i>=0;i--) { m = m.minus(keys[i]); assertEquals(m.size(),i); } }
Random r = new Random(); for(int i=0;i<10000;i++) { if(pmap.size()==0 || r.nextBoolean()) { // add int k = r.nextInt(), v = r.nextInt(); pmap = pmap.plus(k, v); } else { // remove a random key int j = r.nextInt(pmap.size()); for(Entry<Integer,Integer> e : pmap.entrySet()) { int k = e.getKey(); pmap = pmap.minus(s); assertEquals(map.size(), pmap.size()); UtilityTest.assertEqualsAndHash(map, pmap); UtilityTest.assertEqualsAndHash(map.entrySet(), pmap.entrySet());
Random r = new Random(); for(int i=0;i<10000;i++) { if(pmap.size()==0 || r.nextBoolean()) { // add int k = r.nextInt(), v = r.nextInt(); pmap = pmap.plus(k, v); } else { // remove a random key int j = r.nextInt(pmap.size()); for(Entry<Integer,Integer> e : pmap.entrySet()) { int k = e.getKey(); pmap = pmap.minus(s); assertEquals(map.size(), pmap.size()); UtilityTest.assertEqualsAndHash(map, pmap); UtilityTest.assertEqualsAndHash(map.entrySet(), pmap.entrySet());
public Map<UUID, Map<UUID, EventRecord>> values() { Map<UUID, Map<UUID, EventRecord>> result = new HashMap<>(events.size()); for (Map.Entry<UUID, PMap<UUID, EventRecord>> e : events.entrySet()) { UUID k = e.getKey(); PMap<UUID, EventRecord> v = e.getValue(); result.put(k, v); } return result; }
public boolean isEmpty() { int count = 0; for (Map.Entry<?, PMap<UUID, EventRecord>> e : events.entrySet()) { count += e.getValue().size(); } return count == 0; }