### Question:
ConcurrentLongLongPairHashMap { public boolean remove(long key1, long key2) { checkBiggerEqualZero(key1); long h = hash(key1, key2); return getSection(h).remove(key1, key2, ValueNotFound, ValueNotFound, (int) h); } ConcurrentLongLongPairHashMap();  ConcurrentLongLongPairHashMap(int expectedItems);  ConcurrentLongLongPairHashMap(int expectedItems, int concurrencyLevel); long size(); long capacity(); boolean isEmpty(); LongPair get(long key1, long key2); boolean containsKey(long key1, long key2); boolean put(long key1, long key2, long value1, long value2); boolean putIfAbsent(long key1, long key2, long value1, long value2); boolean remove(long key1, long key2); boolean remove(long key1, long key2, long value1, long value2); void clear(); void forEach(BiConsumerLongPair processor); List<LongPair> keys(); List<LongPair> values(); Map<LongPair, LongPair> asMap();  }### Answer:
@Test public void testRemove() { ConcurrentLongLongPairHashMap map = new ConcurrentLongLongPairHashMap(); assertTrue(map.isEmpty()); assertTrue(map.put(1, 1, 11, 11)); assertFalse(map.isEmpty()); assertFalse(map.remove(0, 0)); assertFalse(map.remove(1, 1, 111, 111)); assertFalse(map.isEmpty()); assertTrue(map.remove(1, 1, 11, 11)); assertTrue(map.isEmpty()); }