### Question:
ConcurrentLongLongHashMap { public Map<Long, Long> asMap() { Map<Long, Long> map = Maps.newHashMap(); forEach((key, value) -> map.put(key, value)); return map; } ConcurrentLongLongHashMap();  ConcurrentLongLongHashMap(int expectedItems);  ConcurrentLongLongHashMap(int expectedItems, int concurrencyLevel); long size(); long capacity(); boolean isEmpty(); long get(long key); boolean containsKey(long key); long put(long key, long value); long putIfAbsent(long key, long value); long computeIfAbsent(long key, LongLongFunction provider); long addAndGet(long key, long delta); boolean compareAndSet(long key, long currentValue, long newValue); long remove(long key); boolean remove(long key, long value); int removeIf(LongPredicate filter); int removeIf(LongLongPredicate filter); void clear(); void forEach(BiConsumerLong processor); List<Long> keys(); List<Long> values(); Map<Long, Long> asMap();  }### Answer:
@Test public void testAsMap() { ConcurrentLongLongHashMap lmap = new ConcurrentLongLongHashMap(16, 1); lmap.put(1, 11); lmap.put(2, 22); lmap.put(3, 33); Map<Long, Long> map = Maps.newTreeMap(); map.put(1L, 11L); map.put(2L, 22L); map.put(3L, 33L); assertEquals(map, lmap.asMap()); }