public void checkPutIfAbsent(LongList keys) { map.clear(); for (int i = 0; i < keys.size(); i++) { long key = keys.get(i); int idx = keys.subList(0, i).indexOf(key); if (idx >= 0) { assertEquals(idx, map.get(key)); assertFalse(map.putIfAbsent(key, i)); assertEquals(idx, map.get(key)); } else { assertEquals(LongIntMap.DEFAULT_VALUE, map.get(key)); assertTrue(map.putIfAbsent(key, i)); assertEquals(i, map.get(key)); } } }
public void testPut() { int size = 100, attempts = 10, maxVal = 1000; for (int attempt = 0; attempt < attempts; attempt++) { map.clear(); LongArray keys = generateRandomLongArray(size, SortedStatus.SORTED_UNIQUE, maxVal); LongArray shuffledKeys = LongCollections.collectLists(keys, keys); shuffledKeys.shuffle(myRand); for (int i = 0; i < shuffledKeys.size(); i++) { long key = shuffledKeys.get(i); long prevValue = map.get(key); assertEquals(prevValue, map.put(key, (int) (-key * key))); } } }
public void checkMap(T map, LongList keys, IntList values) { assertEquals(keys.size(), map.size()); assertEquals(keys.isEmpty(), map.isEmpty()); for (int i = 0; i < keys.size(); i++) { assertEquals(values.get(i), map.get(keys.get(i))); } LongArray mapKeys = collectIterable(map.size(), map.keysIterator()); CHECK.unordered(mapKeys, keys); IntArray mapValues = IntCollections.collectIterable(map.size(), map.valuesIterator()); CHECK.unordered(mapValues, values); }
public void testSimpleMap() { for (int i = 0; i < 10; i++) { map.put(i, i * i); } LongArray expected = new LongArray(range(0, 10)); assertEquals(10, map.size()); assertTrue(map.containsKeys(expected)); LongArray actual = new LongArray(10); for (LongIterator keysIt : map.keysIterator()) { actual.add(keysIt.value()); } actual.sort(); CHECK.order(actual.iterator(), expected.iterator()); for (LongIterator it : expected) { long value = it.value(); assertEquals(value * value, map.get(value)); } }