/** * Trims the capacity of the receiver to be the receiver's current size. Releases any superfluous internal memory. An * application can use this operation to minimize the storage of the receiver. */ @Override public void trimToSize() { // * 1.2 because open addressing's performance exponentially degrades beyond that point // so that even rehashing the table can take very long int newCapacity = nextPrime((int) (1 + 1.2 * size())); if (table.length > newCapacity) { rehash(newCapacity); } }
@Test public void testCopy() { OpenByteByteHashMap map = new OpenByteByteHashMap(); map.put((byte) 11, (byte) 22); OpenByteByteHashMap map2 = (OpenByteByteHashMap) map.copy(); map.clear(); assertEquals(1, map2.size()); }
@Test public void testClone() { OpenByteByteHashMap map = new OpenByteByteHashMap(); map.put((byte) 11, (byte) 22); OpenByteByteHashMap map2 = (OpenByteByteHashMap) map.clone(); map.clear(); assertEquals(1, map2.size()); }
/** * Trims the capacity of the receiver to be the receiver's current size. Releases any superfluous internal memory. An * application can use this operation to minimize the storage of the receiver. */ @Override public void trimToSize() { // * 1.2 because open addressing's performance exponentially degrades beyond that point // so that even rehashing the table can take very long int newCapacity = nextPrime((int) (1 + 1.2 * size())); if (table.length > newCapacity) { rehash(newCapacity); } }
/** * Trims the capacity of the receiver to be the receiver's current size. Releases any superfluous internal memory. An * application can use this operation to minimize the storage of the receiver. */ @Override public void trimToSize() { // * 1.2 because open addressing's performance exponentially degrades beyond that point // so that even rehashing the table can take very long int newCapacity = nextPrime((int) (1 + 1.2 * size())); if (table.length > newCapacity) { rehash(newCapacity); } }