[cvs] / jsr166 / src / main / java / util / Vector.java Repository:
ViewVC logotype

Annotation of /jsr166/src/main/java/util/Vector.java

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.30 - (view) (download)

1 : dl 1.1 /*
2 : jsr166 1.30 * Copyright (c) 1994, 2013, Oracle and/or its affiliates. All rights reserved.
3 : jsr166 1.21 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 : dl 1.1 *
5 : jsr166 1.21 * This code is free software; you can redistribute it and/or modify it
6 :     * under the terms of the GNU General Public License version 2 only, as
7 : jsr166 1.30 * published by the Free Software Foundation. Oracle designates this
8 : jsr166 1.21 * particular file as subject to the "Classpath" exception as provided
9 : jsr166 1.30 * by Oracle in the LICENSE file that accompanied this code.
10 : jsr166 1.21 *
11 :     * This code is distributed in the hope that it will be useful, but WITHOUT
12 :     * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 :     * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 :     * version 2 for more details (a copy is included in the LICENSE file that
15 :     * accompanied this code).
16 :     *
17 :     * You should have received a copy of the GNU General Public License version
18 :     * 2 along with this work; if not, write to the Free Software Foundation,
19 :     * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 :     *
21 : jsr166 1.27 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 :     * or visit www.oracle.com if you need additional information or have any
23 :     * questions.
24 : dl 1.1 */
25 :    
26 :     package java.util;
27 :    
28 : jsr166 1.30 import java.util.function.Consumer;
29 :     import java.util.function.Predicate;
30 :     import java.util.function.UnaryOperator;
31 :    
32 : dl 1.1 /**
33 : jsr166 1.14 * The {@code Vector} class implements a growable array of
34 : dl 1.1 * objects. Like an array, it contains components that can be
35 :     * accessed using an integer index. However, the size of a
36 : jsr166 1.14 * {@code Vector} can grow or shrink as needed to accommodate
37 :     * adding and removing items after the {@code Vector} has been created.
38 : dl 1.1 *
39 : jsr166 1.9 * <p>Each vector tries to optimize storage management by maintaining a
40 : jsr166 1.14 * {@code capacity} and a {@code capacityIncrement}. The
41 :     * {@code capacity} is always at least as large as the vector
42 : dl 1.1 * size; it is usually larger because as components are added to the
43 :     * vector, the vector's storage increases in chunks the size of
44 : jsr166 1.14 * {@code capacityIncrement}. An application can increase the
45 : dl 1.1 * capacity of a vector before inserting a large number of
46 : jsr166 1.9 * components; this reduces the amount of incremental reallocation.
47 : dl 1.1 *
48 : jsr166 1.30 * <p id="fail-fast">
49 : jsr166 1.22 * The iterators returned by this class's {@link #iterator() iterator} and
50 :     * {@link #listIterator(int) listIterator} methods are <em>fail-fast</em>:
51 :     * if the vector is structurally modified at any time after the iterator is
52 :     * created, in any way except through the iterator's own
53 :     * {@link ListIterator#remove() remove} or
54 :     * {@link ListIterator#add(Object) add} methods, the iterator will throw a
55 :     * {@link ConcurrentModificationException}. Thus, in the face of
56 :     * concurrent modification, the iterator fails quickly and cleanly, rather
57 :     * than risking arbitrary, non-deterministic behavior at an undetermined
58 :     * time in the future. The {@link Enumeration Enumerations} returned by
59 : jsr166 1.30 * the {@link #elements() elements} method are <em>not</em> fail-fast; if the
60 :     * Vector is structurally modified at any time after the enumeration is
61 :     * created then the results of enumerating are undefined.
62 : dl 1.1 *
63 :     * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
64 :     * as it is, generally speaking, impossible to make any hard guarantees in the
65 :     * presence of unsynchronized concurrent modification. Fail-fast iterators
66 : jsr166 1.14 * throw {@code ConcurrentModificationException} on a best-effort basis.
67 : dl 1.1 * Therefore, it would be wrong to write a program that depended on this
68 :     * exception for its correctness: <i>the fail-fast behavior of iterators
69 : jsr166 1.9 * should be used only to detect bugs.</i>
70 : dl 1.1 *
71 : jsr166 1.9 * <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 : jsr166 1.25 * <a href="{@docRoot}/../technotes/guides/collections/index.html">
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
77 :     * ArrayList} in place of {@code Vector}.
78 : dl 1.1 *
79 : jsr166 1.30 * @param <E> Type of component elements
80 :     *
81 : dl 1.1 * @author Lee Boynton
82 :     * @author Jonathan Payne
83 :     * @see Collection
84 :     * @see LinkedList
85 : jsr166 1.30 * @since 1.0
86 : dl 1.1 */
87 :     public class Vector<E>
88 :     extends AbstractList<E>
89 :     implements List<E>, RandomAccess, Cloneable, java.io.Serializable
90 :     {
91 :     /**
92 :     * The array buffer into which the components of the vector are
93 :     * stored. The capacity of the vector is the length of this array buffer,
94 : jsr166 1.15 * and is at least large enough to contain all the vector's elements.
95 : dl 1.1 *
96 : jsr166 1.15 * <p>Any array elements following the last element in the Vector are null.
97 : dl 1.1 *
98 :     * @serial
99 :     */
100 :     protected Object[] elementData;
101 :    
102 :     /**
103 : jsr166 1.14 * The number of valid components in this {@code Vector} object.
104 :     * Components {@code elementData[0]} through
105 :     * {@code elementData[elementCount-1]} are the actual items.
106 : dl 1.1 *
107 :     * @serial
108 :     */
109 :     protected int elementCount;
110 :    
111 :     /**
112 :     * The amount by which the capacity of the vector is automatically
113 :     * incremented when its size becomes greater than its capacity. If
114 :     * the capacity increment is less than or equal to zero, the capacity
115 :     * of the vector is doubled each time it needs to grow.
116 :     *
117 :     * @serial
118 :     */
119 :     protected int capacityIncrement;
120 :    
121 :     /** use serialVersionUID from JDK 1.0.2 for interoperability */
122 :     private static final long serialVersionUID = -2767605614048989439L;
123 :    
124 :     /**
125 :     * Constructs an empty vector with the specified initial capacity and
126 :     * capacity increment.
127 :     *
128 :     * @param initialCapacity the initial capacity of the vector
129 :     * @param capacityIncrement the amount by which the capacity is
130 :     * increased when the vector overflows
131 : jsr166 1.15 * @throws IllegalArgumentException if the specified initial capacity
132 :     * is negative
133 : dl 1.1 */
134 :     public Vector(int initialCapacity, int capacityIncrement) {
135 : jsr166 1.23 super();
136 : dl 1.1 if (initialCapacity < 0)
137 :     throw new IllegalArgumentException("Illegal Capacity: "+
138 :     initialCapacity);
139 : jsr166 1.23 this.elementData = new Object[initialCapacity];
140 :     this.capacityIncrement = capacityIncrement;
141 : dl 1.1 }
142 :    
143 :     /**
144 :     * Constructs an empty vector with the specified initial capacity and
145 :     * with its capacity increment equal to zero.
146 :     *
147 :     * @param initialCapacity the initial capacity of the vector
148 : jsr166 1.15 * @throws IllegalArgumentException if the specified initial capacity
149 :     * is negative
150 : dl 1.1 */
151 :     public Vector(int initialCapacity) {
152 : jsr166 1.23 this(initialCapacity, 0);
153 : dl 1.1 }
154 :    
155 :     /**
156 :     * Constructs an empty vector so that its internal data array
157 : jsr166 1.14 * has size {@code 10} and its standard capacity increment is
158 : dl 1.1 * zero.
159 :     */
160 :     public Vector() {
161 : jsr166 1.23 this(10);
162 : dl 1.1 }
163 :    
164 :     /**
165 :     * Constructs a vector containing the elements of the specified
166 :     * collection, in the order they are returned by the collection's
167 :     * iterator.
168 :     *
169 :     * @param c the collection whose elements are to be placed into this
170 :     * vector
171 :     * @throws NullPointerException if the specified collection is null
172 :     * @since 1.2
173 :     */
174 :     public Vector(Collection<? extends E> c) {
175 : jsr166 1.23 elementData = c.toArray();
176 :     elementCount = elementData.length;
177 : jsr166 1.30 // defend against c.toArray (incorrectly) not returning Object[]
178 :     // (see e.g. https://bugs.openjdk.java.net/browse/JDK-6260652)
179 : jsr166 1.23 if (elementData.getClass() != Object[].class)
180 :     elementData = Arrays.copyOf(elementData, elementCount, Object[].class);
181 : dl 1.1 }
182 :    
183 :     /**
184 :     * Copies the components of this vector into the specified array.
185 : jsr166 1.14 * The item at index {@code k} in this vector is copied into
186 :     * component {@code k} of {@code anArray}.
187 : dl 1.1 *
188 :     * @param anArray the array into which the components get copied
189 :     * @throws NullPointerException if the given array is null
190 :     * @throws IndexOutOfBoundsException if the specified array is not
191 :     * large enough to hold all the components of this vector
192 :     * @throws ArrayStoreException if a component of this vector is not of
193 :     * a runtime type that can be stored in the specified array
194 :     * @see #toArray(Object[])
195 :     */
196 :     public synchronized void copyInto(Object[] anArray) {
197 : jsr166 1.23 System.arraycopy(elementData, 0, anArray, 0, elementCount);
198 : dl 1.1 }
199 :    
200 :     /**
201 :     * Trims the capacity of this vector to be the vector's current
202 :     * size. If the capacity of this vector is larger than its current
203 :     * size, then the capacity is changed to equal the size by replacing
204 : jsr166 1.14 * its internal data array, kept in the field {@code elementData},
205 : dl 1.1 * with a smaller one. An application can use this operation to
206 :     * minimize the storage of a vector.
207 :     */
208 :     public synchronized void trimToSize() {
209 : jsr166 1.23 modCount++;
210 :     int oldCapacity = elementData.length;
211 :     if (elementCount < oldCapacity) {
212 : dl 1.1 elementData = Arrays.copyOf(elementData, elementCount);
213 : jsr166 1.23 }
214 : dl 1.1 }
215 :    
216 :     /**
217 :     * Increases the capacity of this vector, if necessary, to ensure
218 :     * that it can hold at least the number of components specified by
219 :     * the minimum capacity argument.
220 :     *
221 :     * <p>If the current capacity of this vector is less than
222 : jsr166 1.14 * {@code minCapacity}, then its capacity is increased by replacing its
223 :     * internal data array, kept in the field {@code elementData}, with a
224 : dl 1.1 * larger one. The size of the new data array will be the old size plus
225 : jsr166 1.14 * {@code capacityIncrement}, unless the value of
226 :     * {@code capacityIncrement} is less than or equal to zero, in which case
227 : dl 1.1 * the new capacity will be twice the old capacity; but if this new size
228 : jsr166 1.14 * is still smaller than {@code minCapacity}, then the new capacity will
229 :     * be {@code minCapacity}.
230 : dl 1.1 *
231 :     * @param minCapacity the desired minimum capacity
232 :     */
233 :     public synchronized void ensureCapacity(int minCapacity) {
234 : jsr166 1.30 if (minCapacity > 0) {
235 :     modCount++;
236 :     if (minCapacity > elementData.length)
237 :     grow(minCapacity);
238 :     }
239 :     }
240 :    
241 :     /**
242 :     * The maximum size of array to allocate (unless necessary).
243 :     * Some VMs reserve some header words in an array.
244 :     * Attempts to allocate larger arrays may result in
245 :     * OutOfMemoryError: Requested array size exceeds VM limit
246 :     */
247 :     private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
248 :    
249 :     /**
250 :     * Increases the capacity to ensure that it can hold at least the
251 :     * number of elements specified by the minimum capacity argument.
252 :     *
253 :     * @param minCapacity the desired minimum capacity
254 :     * @throws OutOfMemoryError if minCapacity is less than zero
255 :     */
256 :     private Object[] grow(int minCapacity) {
257 :     return elementData = Arrays.copyOf(elementData,
258 :     newCapacity(minCapacity));
259 :     }
260 :    
261 :     private Object[] grow() {
262 :     return grow(elementCount + 1);
263 : dl 1.1 }
264 :    
265 :     /**
266 : jsr166 1.30 * Returns a capacity at least as large as the given minimum capacity.
267 :     * Will not return a capacity greater than MAX_ARRAY_SIZE unless
268 :     * the given minimum capacity is greater than MAX_ARRAY_SIZE.
269 : dl 1.1 *
270 : jsr166 1.30 * @param minCapacity the desired minimum capacity
271 :     * @throws OutOfMemoryError if minCapacity is less than zero
272 : dl 1.1 */
273 : jsr166 1.30 private int newCapacity(int minCapacity) {
274 :     // overflow-conscious code
275 : jsr166 1.23 int oldCapacity = elementData.length;
276 : jsr166 1.30 int newCapacity = oldCapacity + ((capacityIncrement > 0) ?
277 :     capacityIncrement : oldCapacity);
278 :     if (newCapacity - minCapacity <= 0) {
279 :     if (minCapacity < 0) // overflow
280 :     throw new OutOfMemoryError();
281 :     return minCapacity;
282 :     }
283 :     return (newCapacity - MAX_ARRAY_SIZE <= 0)
284 :     ? newCapacity
285 :     : hugeCapacity(minCapacity);
286 :     }
287 :    
288 :     private static int hugeCapacity(int minCapacity) {
289 :     if (minCapacity < 0) // overflow
290 :     throw new OutOfMemoryError();
291 :     return (minCapacity > MAX_ARRAY_SIZE) ?
292 :     Integer.MAX_VALUE :
293 :     MAX_ARRAY_SIZE;
294 : dl 1.1 }
295 :    
296 :     /**
297 :     * Sets the size of this vector. If the new size is greater than the
298 : jsr166 1.14 * current size, new {@code null} items are added to the end of
299 : dl 1.1 * the vector. If the new size is less than the current size, all
300 : jsr166 1.14 * components at index {@code newSize} and greater are discarded.
301 : dl 1.1 *
302 : jsr166 1.16 * @param newSize the new size of this vector
303 :     * @throws ArrayIndexOutOfBoundsException if the new size is negative
304 : dl 1.1 */
305 :     public synchronized void setSize(int newSize) {
306 : jsr166 1.23 modCount++;
307 : jsr166 1.30 if (newSize > elementData.length)
308 :     grow(newSize);
309 :     for (int i = newSize; i < elementCount; i++)
310 :     elementData[i] = null;
311 : jsr166 1.23 elementCount = newSize;
312 : dl 1.1 }
313 :    
314 :     /**
315 :     * Returns the current capacity of this vector.
316 :     *
317 :     * @return the current capacity (the length of its internal
318 : jsr166 1.14 * data array, kept in the field {@code elementData}
319 : dl 1.1 * of this vector)
320 :     */
321 :     public synchronized int capacity() {
322 : jsr166 1.23 return elementData.length;
323 : dl 1.1 }
324 :    
325 :     /**
326 :     * Returns the number of components in this vector.
327 :     *
328 :     * @return the number of components in this vector
329 :     */
330 :     public synchronized int size() {
331 : jsr166 1.23 return elementCount;
332 : dl 1.1 }
333 :    
334 :     /**
335 :     * Tests if this vector has no components.
336 :     *
337 : jsr166 1.14 * @return {@code true} if and only if this vector has
338 : dl 1.1 * no components, that is, its size is zero;
339 : jsr166 1.14 * {@code false} otherwise.
340 : dl 1.1 */
341 :     public synchronized boolean isEmpty() {
342 : jsr166 1.23 return elementCount == 0;
343 : dl 1.1 }
344 :    
345 :     /**
346 :     * Returns an enumeration of the components of this vector. The
347 : jsr166 1.14 * returned {@code Enumeration} object will generate all items in
348 :     * this vector. The first item generated is the item at index {@code 0},
349 : jsr166 1.30 * then the item at index {@code 1}, and so on. If the vector is
350 :     * structurally modified while enumerating over the elements then the
351 :     * results of enumerating are undefined.
352 : dl 1.1 *
353 :     * @return an enumeration of the components of this vector
354 :     * @see Iterator
355 :     */
356 :     public Enumeration<E> elements() {
357 : jsr166 1.23 return new Enumeration<E>() {
358 :     int count = 0;
359 : dl 1.1
360 : jsr166 1.23 public boolean hasMoreElements() {
361 :     return count < elementCount;
362 :     }
363 :    
364 :     public E nextElement() {
365 :     synchronized (Vector.this) {
366 :     if (count < elementCount) {
367 :     return elementData(count++);
368 :     }
369 :     }
370 :     throw new NoSuchElementException("Vector Enumeration");
371 :     }
372 :     };
373 : dl 1.1 }
374 :    
375 :     /**
376 : jsr166 1.14 * Returns {@code true} if this vector contains the specified element.
377 :     * More formally, returns {@code true} if and only if this vector
378 :     * contains at least one element {@code e} such that
379 : jsr166 1.30 * {@code Objects.equals(o, e)}.
380 : dl 1.1 *
381 :     * @param o element whose presence in this vector is to be tested
382 : jsr166 1.14 * @return {@code true} if this vector contains the specified element
383 : dl 1.1 */
384 :     public boolean contains(Object o) {
385 : jsr166 1.23 return indexOf(o, 0) >= 0;
386 : dl 1.1 }
387 :    
388 :     /**
389 :     * Returns the index of the first occurrence of the specified element
390 :     * in this vector, or -1 if this vector does not contain the element.
391 : jsr166 1.14 * More formally, returns the lowest index {@code i} such that
392 : jsr166 1.30 * {@code Objects.equals(o, get(i))},
393 : dl 1.1 * or -1 if there is no such index.
394 :     *
395 :     * @param o element to search for
396 :     * @return the index of the first occurrence of the specified element in
397 :     * this vector, or -1 if this vector does not contain the element
398 :     */
399 :     public int indexOf(Object o) {
400 : jsr166 1.23 return indexOf(o, 0);
401 : dl 1.1 }
402 :    
403 :     /**
404 :     * Returns the index of the first occurrence of the specified element in
405 : jsr166 1.14 * this vector, searching forwards from {@code index}, or returns -1 if
406 : dl 1.1 * the element is not found.
407 : jsr166 1.14 * More formally, returns the lowest index {@code i} such that
408 : jsr166 1.30 * {@code (i >= index && Objects.equals(o, get(i)))},
409 : dl 1.1 * or -1 if there is no such index.
410 :     *
411 :     * @param o element to search for
412 :     * @param index index to start searching from
413 :     * @return the index of the first occurrence of the element in
414 : jsr166 1.14 * this vector at position {@code index} or later in the vector;
415 :     * {@code -1} if the element is not found.
416 : dl 1.1 * @throws IndexOutOfBoundsException if the specified index is negative
417 :     * @see Object#equals(Object)
418 :     */
419 :     public synchronized int indexOf(Object o, int index) {
420 : jsr166 1.23 if (o == null) {
421 :     for (int i = index ; i < elementCount ; i++)
422 :     if (elementData[i]==null)
423 :     return i;
424 :     } else {
425 :     for (int i = index ; i < elementCount ; i++)
426 :     if (o.equals(elementData[i]))
427 :     return i;
428 :     }
429 :     return -1;
430 : dl 1.1 }
431 :    
432 :     /**
433 :     * Returns the index of the last occurrence of the specified element
434 :     * in this vector, or -1 if this vector does not contain the element.
435 : jsr166 1.14 * More formally, returns the highest index {@code i} such that
436 : jsr166 1.30 * {@code Objects.equals(o, get(i))},
437 : dl 1.1 * or -1 if there is no such index.
438 :     *
439 :     * @param o element to search for
440 :     * @return the index of the last occurrence of the specified element in
441 :     * this vector, or -1 if this vector does not contain the element
442 :     */
443 :     public synchronized int lastIndexOf(Object o) {
444 : jsr166 1.23 return lastIndexOf(o, elementCount-1);
445 : dl 1.1 }
446 :    
447 :     /**
448 :     * Returns the index of the last occurrence of the specified element in
449 : jsr166 1.14 * this vector, searching backwards from {@code index}, or returns -1 if
450 : dl 1.1 * the element is not found.
451 : jsr166 1.14 * More formally, returns the highest index {@code i} such that
452 : jsr166 1.30 * {@code (i <= index && Objects.equals(o, get(i)))},
453 : dl 1.1 * or -1 if there is no such index.
454 :     *
455 :     * @param o element to search for
456 :     * @param index index to start searching backwards from
457 :     * @return the index of the last occurrence of the element at position
458 : jsr166 1.14 * less than or equal to {@code index} in this vector;
459 : dl 1.1 * -1 if the element is not found.
460 :     * @throws IndexOutOfBoundsException if the specified index is greater
461 :     * than or equal to the current size of this vector
462 :     */
463 :     public synchronized int lastIndexOf(Object o, int index) {
464 :     if (index >= elementCount)
465 :     throw new IndexOutOfBoundsException(index + " >= "+ elementCount);
466 :    
467 : jsr166 1.23 if (o == null) {
468 :     for (int i = index; i >= 0; i--)
469 :     if (elementData[i]==null)
470 :     return i;
471 :     } else {
472 :     for (int i = index; i >= 0; i--)
473 :     if (o.equals(elementData[i]))
474 :     return i;
475 :     }
476 :     return -1;
477 : dl 1.1 }
478 :    
479 :     /**
480 : jsr166 1.15 * Returns the component at the specified index.
481 : dl 1.1 *
482 : jsr166 1.15 * <p>This method is identical in functionality to the {@link #get(int)}
483 :     * method (which is part of the {@link List} interface).
484 : dl 1.1 *
485 :     * @param index an index into this vector
486 :     * @return the component at the specified index
487 : jsr166 1.15 * @throws ArrayIndexOutOfBoundsException if the index is out of range
488 : jsr166 1.23 * ({@code index < 0 || index >= size()})
489 : dl 1.1 */
490 :     public synchronized E elementAt(int index) {
491 : jsr166 1.23 if (index >= elementCount) {
492 :     throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount);
493 :     }
494 : dl 1.1
495 : jsr166 1.22 return elementData(index);
496 : dl 1.1 }
497 :    
498 :     /**
499 : jsr166 1.14 * Returns the first component (the item at index {@code 0}) of
500 : dl 1.1 * this vector.
501 :     *
502 :     * @return the first component of this vector
503 : jsr166 1.15 * @throws NoSuchElementException if this vector has no components
504 : dl 1.1 */
505 :     public synchronized E firstElement() {
506 : jsr166 1.23 if (elementCount == 0) {
507 :     throw new NoSuchElementException();
508 :     }
509 :     return elementData(0);
510 : dl 1.1 }
511 :    
512 :     /**
513 :     * Returns the last component of the vector.
514 :     *
515 :     * @return the last component of the vector, i.e., the component at index
516 :     * <code>size()&nbsp;-&nbsp;1</code>.
517 : jsr166 1.15 * @throws NoSuchElementException if this vector is empty
518 : dl 1.1 */
519 :     public synchronized E lastElement() {
520 : jsr166 1.23 if (elementCount == 0) {
521 :     throw new NoSuchElementException();
522 :     }
523 :     return elementData(elementCount - 1);
524 : dl 1.1 }
525 :    
526 :     /**
527 : jsr166 1.14 * Sets the component at the specified {@code index} of this
528 : dl 1.1 * vector to be the specified object. The previous component at that
529 : jsr166 1.16 * position is discarded.
530 : dl 1.1 *
531 : jsr166 1.16 * <p>The index must be a value greater than or equal to {@code 0}
532 :     * and less than the current size of the vector.
533 : dl 1.1 *
534 : jsr166 1.17 * <p>This method is identical in functionality to the
535 :     * {@link #set(int, Object) set(int, E)}
536 :     * method (which is part of the {@link List} interface). Note that the
537 :     * {@code set} method reverses the order of the parameters, to more closely
538 :     * match array usage. Note also that the {@code set} method returns the
539 :     * old value that was stored at the specified position.
540 : dl 1.1 *
541 :     * @param obj what the component is to be set to
542 :     * @param index the specified index
543 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
544 : jsr166 1.23 * ({@code index < 0 || index >= size()})
545 : dl 1.1 */
546 :     public synchronized void setElementAt(E obj, int index) {
547 : jsr166 1.23 if (index >= elementCount) {
548 :     throw new ArrayIndexOutOfBoundsException(index + " >= " +
549 :     elementCount);
550 :     }
551 :     elementData[index] = obj;
552 : dl 1.1 }
553 :    
554 :     /**
555 :     * Deletes the component at the specified index. Each component in
556 :     * this vector with an index greater or equal to the specified
557 : jsr166 1.14 * {@code index} is shifted downward to have an index one
558 : dl 1.1 * smaller than the value it had previously. The size of this vector
559 : jsr166 1.15 * is decreased by {@code 1}.
560 : dl 1.1 *
561 : jsr166 1.15 * <p>The index must be a value greater than or equal to {@code 0}
562 :     * and less than the current size of the vector.
563 : dl 1.1 *
564 : jsr166 1.17 * <p>This method is identical in functionality to the {@link #remove(int)}
565 :     * method (which is part of the {@link List} interface). Note that the
566 :     * {@code remove} method returns the old value that was stored at the
567 :     * specified position.
568 : dl 1.1 *
569 :     * @param index the index of the object to remove
570 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
571 : jsr166 1.23 * ({@code index < 0 || index >= size()})
572 : dl 1.1 */
573 :     public synchronized void removeElementAt(int index) {
574 : jsr166 1.23 if (index >= elementCount) {
575 :     throw new ArrayIndexOutOfBoundsException(index + " >= " +
576 :     elementCount);
577 :     }
578 :     else if (index < 0) {
579 :     throw new ArrayIndexOutOfBoundsException(index);
580 :     }
581 :     int j = elementCount - index - 1;
582 :     if (j > 0) {
583 :     System.arraycopy(elementData, index + 1, elementData, index, j);
584 :     }
585 : jsr166 1.30 modCount++;
586 : jsr166 1.23 elementCount--;
587 :     elementData[elementCount] = null; /* to let gc do its work */
588 : dl 1.1 }
589 :    
590 :     /**
591 :     * Inserts the specified object as a component in this vector at the
592 : jsr166 1.14 * specified {@code index}. Each component in this vector with
593 :     * an index greater or equal to the specified {@code index} is
594 : dl 1.1 * shifted upward to have an index one greater than the value it had
595 : jsr166 1.15 * previously.
596 : dl 1.1 *
597 : jsr166 1.15 * <p>The index must be a value greater than or equal to {@code 0}
598 : dl 1.1 * and less than or equal to the current size of the vector. (If the
599 :     * index is equal to the current size of the vector, the new element
600 : jsr166 1.15 * is appended to the Vector.)
601 : dl 1.1 *
602 : jsr166 1.17 * <p>This method is identical in functionality to the
603 :     * {@link #add(int, Object) add(int, E)}
604 :     * method (which is part of the {@link List} interface). Note that the
605 :     * {@code add} method reverses the order of the parameters, to more closely
606 :     * match array usage.
607 : dl 1.1 *
608 :     * @param obj the component to insert
609 :     * @param index where to insert the new component
610 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
611 : jsr166 1.23 * ({@code index < 0 || index > size()})
612 : dl 1.1 */
613 :     public synchronized void insertElementAt(E obj, int index) {
614 : jsr166 1.23 if (index > elementCount) {
615 :     throw new ArrayIndexOutOfBoundsException(index
616 :     + " > " + elementCount);
617 :     }
618 : jsr166 1.30 modCount++;
619 :     final int s = elementCount;
620 :     Object[] elementData = this.elementData;
621 :     if (s == elementData.length)
622 :     elementData = grow();
623 :     System.arraycopy(elementData, index,
624 :     elementData, index + 1,
625 :     s - index);
626 : jsr166 1.23 elementData[index] = obj;
627 : jsr166 1.30 elementCount = s + 1;
628 : dl 1.1 }
629 :    
630 :     /**
631 :     * Adds the specified component to the end of this vector,
632 :     * increasing its size by one. The capacity of this vector is
633 : jsr166 1.16 * increased if its size becomes greater than its capacity.
634 : dl 1.1 *
635 : jsr166 1.17 * <p>This method is identical in functionality to the
636 : jsr166 1.18 * {@link #add(Object) add(E)}
637 :     * method (which is part of the {@link List} interface).
638 : dl 1.1 *
639 :     * @param obj the component to be added
640 :     */
641 :     public synchronized void addElement(E obj) {
642 : jsr166 1.23 modCount++;
643 : jsr166 1.30 add(obj, elementData, elementCount);
644 : dl 1.1 }
645 :    
646 :     /**
647 :     * Removes the first (lowest-indexed) occurrence of the argument
648 :     * from this vector. If the object is found in this vector, each
649 :     * component in the vector with an index greater or equal to the
650 :     * object's index is shifted downward to have an index one smaller
651 : jsr166 1.16 * than the value it had previously.
652 : dl 1.1 *
653 : jsr166 1.18 * <p>This method is identical in functionality to the
654 :     * {@link #remove(Object)} method (which is part of the
655 :     * {@link List} interface).
656 : dl 1.1 *
657 :     * @param obj the component to be removed
658 : jsr166 1.14 * @return {@code true} if the argument was a component of this
659 :     * vector; {@code false} otherwise.
660 : dl 1.1 */
661 :     public synchronized boolean removeElement(Object obj) {
662 : jsr166 1.23 modCount++;
663 :     int i = indexOf(obj);
664 :     if (i >= 0) {
665 :     removeElementAt(i);
666 :     return true;
667 :     }
668 :     return false;
669 : dl 1.1 }
670 :    
671 :     /**
672 : jsr166 1.17 * Removes all components from this vector and sets its size to zero.
673 : dl 1.1 *
674 : jsr166 1.17 * <p>This method is identical in functionality to the {@link #clear}
675 :     * method (which is part of the {@link List} interface).
676 : dl 1.1 */
677 :     public synchronized void removeAllElements() {
678 : jsr166 1.23 // Let gc do its work
679 :     for (int i = 0; i < elementCount; i++)
680 :     elementData[i] = null;
681 : dl 1.1
682 : jsr166 1.30 modCount++;
683 : jsr166 1.23 elementCount = 0;
684 : dl 1.1 }
685 :    
686 :     /**
687 :     * Returns a clone of this vector. The copy will contain a
688 :     * reference to a clone of the internal data array, not a reference
689 : jsr166 1.14 * to the original internal data array of this {@code Vector} object.
690 : dl 1.1 *
691 :     * @return a clone of this vector
692 :     */
693 :     public synchronized Object clone() {
694 : jsr166 1.23 try {
695 :     @SuppressWarnings("unchecked")
696 :     Vector<E> v = (Vector<E>) super.clone();
697 :     v.elementData = Arrays.copyOf(elementData, elementCount);
698 :     v.modCount = 0;
699 :     return v;
700 :     } catch (CloneNotSupportedException e) {
701 :     // this shouldn't happen, since we are Cloneable
702 : jsr166 1.30 throw new InternalError(e);
703 : jsr166 1.23 }
704 : dl 1.1 }
705 :    
706 :     /**
707 :     * Returns an array containing all of the elements in this Vector
708 :     * in the correct order.
709 :     *
710 :     * @since 1.2
711 :     */
712 :     public synchronized Object[] toArray() {
713 :     return Arrays.copyOf(elementData, elementCount);
714 :     }
715 :    
716 :     /**
717 :     * Returns an array containing all of the elements in this Vector in the
718 :     * correct order; the runtime type of the returned array is that of the
719 :     * specified array. If the Vector fits in the specified array, it is
720 :     * returned therein. Otherwise, a new array is allocated with the runtime
721 : jsr166 1.16 * type of the specified array and the size of this Vector.
722 : dl 1.1 *
723 : jsr166 1.16 * <p>If the Vector fits in the specified array with room to spare
724 : dl 1.1 * (i.e., the array has more elements than the Vector),
725 :     * the element in the array immediately following the end of the
726 :     * Vector is set to null. (This is useful in determining the length
727 :     * of the Vector <em>only</em> if the caller knows that the Vector
728 :     * does not contain any null elements.)
729 :     *
730 : jsr166 1.30 * @param <T> type of array elements. The same type as {@code <E>} or a
731 :     * supertype of {@code <E>}.
732 : dl 1.1 * @param a the array into which the elements of the Vector are to
733 : jsr166 1.23 * be stored, if it is big enough; otherwise, a new array of the
734 :     * same runtime type is allocated for this purpose.
735 : dl 1.1 * @return an array containing the elements of the Vector
736 : jsr166 1.30 * @throws ArrayStoreException if the runtime type of a, {@code <T>}, is not
737 :     * a supertype of the runtime type, {@code <E>}, of every element in this
738 :     * Vector
739 : dl 1.1 * @throws NullPointerException if the given array is null
740 :     * @since 1.2
741 :     */
742 : jsr166 1.22 @SuppressWarnings("unchecked")
743 : dl 1.1 public synchronized <T> T[] toArray(T[] a) {
744 :     if (a.length < elementCount)
745 :     return (T[]) Arrays.copyOf(elementData, elementCount, a.getClass());
746 :    
747 : jsr166 1.23 System.arraycopy(elementData, 0, a, 0, elementCount);
748 : dl 1.1
749 :     if (a.length > elementCount)
750 :     a[elementCount] = null;
751 :    
752 :     return a;
753 :     }
754 :    
755 :     // Positional Access Operations
756 :    
757 : jsr166 1.22 @SuppressWarnings("unchecked")
758 :     E elementData(int index) {
759 : jsr166 1.23 return (E) elementData[index];
760 : jsr166 1.22 }
761 :    
762 : dl 1.1 /**
763 :     * Returns the element at the specified position in this Vector.
764 :     *
765 :     * @param index index of the element to return
766 :     * @return object at the specified index
767 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
768 :     * ({@code index < 0 || index >= size()})
769 : dl 1.1 * @since 1.2
770 :     */
771 :     public synchronized E get(int index) {
772 : jsr166 1.23 if (index >= elementCount)
773 :     throw new ArrayIndexOutOfBoundsException(index);
774 : dl 1.1
775 : jsr166 1.23 return elementData(index);
776 : dl 1.1 }
777 :    
778 :     /**
779 :     * Replaces the element at the specified position in this Vector with the
780 :     * specified element.
781 :     *
782 :     * @param index index of the element to replace
783 :     * @param element element to be stored at the specified position
784 :     * @return the element previously at the specified position
785 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
786 : jsr166 1.23 * ({@code index < 0 || index >= size()})
787 : dl 1.1 * @since 1.2
788 :     */
789 :     public synchronized E set(int index, E element) {
790 : jsr166 1.23 if (index >= elementCount)
791 :     throw new ArrayIndexOutOfBoundsException(index);
792 : dl 1.1
793 : jsr166 1.23 E oldValue = elementData(index);
794 :     elementData[index] = element;
795 :     return oldValue;
796 : dl 1.1 }
797 :    
798 :     /**
799 : jsr166 1.30 * This helper method split out from add(E) to keep method
800 :     * bytecode size under 35 (the -XX:MaxInlineSize default value),
801 :     * which helps when add(E) is called in a C1-compiled loop.
802 :     */
803 :     private void add(E e, Object[] elementData, int s) {
804 :     if (s == elementData.length)
805 :     elementData = grow();
806 :     elementData[s] = e;
807 :     elementCount = s + 1;
808 :     }
809 :    
810 :     /**
811 : dl 1.1 * Appends the specified element to the end of this Vector.
812 :     *
813 :     * @param e element to be appended to this Vector
814 : jsr166 1.14 * @return {@code true} (as specified by {@link Collection#add})
815 : dl 1.1 * @since 1.2
816 :     */
817 :     public synchronized boolean add(E e) {
818 : jsr166 1.23 modCount++;
819 : jsr166 1.30 add(e, elementData, elementCount);
820 : dl 1.1 return true;
821 :     }
822 :    
823 :     /**
824 :     * Removes the first occurrence of the specified element in this Vector
825 :     * If the Vector does not contain the element, it is unchanged. More
826 :     * formally, removes the element with the lowest index i such that
827 : jsr166 1.30 * {@code Objects.equals(o, get(i))} (if such
828 : dl 1.1 * an element exists).
829 :     *
830 :     * @param o element to be removed from this Vector, if present
831 :     * @return true if the Vector contained the specified element
832 :     * @since 1.2
833 :     */
834 :     public boolean remove(Object o) {
835 :     return removeElement(o);
836 :     }
837 :    
838 :     /**
839 :     * Inserts the specified element at the specified position in this Vector.
840 :     * Shifts the element currently at that position (if any) and any
841 :     * subsequent elements to the right (adds one to their indices).
842 :     *
843 :     * @param index index at which the specified element is to be inserted
844 :     * @param element element to be inserted
845 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
846 :     * ({@code index < 0 || index > size()})
847 : dl 1.1 * @since 1.2
848 :     */
849 :     public void add(int index, E element) {
850 :     insertElementAt(element, index);
851 :     }
852 :    
853 :     /**
854 :     * Removes the element at the specified position in this Vector.
855 :     * Shifts any subsequent elements to the left (subtracts one from their
856 :     * indices). Returns the element that was removed from the Vector.
857 :     *
858 : jsr166 1.18 * @throws ArrayIndexOutOfBoundsException if the index is out of range
859 :     * ({@code index < 0 || index >= size()})
860 : dl 1.1 * @param index the index of the element to be removed
861 :     * @return element that was removed
862 :     * @since 1.2
863 :     */
864 :     public synchronized E remove(int index) {
865 : jsr166 1.23 modCount++;
866 :     if (index >= elementCount)
867 :     throw new ArrayIndexOutOfBoundsException(index);
868 :     E oldValue = elementData(index);
869 :    
870 :     int numMoved = elementCount - index - 1;
871 :     if (numMoved > 0)
872 :     System.arraycopy(elementData, index+1, elementData, index,
873 :     numMoved);
874 :     elementData[--elementCount] = null; // Let gc do its work
875 : dl 1.1
876 : jsr166 1.23 return oldValue;
877 : dl 1.1 }
878 :    
879 :     /**
880 :     * Removes all of the elements from this Vector. The Vector will
881 :     * be empty after this call returns (unless it throws an exception).
882 :     *
883 :     * @since 1.2
884 :     */
885 :     public void clear() {
886 :     removeAllElements();
887 :     }
888 :    
889 :     // Bulk Operations
890 :    
891 :     /**
892 :     * Returns true if this Vector contains all of the elements in the
893 :     * specified Collection.
894 :     *
895 :     * @param c a collection whose elements will be tested for containment
896 :     * in this Vector
897 :     * @return true if this Vector contains all of the elements in the
898 : jsr166 1.23 * specified collection
899 : dl 1.1 * @throws NullPointerException if the specified collection is null
900 :     */
901 :     public synchronized boolean containsAll(Collection<?> c) {
902 :     return super.containsAll(c);
903 :     }
904 :    
905 :     /**
906 :     * Appends all of the elements in the specified Collection to the end of
907 :     * this Vector, in the order that they are returned by the specified
908 :     * Collection's Iterator. The behavior of this operation is undefined if
909 :     * the specified Collection is modified while the operation is in progress.
910 :     * (This implies that the behavior of this call is undefined if the
911 :     * specified Collection is this Vector, and this Vector is nonempty.)
912 :     *
913 :     * @param c elements to be inserted into this Vector
914 : jsr166 1.14 * @return {@code true} if this Vector changed as a result of the call
915 : dl 1.1 * @throws NullPointerException if the specified collection is null
916 :     * @since 1.2
917 :     */
918 : jsr166 1.30 public boolean addAll(Collection<? extends E> c) {
919 :     Object[] a = c.toArray();
920 : jsr166 1.23 modCount++;
921 : dl 1.1 int numNew = a.length;
922 : jsr166 1.30 if (numNew == 0)
923 :     return false;
924 :     synchronized (this) {
925 :     Object[] elementData = this.elementData;
926 :     final int s = elementCount;
927 :     if (numNew > elementData.length - s)
928 :     elementData = grow(s + numNew);
929 :     System.arraycopy(a, 0, elementData, s, numNew);
930 :     elementCount = s + numNew;
931 :     return true;
932 :     }
933 : dl 1.1 }
934 :    
935 :     /**
936 :     * Removes from this Vector all of its elements that are contained in the
937 :     * specified Collection.
938 :     *
939 :     * @param c a collection of elements to be removed from the Vector
940 :     * @return true if this Vector changed as a result of the call
941 :     * @throws ClassCastException if the types of one or more elements
942 :     * in this vector are incompatible with the specified
943 : jsr166 1.30 * collection
944 :     * (<a href="Collection.html#optional-restrictions">optional</a>)
945 : dl 1.1 * @throws NullPointerException if this vector contains one or more null
946 :     * elements and the specified collection does not support null
947 : jsr166 1.30 * elements
948 :     * (<a href="Collection.html#optional-restrictions">optional</a>),
949 :     * or if the specified collection is null
950 : dl 1.1 * @since 1.2
951 :     */
952 :     public synchronized boolean removeAll(Collection<?> c) {
953 :     return super.removeAll(c);
954 :     }
955 :    
956 :     /**
957 :     * Retains only the elements in this Vector that are contained in the
958 :     * specified Collection. In other words, removes from this Vector all
959 :     * of its elements that are not contained in the specified Collection.
960 :     *
961 :     * @param c a collection of elements to be retained in this Vector
962 :     * (all other elements are removed)
963 :     * @return true if this Vector changed as a result of the call
964 :     * @throws ClassCastException if the types of one or more elements
965 :     * in this vector are incompatible with the specified
966 : jsr166 1.30 * collection
967 :     * (<a href="Collection.html#optional-restrictions">optional</a>)
968 : dl 1.1 * @throws NullPointerException if this vector contains one or more null
969 :     * elements and the specified collection does not support null
970 : jsr166 1.30 * elements
971 :     * (<a href="Collection.html#optional-restrictions">optional</a>),
972 :     * or if the specified collection is null
973 : dl 1.1 * @since 1.2
974 :     */
975 : jsr166 1.28 public synchronized boolean retainAll(Collection<?> c) {
976 : dl 1.1 return super.retainAll(c);
977 :     }
978 :    
979 :     /**
980 :     * Inserts all of the elements in the specified Collection into this
981 :     * Vector at the specified position. Shifts the element currently at
982 :     * that position (if any) and any subsequent elements to the right
983 :     * (increases their indices). The new elements will appear in the Vector
984 :     * in the order that they are returned by the specified Collection's
985 :     * iterator.
986 :     *
987 :     * @param index index at which to insert the first element from the
988 :     * specified collection
989 :     * @param c elements to be inserted into this Vector
990 : jsr166 1.14 * @return {@code true} if this Vector changed as a result of the call
991 : jsr166 1.18 * @throws ArrayIndexOutOfBoundsException if the index is out of range
992 :     * ({@code index < 0 || index > size()})
993 : dl 1.1 * @throws NullPointerException if the specified collection is null
994 :     * @since 1.2
995 :     */
996 :     public synchronized boolean addAll(int index, Collection<? extends E> c) {
997 : jsr166 1.23 if (index < 0 || index > elementCount)
998 :     throw new ArrayIndexOutOfBoundsException(index);
999 : dl 1.1
1000 :     Object[] a = c.toArray();
1001 : jsr166 1.30 modCount++;
1002 : jsr166 1.23 int numNew = a.length;
1003 : jsr166 1.30 if (numNew == 0)
1004 :     return false;
1005 :     Object[] elementData = this.elementData;
1006 :     final int s = elementCount;
1007 :     if (numNew > elementData.length - s)
1008 :     elementData = grow(s + numNew);
1009 : dl 1.1
1010 : jsr166 1.30 int numMoved = s - index;
1011 : jsr166 1.23 if (numMoved > 0)
1012 : jsr166 1.30 System.arraycopy(elementData, index,
1013 :     elementData, index + numNew,
1014 : jsr166 1.23 numMoved);
1015 : dl 1.1 System.arraycopy(a, 0, elementData, index, numNew);
1016 : jsr166 1.30 elementCount = s + numNew;
1017 :     return true;
1018 : dl 1.1 }
1019 :    
1020 :     /**
1021 :     * Compares the specified Object with this Vector for equality. Returns
1022 :     * true if and only if the specified Object is also a List, both Lists
1023 :     * have the same size, and all corresponding pairs of elements in the two
1024 : jsr166 1.14 * Lists are <em>equal</em>. (Two elements {@code e1} and
1025 : jsr166 1.30 * {@code e2} are <em>equal</em> if {@code Objects.equals(e1, e2)}.)
1026 :     * In other words, two Lists are defined to be
1027 : dl 1.1 * equal if they contain the same elements in the same order.
1028 :     *
1029 :     * @param o the Object to be compared for equality with this Vector
1030 :     * @return true if the specified Object is equal to this Vector
1031 :     */
1032 :     public synchronized boolean equals(Object o) {
1033 :     return super.equals(o);
1034 :     }
1035 :    
1036 :     /**
1037 :     * Returns the hash code value for this Vector.
1038 :     */
1039 :     public synchronized int hashCode() {
1040 :     return super.hashCode();
1041 :     }
1042 :    
1043 :     /**
1044 :     * Returns a string representation of this Vector, containing
1045 :     * the String representation of each element.
1046 :     */
1047 :     public synchronized String toString() {
1048 :     return super.toString();
1049 :     }
1050 :    
1051 :     /**
1052 : jsr166 1.22 * Returns a view of the portion of this List between fromIndex,
1053 :     * inclusive, and toIndex, exclusive. (If fromIndex and toIndex are
1054 :     * equal, the returned List is empty.) The returned List is backed by this
1055 :     * List, so changes in the returned List are reflected in this List, and
1056 :     * vice-versa. The returned List supports all of the optional List
1057 :     * operations supported by this List.
1058 : dl 1.1 *
1059 : jsr166 1.22 * <p>This method eliminates the need for explicit range operations (of
1060 :     * the sort that commonly exist for arrays). Any operation that expects
1061 :     * a List can be used as a range operation by operating on a subList view
1062 :     * instead of a whole List. For example, the following idiom
1063 :     * removes a range of elements from a List:
1064 :     * <pre>
1065 : jsr166 1.23 * list.subList(from, to).clear();
1066 : jsr166 1.22 * </pre>
1067 :     * Similar idioms may be constructed for indexOf and lastIndexOf,
1068 :     * and all of the algorithms in the Collections class can be applied to
1069 :     * a subList.
1070 :     *
1071 :     * <p>The semantics of the List returned by this method become undefined if
1072 :     * the backing list (i.e., this List) is <i>structurally modified</i> in
1073 :     * any way other than via the returned List. (Structural modifications are
1074 :     * those that change the size of the List, or otherwise perturb it in such
1075 :     * a fashion that iterations in progress may yield incorrect results.)
1076 :     *
1077 :     * @param fromIndex low endpoint (inclusive) of the subList
1078 :     * @param toIndex high endpoint (exclusive) of the subList
1079 :     * @return a view of the specified range within this List
1080 :     * @throws IndexOutOfBoundsException if an endpoint index value is out of range
1081 :     * {@code (fromIndex < 0 || toIndex > size)}
1082 :     * @throws IllegalArgumentException if the endpoint indices are out of order
1083 : jsr166 1.23 * {@code (fromIndex > toIndex)}
1084 : jsr166 1.22 */
1085 :     public synchronized List<E> subList(int fromIndex, int toIndex) {
1086 :     return Collections.synchronizedList(super.subList(fromIndex, toIndex),
1087 :     this);
1088 :     }
1089 :    
1090 :     /**
1091 :     * Removes from this list all of the elements whose index is between
1092 :     * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
1093 :     * Shifts any succeeding elements to the left (reduces their index).
1094 :     * This call shortens the list by {@code (toIndex - fromIndex)} elements.
1095 :     * (If {@code toIndex==fromIndex}, this operation has no effect.)
1096 : dl 1.1 */
1097 :     protected synchronized void removeRange(int fromIndex, int toIndex) {
1098 : jsr166 1.23 int numMoved = elementCount - toIndex;
1099 : dl 1.1 System.arraycopy(elementData, toIndex, elementData, fromIndex,
1100 :     numMoved);
1101 :    
1102 : jsr166 1.23 // Let gc do its work
1103 : jsr166 1.30 modCount++;
1104 : jsr166 1.23 int newElementCount = elementCount - (toIndex-fromIndex);
1105 :     while (elementCount != newElementCount)
1106 :     elementData[--elementCount] = null;
1107 : dl 1.1 }
1108 :    
1109 :     /**
1110 : jsr166 1.14 * Save the state of the {@code Vector} instance to a stream (that
1111 : jsr166 1.30 * is, serialize it).
1112 :     * This method performs synchronization to ensure the consistency
1113 :     * of the serialized data.
1114 :     */
1115 :     private void writeObject(java.io.ObjectOutputStream s)
1116 :     throws java.io.IOException {
1117 :     final java.io.ObjectOutputStream.PutField fields = s.putFields();
1118 :     final Object[] data;
1119 :     synchronized (this) {
1120 :     fields.put("capacityIncrement", capacityIncrement);
1121 :     fields.put("elementCount", elementCount);
1122 :     data = elementData.clone();
1123 :     }
1124 :     fields.put("elementData", data);
1125 :     s.writeFields();
1126 : dl 1.1 }
1127 :    
1128 :     /**
1129 : jsr166 1.22 * Returns a list iterator over the elements in this list (in proper
1130 : dl 1.1 * sequence), starting at the specified position in the list.
1131 : jsr166 1.22 * The specified index indicates the first element that would be
1132 :     * returned by an initial call to {@link ListIterator#next next}.
1133 :     * An initial call to {@link ListIterator#previous previous} would
1134 :     * return the element with the specified index minus one.
1135 :     *
1136 :     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1137 : dl 1.1 *
1138 :     * @throws IndexOutOfBoundsException {@inheritDoc}
1139 :     */
1140 :     public synchronized ListIterator<E> listIterator(int index) {
1141 : jsr166 1.23 if (index < 0 || index > elementCount)
1142 : dl 1.1 throw new IndexOutOfBoundsException("Index: "+index);
1143 : jsr166 1.23 return new ListItr(index);
1144 : dl 1.1 }
1145 : jsr166 1.2
1146 : dl 1.1 /**
1147 : jsr166 1.22 * Returns a list iterator over the elements in this list (in proper
1148 :     * sequence).
1149 :     *
1150 :     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1151 :     *
1152 :     * @see #listIterator(int)
1153 : dl 1.3 */
1154 :     public synchronized ListIterator<E> listIterator() {
1155 : jsr166 1.23 return new ListItr(0);
1156 : dl 1.3 }
1157 :    
1158 :     /**
1159 : dl 1.1 * Returns an iterator over the elements in this list in proper sequence.
1160 :     *
1161 : jsr166 1.22 * <p>The returned iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1162 :     *
1163 : dl 1.1 * @return an iterator over the elements in this list in proper sequence
1164 :     */
1165 :     public synchronized Iterator<E> iterator() {
1166 : jsr166 1.23 return new Itr();
1167 : dl 1.1 }
1168 :    
1169 :     /**
1170 : jsr166 1.22 * An optimized version of AbstractList.Itr
1171 : dl 1.10 */
1172 : jsr166 1.22 private class Itr implements Iterator<E> {
1173 : jsr166 1.23 int cursor; // index of next element to return
1174 :     int lastRet = -1; // index of last element returned; -1 if no such
1175 :     int expectedModCount = modCount;
1176 : jsr166 1.22
1177 : jsr166 1.23 public boolean hasNext() {
1178 : jsr166 1.22 // Racy but within spec, since modifications are checked
1179 :     // within or after synchronization in next/previous
1180 :     return cursor != elementCount;
1181 : jsr166 1.23 }
1182 :    
1183 :     public E next() {
1184 :     synchronized (Vector.this) {
1185 :     checkForComodification();
1186 :     int i = cursor;
1187 :     if (i >= elementCount)
1188 :     throw new NoSuchElementException();
1189 :     cursor = i + 1;
1190 :     return elementData(lastRet = i);
1191 :     }
1192 :     }
1193 : jsr166 1.22
1194 : jsr166 1.23 public void remove() {
1195 :     if (lastRet == -1)
1196 :     throw new IllegalStateException();
1197 :     synchronized (Vector.this) {
1198 :     checkForComodification();
1199 :     Vector.this.remove(lastRet);
1200 :     expectedModCount = modCount;
1201 : dl 1.10 }
1202 : jsr166 1.23 cursor = lastRet;
1203 :     lastRet = -1;
1204 :     }
1205 :    
1206 : jsr166 1.30 @Override
1207 :     public void forEachRemaining(Consumer<? super E> action) {
1208 :     Objects.requireNonNull(action);
1209 :     synchronized (Vector.this) {
1210 :     final int size = elementCount;
1211 :     int i = cursor;
1212 :     if (i >= size) {
1213 :     return;
1214 :     }
1215 :     @SuppressWarnings("unchecked")
1216 :     final E[] elementData = (E[]) Vector.this.elementData;
1217 :     if (i >= elementData.length) {
1218 :     throw new ConcurrentModificationException();
1219 :     }
1220 :     while (i != size && modCount == expectedModCount) {
1221 :     action.accept(elementData[i++]);
1222 :     }
1223 :     // update once at end of iteration to reduce heap write traffic
1224 :     cursor = i;
1225 :     lastRet = i - 1;
1226 :     checkForComodification();
1227 :     }
1228 :     }
1229 :    
1230 : jsr166 1.23 final void checkForComodification() {
1231 :     if (modCount != expectedModCount)
1232 :     throw new ConcurrentModificationException();
1233 :     }
1234 : dl 1.10 }
1235 :    
1236 :     /**
1237 : jsr166 1.22 * An optimized version of AbstractList.ListItr
1238 : dl 1.1 */
1239 : jsr166 1.22 final class ListItr extends Itr implements ListIterator<E> {
1240 : jsr166 1.23 ListItr(int index) {
1241 :     super();
1242 :     cursor = index;
1243 :     }
1244 :    
1245 :     public boolean hasPrevious() {
1246 :     return cursor != 0;
1247 :     }
1248 :    
1249 :     public int nextIndex() {
1250 :     return cursor;
1251 :     }
1252 :    
1253 :     public int previousIndex() {
1254 :     return cursor - 1;
1255 :     }
1256 :    
1257 :     public E previous() {
1258 :     synchronized (Vector.this) {
1259 :     checkForComodification();
1260 :     int i = cursor - 1;
1261 :     if (i < 0)
1262 :     throw new NoSuchElementException();
1263 :     cursor = i;
1264 :     return elementData(lastRet = i);
1265 :     }
1266 :     }
1267 :    
1268 :     public void set(E e) {
1269 :     if (lastRet == -1)
1270 :     throw new IllegalStateException();
1271 :     synchronized (Vector.this) {
1272 :     checkForComodification();
1273 :     Vector.this.set(lastRet, e);
1274 :     }
1275 :     }
1276 :    
1277 :     public void add(E e) {
1278 :     int i = cursor;
1279 :     synchronized (Vector.this) {
1280 :     checkForComodification();
1281 :     Vector.this.add(i, e);
1282 :     expectedModCount = modCount;
1283 :     }
1284 :     cursor = i + 1;
1285 :     lastRet = -1;
1286 :     }
1287 : dl 1.1 }
1288 : jsr166 1.30
1289 :     @Override
1290 :     public synchronized void forEach(Consumer<? super E> action) {
1291 :     Objects.requireNonNull(action);
1292 :     final int expectedModCount = modCount;
1293 :     @SuppressWarnings("unchecked")
1294 :     final E[] elementData = (E[]) this.elementData;
1295 :     final int elementCount = this.elementCount;
1296 :     for (int i=0; modCount == expectedModCount && i < elementCount; i++) {
1297 :     action.accept(elementData[i]);
1298 :     }
1299 :     if (modCount != expectedModCount) {
1300 :     throw new ConcurrentModificationException();
1301 :     }
1302 :     }
1303 :    
1304 :     @Override
1305 :     @SuppressWarnings("unchecked")
1306 :     public synchronized boolean removeIf(Predicate<? super E> filter) {
1307 :     Objects.requireNonNull(filter);
1308 :     // figure out which elements are to be removed
1309 :     // any exception thrown from the filter predicate at this stage
1310 :     // will leave the collection unmodified
1311 :     int removeCount = 0;
1312 :     final int size = elementCount;
1313 :     final BitSet removeSet = new BitSet(size);
1314 :     final int expectedModCount = modCount;
1315 :     for (int i=0; modCount == expectedModCount && i < size; i++) {
1316 :     @SuppressWarnings("unchecked")
1317 :     final E element = (E) elementData[i];
1318 :     if (filter.test(element)) {
1319 :     removeSet.set(i);
1320 :     removeCount++;
1321 :     }
1322 :     }
1323 :     if (modCount != expectedModCount) {
1324 :     throw new ConcurrentModificationException();
1325 :     }
1326 :    
1327 :     // shift surviving elements left over the spaces left by removed elements
1328 :     final boolean anyToRemove = removeCount > 0;
1329 :     if (anyToRemove) {
1330 :     final int newSize = size - removeCount;
1331 :     for (int i=0, j=0; (i < size) && (j < newSize); i++, j++) {
1332 :     i = removeSet.nextClearBit(i);
1333 :     elementData[j] = elementData[i];
1334 :     }
1335 :     for (int k=newSize; k < size; k++) {
1336 :     elementData[k] = null; // Let gc do its work
1337 :     }
1338 :     elementCount = newSize;
1339 :     if (modCount != expectedModCount) {
1340 :     throw new ConcurrentModificationException();
1341 :     }
1342 :     modCount++;
1343 :     }
1344 :    
1345 :     return anyToRemove;
1346 :     }
1347 :    
1348 :     @Override
1349 :     @SuppressWarnings("unchecked")
1350 :     public synchronized void replaceAll(UnaryOperator<E> operator) {
1351 :     Objects.requireNonNull(operator);
1352 :     final int expectedModCount = modCount;
1353 :     final int size = elementCount;
1354 :     for (int i=0; modCount == expectedModCount && i < size; i++) {
1355 :     elementData[i] = operator.apply((E) elementData[i]);
1356 :     }
1357 :     if (modCount != expectedModCount) {
1358 :     throw new ConcurrentModificationException();
1359 :     }
1360 :     modCount++;
1361 :     }
1362 :    
1363 :     @SuppressWarnings("unchecked")
1364 :     @Override
1365 :     public synchronized void sort(Comparator<? super E> c) {
1366 :     final int expectedModCount = modCount;
1367 :     Arrays.sort((E[]) elementData, 0, elementCount, c);
1368 :     if (modCount != expectedModCount) {
1369 :     throw new ConcurrentModificationException();
1370 :     }
1371 :     modCount++;
1372 :     }
1373 :    
1374 :     /**
1375 :     * Creates a <em><a href="Spliterator.html#binding">late-binding</a></em>
1376 :     * and <em>fail-fast</em> {@link Spliterator} over the elements in this
1377 :     * list.
1378 :     *
1379 :     * <p>The {@code Spliterator} reports {@link Spliterator#SIZED},
1380 :     * {@link Spliterator#SUBSIZED}, and {@link Spliterator#ORDERED}.
1381 :     * Overriding implementations should document the reporting of additional
1382 :     * characteristic values.
1383 :     *
1384 :     * @return a {@code Spliterator} over the elements in this list
1385 :     * @since 1.8
1386 :     */
1387 :     @Override
1388 :     public Spliterator<E> spliterator() {
1389 :     return new VectorSpliterator<>(this, null, 0, -1, 0);
1390 :     }
1391 :    
1392 :     /** Similar to ArrayList Spliterator */
1393 :     static final class VectorSpliterator<E> implements Spliterator<E> {
1394 :     private final Vector<E> list;
1395 :     private Object[] array;
1396 :     private int index; // current index, modified on advance/split
1397 :     private int fence; // -1 until used; then one past last index
1398 :     private int expectedModCount; // initialized when fence set
1399 :    
1400 :     /** Create new spliterator covering the given range */
1401 :     VectorSpliterator(Vector<E> list, Object[] array, int origin, int fence,
1402 :     int expectedModCount) {
1403 :     this.list = list;
1404 :     this.array = array;
1405 :     this.index = origin;
1406 :     this.fence = fence;
1407 :     this.expectedModCount = expectedModCount;
1408 :     }
1409 :    
1410 :     private int getFence() { // initialize on first use
1411 :     int hi;
1412 :     if ((hi = fence) < 0) {
1413 :     synchronized(list) {
1414 :     array = list.elementData;
1415 :     expectedModCount = list.modCount;
1416 :     hi = fence = list.elementCount;
1417 :     }
1418 :     }
1419 :     return hi;
1420 :     }
1421 :    
1422 :     public Spliterator<E> trySplit() {
1423 :     int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1424 :     return (lo >= mid) ? null :
1425 :     new VectorSpliterator<>(list, array, lo, index = mid,
1426 :     expectedModCount);
1427 :     }
1428 :    
1429 :     @SuppressWarnings("unchecked")
1430 :     public boolean tryAdvance(Consumer<? super E> action) {
1431 :     int i;
1432 :     if (action == null)
1433 :     throw new NullPointerException();
1434 :     if (getFence() > (i = index)) {
1435 :     index = i + 1;
1436 :     action.accept((E)array[i]);
1437 :     if (list.modCount != expectedModCount)
1438 :     throw new ConcurrentModificationException();
1439 :     return true;
1440 :     }
1441 :     return false;
1442 :     }
1443 :    
1444 :     @SuppressWarnings("unchecked")
1445 :     public void forEachRemaining(Consumer<? super E> action) {
1446 :     int i, hi; // hoist accesses and checks from loop
1447 :     Vector<E> lst; Object[] a;
1448 :     if (action == null)
1449 :     throw new NullPointerException();
1450 :     if ((lst = list) != null) {
1451 :     if ((hi = fence) < 0) {
1452 :     synchronized(lst) {
1453 :     expectedModCount = lst.modCount;
1454 :     a = array = lst.elementData;
1455 :     hi = fence = lst.elementCount;
1456 :     }
1457 :     }
1458 :     else
1459 :     a = array;
1460 :     if (a != null && (i = index) >= 0 && (index = hi) <= a.length) {
1461 :     while (i < hi)
1462 :     action.accept((E) a[i++]);
1463 :     if (lst.modCount == expectedModCount)
1464 :     return;
1465 :     }
1466 :     }
1467 :     throw new ConcurrentModificationException();
1468 :     }
1469 :    
1470 :     public long estimateSize() {
1471 :     return getFence() - index;
1472 :     }
1473 :    
1474 :     public int characteristics() {
1475 :     return Spliterator.ORDERED | Spliterator.SIZED | Spliterator.SUBSIZED;
1476 :     }
1477 :     }
1478 : dl 1.1 }

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8