public void testIterator() { LongListIterator myIt = decorator.iterator(1, decorator.size() - 1); assertTrue(myIt.hasNext()); assertEquals(1, myIt.nextValue()); assertEquals(2, myIt.nextValue()); myIt.move(1); assertEquals(6, myIt.nextValue()); assertFalse(myIt.hasNext()); assertEquals(4, myIt.index()); assertEquals(2, myIt.get(-2)); } }
checkValueAndCatchNSEE(it); try { it.index(); fail(); } catch (NoSuchElementException ex) { while (it.hasNext()) { it.next(); assertEquals(index++, it.index()); assertEquals(index--, it.index()); it.move(-1); if (it.hasValue()) { it.remove(); try { it.index(); fail(); } catch (IllegalStateException _) { it.remove(); fail(); } catch (NoSuchElementException _) {
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 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)); } }
for (int i = 0; i < ints.length; i++) { it = collection.iterator(); it.move(i); CHECK.order(it, LongCollections.arrayCopy(ints, i, ints.length - i)); for (int i = 0; i < ints.length; i++) { long anInt = ints[i]; assertTrue(it.hasNext()); assertEquals(anInt, it.nextValue()); assertEquals(anInt, collection.get(i)); assertFalse(it.hasNext()); for (int i = 0; i < ints.length; i++) { CheckLongCollection checker = new CheckLongCollection(collection, i);
protected void checkExpand(long[] expected, int index, int count, WritableLongList checked) { assert index <= expected.length; checked.expand(index, count); assertEquals(expected.length + count, checked.size()); LongListIterator it = checked.iterator(); for (int i = 0; i < index; i++) { assertEquals(expected[i], it.nextValue()); } it.move(count); for (int i = index; i < expected.length; i++) { assertEquals(expected[i], it.nextValue()); } }
@Override protected void checkExpand(long[] expected, int index, int count, WritableLongList checked) { assert index <= expected.length; checked.expand(index, count); assertEquals(expected.length + count, checked.size()); LongListIterator it = checked.iterator(); for (int i = 0; i < index; i++) { assertEquals(expected[i], it.nextValue()); } for (int i = 0; i < count; i++) { assertEquals(expected[index], it.nextValue()); } for (int i = index; i < expected.length; i++) { assertEquals(expected[i], it.nextValue()); } }
private void testIteratorGet(long... values) { for (LongListIterator it : getter.get(values)) { checkValueAndCatchNSEE(it); for (int idx = 0; idx < values.length; idx++) { assertTrue(it.hasNext()); assertEquals(values[idx], it.nextValue()); try { it.get(-idx - 1); fail(); } catch (NoSuchElementException _) { // ok } for (int i = 0; i < values.length; i++) { assertEquals(values[i], it.get(-idx + i)); } try { it.get(-idx + values.length); fail(); } catch (NoSuchElementException _) { // ok } } } }
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()); } }
it.move(1); assertEquals(0, it.index()); assertEquals(values[0], it.value()); assertEquals(values[1], it.nextValue()); assertEquals(1, it.index()); assertEquals(values[0], it.get(-1)); assertEquals(values[9], it.get(8)); it.move(-2); fail(); } catch (NoSuchElementException ex) {} it.move(3); assertEquals(4, it.index()); assertEquals(values[4], it.value()); assertEquals(values[4], it.get(0)); it.move(-1); assertEquals(3, it.index()); assertEquals(values[4], it.get(1)); assertEquals(values[4], it.nextValue()); it.move(5); assertEquals(values[9], it.value()); if (length == 10) { assertFalse(it.hasNext()); it.move(-1); assertEquals(values[9], 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()); } } }