@Override public String next() { return getValueForKey(valuesIt.nextShort()); } };
@Override public ShortColumn removeMissing() { ShortColumn result = copy(); result.clear(); ShortListIterator iterator = data.iterator(); while (iterator.hasNext()) { final short v = iterator.nextShort(); if (!isMissingValue(v)) { result.append(v); } } return result; }
@Override public short nextShort() { return i.nextShort(); } @Override
@Override public short nextShort() { return i.nextShort(); } @Override
@Override public ShortListIterator listIterator(final int i) { if (i > 1 || i < 0) throw new IndexOutOfBoundsException(); final ShortListIterator l = listIterator(); if (i == 1) l.nextShort(); return l; } @Override
@Override public String next() { return getValueForKey(valuesIt.nextShort()); } };
@Override public boolean equals(final Object o) { if (o == this) return true; if (!(o instanceof List)) return false; final List<?> l = (List<?>) o; int s = size(); if (s != l.size()) return false; if (l instanceof ShortList) { final ShortListIterator i1 = listIterator(), i2 = ((ShortList) l).listIterator(); while (s-- != 0) if (i1.nextShort() != i2.nextShort()) return false; return true; } final ListIterator<?> i1 = listIterator(), i2 = l.listIterator(); while (s-- != 0) if (!valEquals(i1.next(), i2.next())) return false; return true; } /**
/** * {@inheritDoc} * * <p> * This is a trivial iterator-based implementation. It is expected that * implementations will override this method with a more optimized version. */ @Override public void getElements(final int from, final short a[], int offset, int length) { ShortListIterator i = listIterator(from); if (offset < 0) throw new ArrayIndexOutOfBoundsException("Offset (" + offset + ") is negative"); if (offset + length > a.length) throw new ArrayIndexOutOfBoundsException( "End index (" + (offset + length) + ") is greater than array length (" + a.length + ")"); if (from + length > size()) throw new IndexOutOfBoundsException( "End index (" + (from + length) + ") is greater than list size (" + size() + ")"); while (length-- != 0) a[offset++] = i.nextShort(); } /**
@Override public int indexOf(final short k) { final ShortListIterator i = listIterator(); short e; while (i.hasNext()) { e = i.nextShort(); if (((k) == (e))) return i.previousIndex(); } return -1; } @Override
/** * {@inheritDoc} * * <p> * This is a trivial iterator-based implementation. It is expected that * implementations will override this method with a more optimized version. */ @Override public void removeElements(final int from, final int to) { ensureIndex(to); ShortListIterator i = listIterator(from); int n = to - from; if (n < 0) throw new IllegalArgumentException("Start index (" + from + ") is greater than end index (" + to + ")"); while (n-- != 0) { i.nextShort(); i.remove(); } } /**
@Override public ShortColumn removeMissing() { ShortColumn result = copy(); result.clear(); ShortListIterator iterator = data.iterator(); while (iterator.hasNext()) { final short v = iterator.nextShort(); if (!isMissingValue(v)) { result.append(v); } } return result; }