@Override protected void setUp() throws Exception { myArray.clear(); }
protected void tearDown() throws Exception { array.clear(); array = null; super.tearDown(); }
public void testSetRangeAndRemoveRangeComplex() { int[][] countsArray = {{1, 1, 1, 1, 1}, {1, 2, 3, 4, 5}, {5, 4, 3, 2, 1}, {2, 1, 2, 1, 2}}; long[][] valuesArray = {{0, 10, 20, 30, 40}, {-1, 1, -1, 1, -1}, {0, 1, 2, 0, 3}}; for (int[] counts : countsArray) { int size = 0; LongArray values = new LongArray(size); for (int count : counts) size += count; for (long[] values0 : valuesArray) { values.clear(); assert values0.length == counts.length; for (int j = 0; j < counts.length; j++) { values.addAll(LongCollections.repeat(values0[j], counts[j])); } checkSetRangeAndRemoveRange(values); } } }
public void testArray_RemoveSubsequentDuplicates() { myArray.addAll(1, 1, 2); myArray.sortUnique(); checkCollection(myArray, 1, 2); myArray.clear(); myArray.addAll(1, 2, 2, 3); myArray.sortUnique(); checkCollection(myArray, 1, 2, 3); myArray.clear(); myArray.addAll(1, 2, 3, 3); myArray.sortUnique(); checkCollection(myArray, 1, 2, 3); myArray.clear(); myArray.addAll(1, 1, 2, 2, 3, 3); myArray.sortUnique(); checkCollection(myArray, 1, 2, 3); }
public void testAdd() { int attempts = 12; int addCount = 100, maxVal = Integer.MAX_VALUE; LongArray expected = new LongArray(addCount); for (int attempt = 0; attempt < attempts; attempt++) { if (attempt % 3 == 0) set = createSet(); set.clear(); expected.clear(); for (int i = 0, n = myRand.nextInt(addCount); i < n; i++) { int value = myRand.nextInt(maxVal); set.add(value); expected.add(value); } expected.sortUnique(); checkSet(set, expected); } }
public void testRemoveSorted() { array = LongArray.create(0, 20, 21, 30, 35, 80); assertTrue(array.removeSorted(20)); CHECK.order(LongArray.create(0, 21, 30, 35, 80), array); array.clear(); assertFalse(array.removeSorted(0)); array.addAll(0, 1, 1, 1, 2, 10); assertTrue(array.removeSorted(1)); CHECK.order(array, 0, 1, 1, 2, 10); }
public void testRandom2() { int setSize = 510, listSize = 510; int nAttempts = 10; LongArray toAdd = new LongArray(listSize); for (int attempt = 0; attempt < nAttempts; ++attempt) { LongTreeSet treeSet = new LongTreeSet(setSize); LongArray expected = generateRandomLongArray(setSize, IntegersFixture.SortedStatus.UNORDERED); treeSet.addAll(expected); expected.sortUnique(); toAdd.clear(); toAdd.addAll(generateRandomLongArray(listSize, IntegersFixture.SortedStatus.SORTED_UNIQUE)); for (LongIterator it: treeSet) { toAdd.removeAllSorted(it.value()); } treeSet.addAll(toAdd); treeSet.removeAll(toAdd); treeSet.compactify(); CHECK.order(expected, treeSet.toArray()); } }
for (int[] set: sets) { inicIts(); expected.clear(); for (int i: set) { expected.addAll(its[i]);
public void testInsertingDecoratorIterator() { myArray.addAll(1, 2, 4, 7, 8, 9, 11); LongListInsertingDecorator dec = new LongListInsertingDecorator(myArray); dec.insert(0, 0); dec.insert(3, 3); dec.insert(5, 5); dec.insert(6, 6); dec.insert(10, 10); assertEquals(12, dec.size()); int x = 0; for (LongIterator i : dec) { assertEquals(x++, i.value()); } assertEquals(12, x); myArray.clear(); myArray.addAll(1, 2); dec = new LongListInsertingDecorator(myArray); dec.insert(0, 0); x = 0; for (LongIterator i: dec) { assertEquals(x++, i.value()); } }
public void testRandom(int maxVal, int setSize, int listSize, int nAttempts) { LongArray toAdd = new LongArray(listSize); for (int attempt = 0; attempt < nAttempts; ++attempt) { if (attempt % 3 == 0) set = createSet(); LongArray expected = generateRandomLongArray(setSize, UNORDERED, maxVal); set.clear(); set.addAll(expected); expected.sortUnique(); checkSet(set, expected); toAdd.clear(); toAdd.addAll(generateRandomLongArray(listSize, SORTED_UNIQUE, maxVal)); for (LongIterator it: set) { toAdd.removeAllSorted(it.value()); } set.addAll(toAdd); LongArray expected2 = LongArray.copy(expected); expected2.merge(toAdd); checkSet(set, expected2); set.removeAll(toAdd); checkSet(set, expected); } }
public void testIterators() { // assumed that method createMapsFromLists returns variants with all constructors int attemptsCount = 10; int maxSize = 50; // int maxSize = 1000; for (int attempt = 0; attempt < attemptsCount; attempt++) { LongArray keys = generateRandomLongArray(maxSize, SORTED_UNIQUE); IntArray values = generateRandomIntArray(keys.size(), UNORDERED); for (T map : createMapsFromLists(keys, values)) { LongArray actualKeys = LongCollections.collectIterables(map.size(), map.keysIterator()); IntArray actualValues = IntCollections.collectIterable(map.size(), map.valuesIterator()); CHECK.unordered(actualKeys, keys); CHECK.unordered(actualValues, values); actualKeys.clear(); actualValues.clear(); for (LongIntIterator iter : map) { actualKeys.add(iter.left()); actualValues.add(iter.right()); } CHECK.unordered(actualKeys, keys); CHECK.unordered(actualValues, values); } } }
public void testRandom(int maxVal, int setSize, int listSize, int nAttempts) { set = new LongAmortizedSet(); LongArray toAdd = new LongArray(listSize); for (int attempt = 0; attempt < nAttempts; ++attempt) { if (attempt % 3 == 0) set = new LongAmortizedSet(); LongArray expected = generateRandomLongArray(setSize, UNORDERED, maxVal); set.clear(); set.addAll(expected); expected.sortUnique(); checkSet(set, expected); toAdd.clear(); toAdd.addAll(generateRandomLongArray(listSize, SORTED_UNIQUE, maxVal)); for (LongIterator it : set) { toAdd.removeAllSorted(it.value()); } set.addAll(toAdd); LongArray expected2 = LongArray.copy(expected); expected2.merge(toAdd); checkSet(set, expected2); set.removeAll(toAdd); set.coalesce(); LongArray notExpected = collectLists(map(LongFunctions.INC, expected), map(LongFunctions.DEC, expected)); notExpected.removeAll(expected); set.removeAll(notExpected); checkSet(set, expected); } }