@Override public RatingMatrixEntry previous() { final int index = iter.previousInt(); return data.getEntry(index); }
@Override public int previousInt() { return i.previousInt(); } @Override
@Override public int previousInt() { return i.previousInt(); } @Override
@Override public RatingMatrixEntry previous() { final int index = iter.previousInt(); return data.getEntry(index); }
public CharSequence previous() { return frontCodedStringList.get( permutation[ i.previousInt() ] ); } public int nextIndex() { return i.nextIndex(); }
@Override public CharSequence previous() { return frontCodedStringList.get(permutation[i.previousInt()]); } @Override
public CharSequence previous() { return frontCodedStringList.get( permutation[ i.previousInt() ] ); } public int nextIndex() { return i.nextIndex(); }
@Override public int lastIndexOf(final int k) { IntListIterator i = listIterator(size()); int e; while (i.hasPrevious()) { e = i.previousInt(); if (((k) == (e))) return i.nextIndex(); } return -1; } @Override
@Test public void testSimpleListAccess() { IntList list = new IntIntervalList(1); assertFalse(list.isEmpty()); assertEquals(1, list.size()); assertEquals(0, list.getInt(0)); try { list.getInt(1); fail("getInt(1) should throw"); } catch (IndexOutOfBoundsException e) { /* no-op */ } IntListIterator iter = list.iterator(); assertTrue(iter.hasNext()); assertFalse(iter.hasPrevious()); assertEquals(0, iter.nextInt()); assertFalse(iter.hasNext()); assertTrue(iter.hasPrevious()); assertEquals(0, iter.previousInt()); }
@Test public void testSimpleIntervalAccess() { IntList list = new IntIntervalList(42, 43); assertFalse(list.isEmpty()); assertEquals(1, list.size()); assertEquals(42, list.getInt(0)); try { list.getInt(1); fail("getInt(1) should throw"); } catch (IndexOutOfBoundsException e) { /* no-op */ } IntListIterator iter = list.iterator(); assertTrue(iter.hasNext()); assertFalse(iter.hasPrevious()); assertEquals(42, iter.nextInt()); assertFalse(iter.hasNext()); assertTrue(iter.hasPrevious()); assertEquals(42, iter.previousInt()); }