@Override public short adjustOrPutValue(char key, short newValue, short incrValue) { int i = indexOfInsertion(key); if (i < 0) { //already contained i = -i - 1; this.values[i] += incrValue; return this.values[i]; } else { put(key, newValue); return newValue; } }
@Test public void testAdjustOrPutValue() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.adjustOrPutValue((char)11, (short)1, (short)3); assertEquals(25, map.get((char)11) ); map.adjustOrPutValue((char)15, (short)1, (short)3); assertEquals(1, map.get((char)15) ); }
@Test public void testKeysSortedByValue() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.removeKey((char) 13); CharArrayList keys = new CharArrayList(); map.keysSortedByValue(keys); char[] keysArray = keys.toArray(new char[keys.size()]); assertArrayEquals(new char[] {11, 12, 14}, keysArray ); }
@Test public void testForEachKey() { final CharArrayList keys = new CharArrayList(); OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.removeKey((char) 13); map.forEachKey(new CharProcedure() { @Override public boolean apply(char element) { keys.add(element); return true; } }); char[] keysArray = keys.toArray(new char[keys.size()]); Arrays.sort(keysArray); assertArrayEquals(new char[] {11, 12, 14}, keysArray ); }
int newCapacity = chooseGrowCapacity(this.distinct + 1, this.minLoadFactor, this.maxLoadFactor); rehash(newCapacity); return put(key, value);
@Test public void testValues() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.removeKey((char) 13); ShortArrayList values = new ShortArrayList(100); map.values(values); assertEquals(3, values.size()); values.sort(); assertEquals(22, values.get(0) ); assertEquals(23, values.get(1) ); assertEquals(25, values.get(2) ); }
@Test public void testEquals() { // since there are no other subclasses of // Abstractxxx available, we have to just test the // obvious. OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.removeKey((char) 13); OpenCharShortHashMap map2 = (OpenCharShortHashMap) map.copy(); assertEquals(map, map2); assertTrue(map2.equals(map)); assertFalse("Hello Sailor".equals(map)); assertFalse(map.equals("hello sailor")); map2.removeKey((char) 11); assertFalse(map.equals(map2)); assertFalse(map2.equals(map)); }
@Test public void testContainsKey() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); assertTrue(map.containsKey((char) 11)); assertFalse(map.containsKey((char) 12)); }
@Test public void testContainValue() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); assertTrue(map.containsValue((short) 22)); assertFalse(map.containsValue((short) 23)); }
@Test public void testCopy() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); OpenCharShortHashMap map2 = (OpenCharShortHashMap) map.copy(); map.clear(); assertEquals(1, map2.size()); }
@Test public void testClone() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); OpenCharShortHashMap map2 = (OpenCharShortHashMap) map.clone(); map.clear(); assertEquals(1, map2.size()); }
@Test public void testKeys() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 22); CharArrayList keys = new CharArrayList(); map.keys(keys); keys.sort(); assertEquals(11, keys.get(0) ); assertEquals(12, keys.get(1) ); CharArrayList k2 = map.keys(); k2.sort(); assertEquals(keys, k2); }
@Test public void testPairsMatching() { CharArrayList keyList = new CharArrayList(); ShortArrayList valueList = new ShortArrayList(); OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); map.put((char) 12, (short) 23); map.put((char) 13, (short) 24); map.put((char) 14, (short) 25); map.removeKey((char) 13); map.pairsMatching(new CharShortProcedure() { @Override public boolean apply(char first, short second) { return (first % 2) == 0; }}, keyList, valueList); keyList.sort(); valueList.sort(); assertEquals(2, keyList.size()); assertEquals(2, valueList.size()); assertEquals(12, keyList.get(0) ); assertEquals(14, keyList.get(1) ); assertEquals(23, valueList.get(0) ); assertEquals(25, valueList.get(1) ); }
@Test public void testClear() { OpenCharShortHashMap map = new OpenCharShortHashMap(); map.put((char) 11, (short) 22); assertEquals(1, map.size()); map.clear(); assertEquals(0, map.size()); assertEquals(0, map.get((char) 11), 0.0000001); }
@Override public short adjustOrPutValue(char key, short newValue, short incrValue) { int i = indexOfInsertion(key); if (i < 0) { //already contained i = -i - 1; this.values[i] += incrValue; return this.values[i]; } else { put(key, newValue); return newValue; } }
@Override public short adjustOrPutValue(char key, short newValue, short incrValue) { int i = indexOfInsertion(key); if (i < 0) { //already contained i = -i - 1; this.values[i] += incrValue; return this.values[i]; } else { put(key, newValue); return newValue; } }
int newCapacity = chooseGrowCapacity(this.distinct + 1, this.minLoadFactor, this.maxLoadFactor); rehash(newCapacity); return put(key, value);