public T set(int index, T element) { return adapter.set(index, element); } public int size() {
public T set(int index, T element) { return listAdapter.set(index, element); } public int size() {
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int index, E element) { ensureIsMutable(); return super.set(index, element); }
/** * Extracts values from partition name without the column names. * @param name Partition name. * @param result The result. Must be pre-sized to the expected number of columns. */ public static AbstractList<String> makeValsFromName( String name, AbstractList<String> result) throws MetaException { assert name != null; String[] parts = slash.split(name, 0); if (result == null) { result = new ArrayList<>(parts.length); for (int i = 0; i < parts.length; ++i) { result.add(null); } } else if (parts.length != result.size()) { throw new MetaException( "Expected " + result.size() + " components, got " + parts.length + " (" + name + ")"); } for (int i = 0; i < parts.length; ++i) { int eq = parts[i].indexOf('='); if (eq <= 0) { throw new MetaException("Unexpected component " + parts[i]); } result.set(i, unescapePathName(parts[i].substring(eq + 1))); } return result; }
public T set(int index, T element) { return adapter.set(index, element); } public int size() {
public T set(int index, T element) { return listAdapter.set(index, element); } public int size() {
public T set(int index, T element) { return adapter.set(index, element); } public int size() {
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int location, E object) { if (modCount == fullList.modCount) { if (location >= 0 && location < size) { return fullList.set(location + offset, object); } throw new IndexOutOfBoundsException(); } throw new ConcurrentModificationException(); }
@Override public E set(int index, E element) { ensureIsMutable(); return super.set(index, element); }
@Override public E set(int index, E element) { ensureIsMutable(); return super.set(index, element); }
@Override public E set(int index, E element) { ensureIsMutable(); return super.set(index, element); }
@Override public E set(int index, E element) { ensureIsMutable(); return super.set(index, element); }
public E set(int index, E element) { rangeCheck(index); checkForComodification(); return l.set(index+offset, element); }
public E set(int index, E element) { rangeCheck(index); checkForComodification(); return l.set(index+offset, element); }