public void checkToNativeArray(LongArray array) { long[] expected = array.toNativeArray(); LongSet set = LongTreeSet.createFromSortedUnique(array); LongIterable[] iterables = {array, set, array.iterator(), set.iterator(), LongIterators.unionIterator(array, array.isEmpty() ? LongIterator.EMPTY : array.subList(0, 1))}; for (LongIterable iterable: iterables) { CHECK.order(expected, LongCollections.toNativeArray(iterable)); } }
public static void checkSet(LongSet set, LongList sortedUniqueExpected) { assert sortedUniqueExpected.isSortedUnique(); assertEquals(sortedUniqueExpected.size(), set.size()); if (set instanceof LongSortedSet) { LongArray buffer = LongCollections.collectIterable(set.size(), set.iterator()); CHECK.order(sortedUniqueExpected, buffer); buffer = set.toArray(); CHECK.order(sortedUniqueExpected, buffer); } else { LongArray setToIterator = LongCollections.collectIterable(set.size(), set.iterator()); LongArray setToArray = set.toArray(); CHECK.order(setToArray, setToIterator); setToArray.sort(); CHECK.order(sortedUniqueExpected, setToArray); } }
public void testIterators2() { if (!isSortedSet()) return; for (T set : createSets(range(10))) { LongIterator it1 = set.iterator(); for (int i = 0; i < 5; i++) { assertEquals(i, it1.nextValue()); } // call coalesce CHECK.order(new LongArray(ap(0, 10, 1)), set.toArray()); CHECK.order(new LongArray(ap(0, 10, 1)).iterator(), set.iterator()); CHECK.order(new LongArray(ap(5, 5, 1)).iterator(), it1); } }
public void testIteratorHasMethods() { for (T set : createSets(LongProgression.range(1, 8))) { LongIterator iterator = set.iterator(); assertFalse(iterator.hasValue()); assertTrue(iterator.hasNext()); iterator.next(); assertTrue(iterator.hasValue()); for (int i = 0; i < 6; i++) { iterator.next(); } assertTrue(iterator.hasValue()); assertFalse(iterator.hasNext()); } }
public void testContains() { int arSize = 45, maxVal = Integer.MAX_VALUE, attempts = 10; for (int attempt = 0; attempt < attempts; attempt++) { LongArray arr = generateRandomLongArray(arSize, SORTED_UNIQUE, maxVal); LongArray arr2 = LongCollections.collectLists(arr, map(LongFunctions.INC, arr), map(LongFunctions.DEC, arr)); arr2.sortUnique(); for (LongSet curSet : createSets(arr)) { for (int i = 0; i < arr2.size(); i++) { long value = arr2.get(i); assertEquals(arr.binarySearch(value) >= 0, curSet.contains(value)); } assertTrue(curSet.containsAll(arr)); assertTrue(curSet.containsAll(curSet)); assertTrue(curSet.containsAll(curSet.iterator())); assertTrue(curSet.containsAll(LongList.EMPTY)); assertFalse(curSet.containsAll(concatLists(arr, new LongList.Single(arr.getLast(0) + 1)))); assertEquals(arr.size(), curSet.size()); } } }