public void testPrepareIndices() { IntArray indices = IntArray.create(0, 1, 2, 5, 6, 7); LongListRemovingDecorator.prepareSortedIndices(indices); System.out.println(indices); } }
public void testCreateException() { try { list = LongSameValuesList.create(LongArray.create(1, 2, 3), IntArray.create(1, 2)); fail(); } catch (IllegalArgumentException _) { // ok } try { list = LongSameValuesList.create(LongArray.create(1, 2, 3), IntArray.create(1, -1)); fail(); } catch (IllegalArgumentException _) { // ok } }
public void testRemoveAllAtSorted() { LongArray a = new LongArray(LongProgression.arithmetic(0, 20)); LongCollections.removeAllAtSorted(a, IntArray.create(0, 3, 4, 7, 10, 11, 12, 13, 19)); CHECK.order(a.iterator(), 1, 2, 5, 6, 8, 9, 14, 15, 16, 17, 18); LongCollections.removeAllAtSorted(a, IntArray.create(1, 2, 3, 4, 9)); CHECK.order(a.iterator(), 1, 9, 14, 15, 16, 18); }
public void testSimpleCreateFromSorted() { LongList base = LongArray.create(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); WritableIntList indices = IntArray.create(0, 2, 4, 6, 8); WritableLongListRemovingDecorator arr = WritableLongListRemovingDecorator.createFromSorted(base, indices); CHECK.order(arr.iterator(), 1, 3, 5, 7, 9); }
public void testSimpleCreateFromSorted2() { LongList base = LongArray.create(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); WritableIntList indices = IntArray.create(0, 2, 4, 6, 8); LongListRemovingDecorator.prepareSortedIndices(indices); LongListRemovingDecorator arr = LongListRemovingDecorator.createFromPrepared(base, indices); CHECK.order(arr.iterator(), 1, 3, 5, 7, 9); }
public void testNoSuchElementExceptionCase() { LongArray list = LongArray.create(2, 3, 9); IntListIterator indices = IntArray.create(0, 2).iterator(); LongListIndexedIterator res = new LongListIndexedIterator(list, indices); // check for NSEE try { res.value(); fail("not caught NSEE"); } catch(NoSuchElementException ex) { } } }
public void setUp() throws Exception { super.setUp(); IntIterator arr1 = IntArray.create(1, 2, 3, 4, 5).iterator(); LongIterator arr2 = LongArray.create(5, 10, 15, 20, 25).iterator(); res = IntLongIterators.pair(arr1, arr2); }
public void testSimpleCreateFromSorted() { LongList base = LongArray.create(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); WritableIntList indices = IntArray.create(0, 2, 4, 6, 8); prepareSortedIndices(indices); LongListRemovingDecorator arr = createFromPrepared(base, indices); CHECK.order(arr.iterator(), 1, 3, 5, 7, 9); }
public void testSimpleCase() { LongArray list = LongArray.create(2, 3, 9); IntIterator indices = IntArray.create(0, 2).iterator(); LongIndexedIterator res = new LongIndexedIterator(list, indices); CHECK.order(LongArray.create(2, 9).iterator(), res); list = LongArray.create(1, 2, 3, 4, 5); indices = IntArray.create(0, 2, 4).iterator(); res = new LongIndexedIterator(list, indices); CHECK.order(LongArray.create(1, 3, 5).iterator(), res); }
public void testSet() { for (LongIntListMap map : createMapsFromLists(keys, values)) { map.setAt(0, -1, -10); LongList expectedKeys = LongArray.create(-1, 2, 4, 6, 8); IntList expectedValues = IntArray.create(-10, 11, 21, 31, 41); checkMap(map, expectedKeys, expectedValues); map.setKey(1, 3); try { map.setKey(1, 4); fail(); } catch (IllegalArgumentException ex) { } map.setAt(1, 3, 100); expectedKeys = LongArray.create(-1, 3, 4, 6, 8); expectedValues = IntArray.create(-10, 100, 21, 31, 41); checkMap(map, expectedKeys, expectedValues); } }
public void testSimpleCase() { LongArray list = LongArray.create(2, 3, 9); IntListIterator indices = IntArray.create(0, 2).iterator(); LongListIndexedIterator res = new LongListIndexedIterator(list, indices); CHECK.order(LongArray.create(2, 9).iterator(), res); }
public void testEmptyCase() { LongArray list = LongArray.create(2, 3, 9); IntIterator indices = IntArray.create().iterator(); LongIndexedIterator res = new LongIndexedIterator(list, indices); CHECK.order(LongArray.create().iterator(), res); }
public void testNoSuchElementExceptionCase() { LongArray list = LongArray.create(2, 3, 9); IntIterator indices = IntArray.create(0, 2).iterator(); LongIndexedIterator res = new LongIndexedIterator(list, indices); while (res.hasNext()) { res.nextValue(); } try { res.nextValue(); fail("not caught NSEE"); } catch(NoSuchElementException ex) { } }
public void testIterator() { LongArray source = LongArray.create(10,13,15,14,11,12,16,17,18), expected = LongArray.create(10,15,14,12,16,18), result = new LongArray(); IntArray indices = IntArray.create(1, 4, 7); prepareSortedIndices(indices); LongListRemovingDecorator tst2 = createFromPrepared(source, indices); result.addAll(tst2.iterator()); assertEquals(expected, result); }
public void testGetSimple() { IntArray prepared = IntArray.create(2); prepareSortedIndices(prepared); LongListRemovingDecorator rem = createFromPrepared(range(0, 4), prepared); LongListIterator it = rem.iterator(); it.next(); assertEquals(3, it.get(2)); it.next(); assertEquals(3, it.get(1)); }
public void testSimple() { LongArray array = LongArray.create(0, 1, 2, 3, 4, 5, 6); IntArray indices = IntArray.create(1, 3, 5); prepareSortedIndices(indices); LongListRemovingDecorator rem = createFromPrepared(array, indices); LongArray expected = LongArray.create(0, 2, 4, 6); CHECK.order(expected, rem); LongListIterator it = rem.iterator(); for (int i = 0; i < expected.size(); i++) { assertEquals(expected.get(i), rem.get(i)); assertEquals(expected.get(i), it.nextValue()); } }
public void testSimple() { LongArray array = LongArray.create(0, 1, 2, 3, 4, 5, 6); LongListRemovingDecorator rem = LongListRemovingDecorator.createFromPrepared(array, IntArray.create(1, 2, 3)); // LongListRemovingDecorator rem = LongListRemovingDecorator.prepareSortedIndices(IntArray.create(1, 3, 5)); LongArray expected = LongArray.create(0, 2, 4, 6); for (int i = 0; i < expected.size(); i++) { assertEquals(expected.get(i), rem.get(i)); } CHECK.order(expected, rem); LongListIterator it = rem.iterator(); for (int i = 0; i < expected.size(); i++) { assertEquals(expected.get(i), it.nextValue()); } } }
public void testIndexSimple() { LongArray source = LongArray.create(1, 3, 4, 7, 8, 9); LongListInsertingDecorator tst = new LongListInsertingDecorator(source, new IntLongListMap()); IntArray toInsert = IntArray.create(0, 2, 5, 6, 10); for (IntIterator it : toInsert) { tst.insert(it.value(), it.value()); } // [0*, 1, 2*, 3, 4, 5*, 6*, 7, 8, 9, 10*] LongListIterator it = tst.iterator(); while (it.hasNext()) { it.next(); assertEquals(it.index(), it.value()); } checkCollection(tst, LongProgression.Arithmetic.nativeArray(0, 11, 1)); }
public void testGetNextDiffValueIndex() { LongList testList1 = LongArray.create(1, 1, 2, 2, 2, 2, 3, 2); IntList expectedIndexes = IntArray.create(0, 2, 6, 7); CHECK.order(getNextDifferentValueIndex(testList1), expectedIndexes.iterator()); LongSameValuesList testList2 = new LongSameValuesList(); testList2.addAll(testList1); CHECK.order(getNextDifferentValueIndex(testList2), expectedIndexes.iterator()); LongList testList3 = LongArray.create(0, 0, 1, 1, 1, 1, 10, 1); CHECK.order(getNextDifferentValueIndex(testList3), expectedIndexes.iterator()); LongSameValuesList testList4 = new LongSameValuesList(); testList4.addAll(testList3); CHECK.order(getNextDifferentValueIndex(testList4), expectedIndexes.iterator()); }
public void testIteratorGet() { LongArray source = LongArray.create(10, 13, 15, 14, 11, 12, 16, 17, 18), expected = LongArray.create(10, 15, 14, 12, 16, 18); IntArray indices = IntArray.create(1, 4, 7); prepareSortedIndices(indices); LongListRemovingDecorator tst2 = createFromPrepared(source, indices); LongListIterator it = tst2.iterator(), expIt = expected.iterator(); while (it.hasNext()) { assertEquals(it.nextValue(), expIt.nextValue()); } assertEquals(it.hasNext(), expIt.hasNext()); for (int i = 0; i < expected.size(); i++) { assertEquals(it.get(-i), expIt.get(-i)); } }