14 |
|
* throughput when invocations of read-only methods by multiple |
15 |
|
* threads are most common. |
16 |
|
* |
17 |
< |
* <p> The iterators returned by this class's {@link #iterator() |
17 |
> |
* <p>The iterators returned by this class's {@link #iterator() |
18 |
|
* iterator} and {@link #listIterator(int) listIterator} methods are |
19 |
|
* best-effort in the presence of concurrent modifications, and do |
20 |
|
* <em>NOT</em> throw {@link ConcurrentModificationException}. An |
93 |
|
* Creates an empty vector with the given initial capacity. |
94 |
|
* |
95 |
|
* @param initialCapacity the initial capacity of the underlying array |
96 |
– |
* |
96 |
|
* @throws IllegalArgumentException if initial capacity is negative |
97 |
|
*/ |
98 |
|
public ReadMostlyVector(int initialCapacity) { |
593 |
|
} |
594 |
|
if (oobe) |
595 |
|
throw new ArrayIndexOutOfBoundsException(index); |
596 |
< |
return (E)e; |
596 |
> |
return e; |
597 |
|
} |
598 |
|
|
599 |
|
public int hashCode() { |
1247 |
|
|
1248 |
|
static final class ReadMostlyVectorSublist<E> |
1249 |
|
implements List<E>, RandomAccess, java.io.Serializable { |
1250 |
< |
static final long serialVersionUID = 3041673470172026059L; |
1250 |
> |
private static final long serialVersionUID = 3041673470172026059L; |
1251 |
|
|
1252 |
|
final ReadMostlyVector<E> list; |
1253 |
|
final int offset; |