1 |
|
/* |
2 |
< |
* Copyright (c) 1994, 2013, Oracle and/or its affiliates. All rights reserved. |
2 |
> |
* Copyright (c) 1994, 2018, Oracle and/or its affiliates. All rights reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
70 |
|
* |
71 |
|
* <p>As of the Java 2 platform v1.2, this class was retrofitted to |
72 |
|
* implement the {@link List} interface, making it a member of the |
73 |
< |
* <a href="{@docRoot}/../technotes/guides/collections/index.html"> |
73 |
> |
* <a href="{@docRoot}/java/util/package-summary.html#CollectionsFramework"> |
74 |
|
* Java Collections Framework</a>. Unlike the new collection |
75 |
|
* implementations, {@code Vector} is synchronized. If a thread-safe |
76 |
|
* implementation is not needed, it is recommended to use {@link |
307 |
|
if (newSize > elementData.length) |
308 |
|
grow(newSize); |
309 |
|
final Object[] es = elementData; |
310 |
< |
for (int to = elementCount, i = elementCount = newSize; i < to; i++) |
310 |
> |
for (int to = elementCount, i = newSize; i < to; i++) |
311 |
|
es[i] = null; |
312 |
+ |
elementCount = newSize; |
313 |
|
} |
314 |
|
|
315 |
|
/** |
1027 |
|
setBit(deathRow, i - beg); |
1028 |
|
if (modCount != expectedModCount) |
1029 |
|
throw new ConcurrentModificationException(); |
1029 |
– |
expectedModCount++; |
1030 |
|
modCount++; |
1031 |
|
int w = beg; |
1032 |
|
for (i = beg; i < end; i++) |