[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.22 - (view) (download)

1 : dl 1.1 /*
2 : jsr166 1.22 * Copyright 1994-2007 Sun Microsystems, Inc. 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 :     * published by the Free Software Foundation. Sun designates this
8 :     * particular file as subject to the "Classpath" exception as provided
9 :     * by Sun in the LICENSE file that accompanied this code.
10 :     *
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 :     * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
22 :     * CA 95054 USA or visit www.sun.com if you need additional information or
23 :     * have any questions.
24 : dl 1.1 */
25 :    
26 :     package java.util;
27 :    
28 :     /**
29 : jsr166 1.14 * The {@code Vector} class implements a growable array of
30 : dl 1.1 * objects. Like an array, it contains components that can be
31 :     * accessed using an integer index. However, the size of a
32 : jsr166 1.14 * {@code Vector} can grow or shrink as needed to accommodate
33 :     * adding and removing items after the {@code Vector} has been created.
34 : dl 1.1 *
35 : jsr166 1.9 * <p>Each vector tries to optimize storage management by maintaining a
36 : jsr166 1.14 * {@code capacity} and a {@code capacityIncrement}. The
37 :     * {@code capacity} is always at least as large as the vector
38 : dl 1.1 * size; it is usually larger because as components are added to the
39 :     * vector, the vector's storage increases in chunks the size of
40 : jsr166 1.14 * {@code capacityIncrement}. An application can increase the
41 : dl 1.1 * capacity of a vector before inserting a large number of
42 : jsr166 1.9 * components; this reduces the amount of incremental reallocation.
43 : dl 1.1 *
44 : jsr166 1.22 * <p><a name="fail-fast"/>
45 :     * The iterators returned by this class's {@link #iterator() iterator} and
46 :     * {@link #listIterator(int) listIterator} methods are <em>fail-fast</em>:
47 :     * if the vector is structurally modified at any time after the iterator is
48 :     * created, in any way except through the iterator's own
49 :     * {@link ListIterator#remove() remove} or
50 :     * {@link ListIterator#add(Object) add} methods, the iterator will throw a
51 :     * {@link ConcurrentModificationException}. Thus, in the face of
52 :     * concurrent modification, the iterator fails quickly and cleanly, rather
53 :     * than risking arbitrary, non-deterministic behavior at an undetermined
54 :     * time in the future. The {@link Enumeration Enumerations} returned by
55 :     * the {@link #elements() elements} method are <em>not</em> fail-fast.
56 : dl 1.1 *
57 :     * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed
58 :     * as it is, generally speaking, impossible to make any hard guarantees in the
59 :     * presence of unsynchronized concurrent modification. Fail-fast iterators
60 : jsr166 1.14 * throw {@code ConcurrentModificationException} on a best-effort basis.
61 : dl 1.1 * Therefore, it would be wrong to write a program that depended on this
62 :     * exception for its correctness: <i>the fail-fast behavior of iterators
63 : jsr166 1.9 * should be used only to detect bugs.</i>
64 : dl 1.1 *
65 : jsr166 1.9 * <p>As of the Java 2 platform v1.2, this class was retrofitted to
66 :     * implement the {@link List} interface, making it a member of the
67 : jsr166 1.13 * <a href="{@docRoot}/../technotes/guides/collections/index.html"> Java
68 : jsr166 1.9 * Collections Framework</a>. Unlike the new collection
69 :     * implementations, {@code Vector} is synchronized.
70 : dl 1.1 *
71 :     * @author Lee Boynton
72 :     * @author Jonathan Payne
73 : jsr166 1.12 * @version %I%, %G%
74 : dl 1.1 * @see Collection
75 :     * @see List
76 :     * @see ArrayList
77 :     * @see LinkedList
78 :     * @since JDK1.0
79 :     */
80 :     public class Vector<E>
81 :     extends AbstractList<E>
82 :     implements List<E>, RandomAccess, Cloneable, java.io.Serializable
83 :     {
84 :     /**
85 :     * The array buffer into which the components of the vector are
86 :     * stored. The capacity of the vector is the length of this array buffer,
87 : jsr166 1.15 * and is at least large enough to contain all the vector's elements.
88 : dl 1.1 *
89 : jsr166 1.15 * <p>Any array elements following the last element in the Vector are null.
90 : dl 1.1 *
91 :     * @serial
92 :     */
93 :     protected Object[] elementData;
94 :    
95 :     /**
96 : jsr166 1.14 * The number of valid components in this {@code Vector} object.
97 :     * Components {@code elementData[0]} through
98 :     * {@code elementData[elementCount-1]} are the actual items.
99 : dl 1.1 *
100 :     * @serial
101 :     */
102 :     protected int elementCount;
103 :    
104 :     /**
105 :     * The amount by which the capacity of the vector is automatically
106 :     * incremented when its size becomes greater than its capacity. If
107 :     * the capacity increment is less than or equal to zero, the capacity
108 :     * of the vector is doubled each time it needs to grow.
109 :     *
110 :     * @serial
111 :     */
112 :     protected int capacityIncrement;
113 :    
114 :     /** use serialVersionUID from JDK 1.0.2 for interoperability */
115 :     private static final long serialVersionUID = -2767605614048989439L;
116 :    
117 :     /**
118 :     * Constructs an empty vector with the specified initial capacity and
119 :     * capacity increment.
120 :     *
121 :     * @param initialCapacity the initial capacity of the vector
122 :     * @param capacityIncrement the amount by which the capacity is
123 :     * increased when the vector overflows
124 : jsr166 1.15 * @throws IllegalArgumentException if the specified initial capacity
125 :     * is negative
126 : dl 1.1 */
127 :     public Vector(int initialCapacity, int capacityIncrement) {
128 :     super();
129 :     if (initialCapacity < 0)
130 :     throw new IllegalArgumentException("Illegal Capacity: "+
131 :     initialCapacity);
132 :     this.elementData = new Object[initialCapacity];
133 :     this.capacityIncrement = capacityIncrement;
134 :     }
135 :    
136 :     /**
137 :     * Constructs an empty vector with the specified initial capacity and
138 :     * with its capacity increment equal to zero.
139 :     *
140 :     * @param initialCapacity the initial capacity of the vector
141 : jsr166 1.15 * @throws IllegalArgumentException if the specified initial capacity
142 :     * is negative
143 : dl 1.1 */
144 :     public Vector(int initialCapacity) {
145 :     this(initialCapacity, 0);
146 :     }
147 :    
148 :     /**
149 :     * Constructs an empty vector so that its internal data array
150 : jsr166 1.14 * has size {@code 10} and its standard capacity increment is
151 : dl 1.1 * zero.
152 :     */
153 :     public Vector() {
154 :     this(10);
155 :     }
156 :    
157 :     /**
158 :     * Constructs a vector containing the elements of the specified
159 :     * collection, in the order they are returned by the collection's
160 :     * iterator.
161 :     *
162 :     * @param c the collection whose elements are to be placed into this
163 :     * vector
164 :     * @throws NullPointerException if the specified collection is null
165 :     * @since 1.2
166 :     */
167 :     public Vector(Collection<? extends E> c) {
168 : jsr166 1.6 elementData = c.toArray();
169 :     elementCount = elementData.length;
170 :     // c.toArray might (incorrectly) not return Object[] (see 6260652)
171 :     if (elementData.getClass() != Object[].class)
172 :     elementData = Arrays.copyOf(elementData, elementCount, Object[].class);
173 : dl 1.1 }
174 :    
175 :     /**
176 :     * Copies the components of this vector into the specified array.
177 : jsr166 1.14 * The item at index {@code k} in this vector is copied into
178 :     * component {@code k} of {@code anArray}.
179 : dl 1.1 *
180 :     * @param anArray the array into which the components get copied
181 :     * @throws NullPointerException if the given array is null
182 :     * @throws IndexOutOfBoundsException if the specified array is not
183 :     * large enough to hold all the components of this vector
184 :     * @throws ArrayStoreException if a component of this vector is not of
185 :     * a runtime type that can be stored in the specified array
186 :     * @see #toArray(Object[])
187 :     */
188 :     public synchronized void copyInto(Object[] anArray) {
189 :     System.arraycopy(elementData, 0, anArray, 0, elementCount);
190 :     }
191 :    
192 :     /**
193 :     * Trims the capacity of this vector to be the vector's current
194 :     * size. If the capacity of this vector is larger than its current
195 :     * size, then the capacity is changed to equal the size by replacing
196 : jsr166 1.14 * its internal data array, kept in the field {@code elementData},
197 : dl 1.1 * with a smaller one. An application can use this operation to
198 :     * minimize the storage of a vector.
199 :     */
200 :     public synchronized void trimToSize() {
201 :     modCount++;
202 :     int oldCapacity = elementData.length;
203 :     if (elementCount < oldCapacity) {
204 :     elementData = Arrays.copyOf(elementData, elementCount);
205 :     }
206 :     }
207 :    
208 :     /**
209 :     * Increases the capacity of this vector, if necessary, to ensure
210 :     * that it can hold at least the number of components specified by
211 :     * the minimum capacity argument.
212 :     *
213 :     * <p>If the current capacity of this vector is less than
214 : jsr166 1.14 * {@code minCapacity}, then its capacity is increased by replacing its
215 :     * internal data array, kept in the field {@code elementData}, with a
216 : dl 1.1 * larger one. The size of the new data array will be the old size plus
217 : jsr166 1.14 * {@code capacityIncrement}, unless the value of
218 :     * {@code capacityIncrement} is less than or equal to zero, in which case
219 : dl 1.1 * the new capacity will be twice the old capacity; but if this new size
220 : jsr166 1.14 * is still smaller than {@code minCapacity}, then the new capacity will
221 :     * be {@code minCapacity}.
222 : dl 1.1 *
223 :     * @param minCapacity the desired minimum capacity
224 :     */
225 :     public synchronized void ensureCapacity(int minCapacity) {
226 :     modCount++;
227 :     ensureCapacityHelper(minCapacity);
228 :     }
229 :    
230 :     /**
231 :     * This implements the unsynchronized semantics of ensureCapacity.
232 :     * Synchronized methods in this class can internally call this
233 :     * method for ensuring capacity without incurring the cost of an
234 :     * extra synchronization.
235 :     *
236 : jsr166 1.15 * @see #ensureCapacity(int)
237 : dl 1.1 */
238 :     private void ensureCapacityHelper(int minCapacity) {
239 :     int oldCapacity = elementData.length;
240 :     if (minCapacity > oldCapacity) {
241 :     Object[] oldData = elementData;
242 :     int newCapacity = (capacityIncrement > 0) ?
243 :     (oldCapacity + capacityIncrement) : (oldCapacity * 2);
244 :     if (newCapacity < minCapacity) {
245 :     newCapacity = minCapacity;
246 :     }
247 :     elementData = Arrays.copyOf(elementData, newCapacity);
248 :     }
249 :     }
250 :    
251 :     /**
252 :     * Sets the size of this vector. If the new size is greater than the
253 : jsr166 1.14 * current size, new {@code null} items are added to the end of
254 : dl 1.1 * the vector. If the new size is less than the current size, all
255 : jsr166 1.14 * components at index {@code newSize} and greater are discarded.
256 : dl 1.1 *
257 : jsr166 1.16 * @param newSize the new size of this vector
258 :     * @throws ArrayIndexOutOfBoundsException if the new size is negative
259 : dl 1.1 */
260 :     public synchronized void setSize(int newSize) {
261 :     modCount++;
262 :     if (newSize > elementCount) {
263 :     ensureCapacityHelper(newSize);
264 :     } else {
265 :     for (int i = newSize ; i < elementCount ; i++) {
266 :     elementData[i] = null;
267 :     }
268 :     }
269 :     elementCount = newSize;
270 :     }
271 :    
272 :     /**
273 :     * Returns the current capacity of this vector.
274 :     *
275 :     * @return the current capacity (the length of its internal
276 : jsr166 1.14 * data array, kept in the field {@code elementData}
277 : dl 1.1 * of this vector)
278 :     */
279 :     public synchronized int capacity() {
280 :     return elementData.length;
281 :     }
282 :    
283 :     /**
284 :     * Returns the number of components in this vector.
285 :     *
286 :     * @return the number of components in this vector
287 :     */
288 :     public synchronized int size() {
289 :     return elementCount;
290 :     }
291 :    
292 :     /**
293 :     * Tests if this vector has no components.
294 :     *
295 : jsr166 1.14 * @return {@code true} if and only if this vector has
296 : dl 1.1 * no components, that is, its size is zero;
297 : jsr166 1.14 * {@code false} otherwise.
298 : dl 1.1 */
299 :     public synchronized boolean isEmpty() {
300 :     return elementCount == 0;
301 :     }
302 :    
303 :     /**
304 :     * Returns an enumeration of the components of this vector. The
305 : jsr166 1.14 * returned {@code Enumeration} object will generate all items in
306 :     * this vector. The first item generated is the item at index {@code 0},
307 :     * then the item at index {@code 1}, and so on.
308 : dl 1.1 *
309 :     * @return an enumeration of the components of this vector
310 :     * @see Iterator
311 :     */
312 :     public Enumeration<E> elements() {
313 :     return new Enumeration<E>() {
314 :     int count = 0;
315 :    
316 :     public boolean hasMoreElements() {
317 :     return count < elementCount;
318 :     }
319 :    
320 :     public E nextElement() {
321 :     synchronized (Vector.this) {
322 :     if (count < elementCount) {
323 : jsr166 1.22 return elementData(count++);
324 : dl 1.1 }
325 :     }
326 :     throw new NoSuchElementException("Vector Enumeration");
327 :     }
328 :     };
329 :     }
330 :    
331 :     /**
332 : jsr166 1.14 * Returns {@code true} if this vector contains the specified element.
333 :     * More formally, returns {@code true} if and only if this vector
334 :     * contains at least one element {@code e} such that
335 : dl 1.1 * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>.
336 :     *
337 :     * @param o element whose presence in this vector is to be tested
338 : jsr166 1.14 * @return {@code true} if this vector contains the specified element
339 : dl 1.1 */
340 :     public boolean contains(Object o) {
341 :     return indexOf(o, 0) >= 0;
342 :     }
343 :    
344 :     /**
345 :     * Returns the index of the first occurrence of the specified element
346 :     * in this vector, or -1 if this vector does not contain the element.
347 : jsr166 1.14 * More formally, returns the lowest index {@code i} such that
348 : dl 1.1 * <tt>(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i)))</tt>,
349 :     * or -1 if there is no such index.
350 :     *
351 :     * @param o element to search for
352 :     * @return the index of the first occurrence of the specified element in
353 :     * this vector, or -1 if this vector does not contain the element
354 :     */
355 :     public int indexOf(Object o) {
356 :     return indexOf(o, 0);
357 :     }
358 :    
359 :     /**
360 :     * Returns the index of the first occurrence of the specified element in
361 : jsr166 1.14 * this vector, searching forwards from {@code index}, or returns -1 if
362 : dl 1.1 * the element is not found.
363 : jsr166 1.14 * More formally, returns the lowest index {@code i} such that
364 : dl 1.1 * <tt>(i&nbsp;&gt;=&nbsp;index&nbsp;&amp;&amp;&nbsp;(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i))))</tt>,
365 :     * or -1 if there is no such index.
366 :     *
367 :     * @param o element to search for
368 :     * @param index index to start searching from
369 :     * @return the index of the first occurrence of the element in
370 : jsr166 1.14 * this vector at position {@code index} or later in the vector;
371 :     * {@code -1} if the element is not found.
372 : dl 1.1 * @throws IndexOutOfBoundsException if the specified index is negative
373 :     * @see Object#equals(Object)
374 :     */
375 :     public synchronized int indexOf(Object o, int index) {
376 :     if (o == null) {
377 :     for (int i = index ; i < elementCount ; i++)
378 :     if (elementData[i]==null)
379 :     return i;
380 :     } else {
381 :     for (int i = index ; i < elementCount ; i++)
382 :     if (o.equals(elementData[i]))
383 :     return i;
384 :     }
385 :     return -1;
386 :     }
387 :    
388 :     /**
389 :     * Returns the index of the last 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 highest index {@code i} such that
392 : dl 1.1 * <tt>(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i)))</tt>,
393 :     * or -1 if there is no such index.
394 :     *
395 :     * @param o element to search for
396 :     * @return the index of the last occurrence of the specified element in
397 :     * this vector, or -1 if this vector does not contain the element
398 :     */
399 :     public synchronized int lastIndexOf(Object o) {
400 :     return lastIndexOf(o, elementCount-1);
401 :     }
402 :    
403 :     /**
404 :     * Returns the index of the last occurrence of the specified element in
405 : jsr166 1.14 * this vector, searching backwards from {@code index}, or returns -1 if
406 : dl 1.1 * the element is not found.
407 : jsr166 1.14 * More formally, returns the highest index {@code i} such that
408 : dl 1.1 * <tt>(i&nbsp;&lt;=&nbsp;index&nbsp;&amp;&amp;&nbsp;(o==null&nbsp;?&nbsp;get(i)==null&nbsp;:&nbsp;o.equals(get(i))))</tt>,
409 :     * or -1 if there is no such index.
410 :     *
411 :     * @param o element to search for
412 :     * @param index index to start searching backwards from
413 :     * @return the index of the last occurrence of the element at position
414 : jsr166 1.14 * less than or equal to {@code index} in this vector;
415 : dl 1.1 * -1 if the element is not found.
416 :     * @throws IndexOutOfBoundsException if the specified index is greater
417 :     * than or equal to the current size of this vector
418 :     */
419 :     public synchronized int lastIndexOf(Object o, int index) {
420 :     if (index >= elementCount)
421 :     throw new IndexOutOfBoundsException(index + " >= "+ elementCount);
422 :    
423 :     if (o == null) {
424 :     for (int i = index; i >= 0; i--)
425 :     if (elementData[i]==null)
426 :     return i;
427 :     } else {
428 :     for (int i = index; i >= 0; i--)
429 :     if (o.equals(elementData[i]))
430 :     return i;
431 :     }
432 :     return -1;
433 :     }
434 :    
435 :     /**
436 : jsr166 1.15 * Returns the component at the specified index.
437 : dl 1.1 *
438 : jsr166 1.15 * <p>This method is identical in functionality to the {@link #get(int)}
439 :     * method (which is part of the {@link List} interface).
440 : dl 1.1 *
441 :     * @param index an index into this vector
442 :     * @return the component at the specified index
443 : jsr166 1.15 * @throws ArrayIndexOutOfBoundsException if the index is out of range
444 :     * ({@code index < 0 || index >= size()})
445 : dl 1.1 */
446 :     public synchronized E elementAt(int index) {
447 :     if (index >= elementCount) {
448 :     throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount);
449 :     }
450 :    
451 : jsr166 1.22 return elementData(index);
452 : dl 1.1 }
453 :    
454 :     /**
455 : jsr166 1.14 * Returns the first component (the item at index {@code 0}) of
456 : dl 1.1 * this vector.
457 :     *
458 :     * @return the first component of this vector
459 : jsr166 1.15 * @throws NoSuchElementException if this vector has no components
460 : dl 1.1 */
461 :     public synchronized E firstElement() {
462 :     if (elementCount == 0) {
463 :     throw new NoSuchElementException();
464 :     }
465 : jsr166 1.22 return elementData(0);
466 : dl 1.1 }
467 :    
468 :     /**
469 :     * Returns the last component of the vector.
470 :     *
471 :     * @return the last component of the vector, i.e., the component at index
472 :     * <code>size()&nbsp;-&nbsp;1</code>.
473 : jsr166 1.15 * @throws NoSuchElementException if this vector is empty
474 : dl 1.1 */
475 :     public synchronized E lastElement() {
476 :     if (elementCount == 0) {
477 :     throw new NoSuchElementException();
478 :     }
479 : jsr166 1.22 return elementData(elementCount - 1);
480 : dl 1.1 }
481 :    
482 :     /**
483 : jsr166 1.14 * Sets the component at the specified {@code index} of this
484 : dl 1.1 * vector to be the specified object. The previous component at that
485 : jsr166 1.16 * position is discarded.
486 : dl 1.1 *
487 : jsr166 1.16 * <p>The index must be a value greater than or equal to {@code 0}
488 :     * and less than the current size of the vector.
489 : dl 1.1 *
490 : jsr166 1.17 * <p>This method is identical in functionality to the
491 :     * {@link #set(int, Object) set(int, E)}
492 :     * method (which is part of the {@link List} interface). Note that the
493 :     * {@code set} method reverses the order of the parameters, to more closely
494 :     * match array usage. Note also that the {@code set} method returns the
495 :     * old value that was stored at the specified position.
496 : dl 1.1 *
497 :     * @param obj what the component is to be set to
498 :     * @param index the specified index
499 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
500 :     * ({@code index < 0 || index >= size()})
501 : dl 1.1 */
502 :     public synchronized void setElementAt(E obj, int index) {
503 :     if (index >= elementCount) {
504 :     throw new ArrayIndexOutOfBoundsException(index + " >= " +
505 :     elementCount);
506 :     }
507 :     elementData[index] = obj;
508 :     }
509 :    
510 :     /**
511 :     * Deletes the component at the specified index. Each component in
512 :     * this vector with an index greater or equal to the specified
513 : jsr166 1.14 * {@code index} is shifted downward to have an index one
514 : dl 1.1 * smaller than the value it had previously. The size of this vector
515 : jsr166 1.15 * is decreased by {@code 1}.
516 : dl 1.1 *
517 : jsr166 1.15 * <p>The index must be a value greater than or equal to {@code 0}
518 :     * and less than the current size of the vector.
519 : dl 1.1 *
520 : jsr166 1.17 * <p>This method is identical in functionality to the {@link #remove(int)}
521 :     * method (which is part of the {@link List} interface). Note that the
522 :     * {@code remove} method returns the old value that was stored at the
523 :     * specified position.
524 : dl 1.1 *
525 :     * @param index the index of the object to remove
526 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
527 :     * ({@code index < 0 || index >= size()})
528 : dl 1.1 */
529 :     public synchronized void removeElementAt(int index) {
530 :     modCount++;
531 :     if (index >= elementCount) {
532 :     throw new ArrayIndexOutOfBoundsException(index + " >= " +
533 :     elementCount);
534 :     }
535 :     else if (index < 0) {
536 :     throw new ArrayIndexOutOfBoundsException(index);
537 :     }
538 :     int j = elementCount - index - 1;
539 :     if (j > 0) {
540 :     System.arraycopy(elementData, index + 1, elementData, index, j);
541 :     }
542 :     elementCount--;
543 :     elementData[elementCount] = null; /* to let gc do its work */
544 :     }
545 :    
546 :     /**
547 :     * Inserts the specified object as a component in this vector at the
548 : jsr166 1.14 * specified {@code index}. Each component in this vector with
549 :     * an index greater or equal to the specified {@code index} is
550 : dl 1.1 * shifted upward to have an index one greater than the value it had
551 : jsr166 1.15 * previously.
552 : dl 1.1 *
553 : jsr166 1.15 * <p>The index must be a value greater than or equal to {@code 0}
554 : dl 1.1 * and less than or equal to the current size of the vector. (If the
555 :     * index is equal to the current size of the vector, the new element
556 : jsr166 1.15 * is appended to the Vector.)
557 : dl 1.1 *
558 : jsr166 1.17 * <p>This method is identical in functionality to the
559 :     * {@link #add(int, Object) add(int, E)}
560 :     * method (which is part of the {@link List} interface). Note that the
561 :     * {@code add} method reverses the order of the parameters, to more closely
562 :     * match array usage.
563 : dl 1.1 *
564 :     * @param obj the component to insert
565 :     * @param index where to insert the new component
566 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
567 :     * ({@code index < 0 || index > size()})
568 : dl 1.1 */
569 :     public synchronized void insertElementAt(E obj, int index) {
570 :     modCount++;
571 :     if (index > elementCount) {
572 :     throw new ArrayIndexOutOfBoundsException(index
573 :     + " > " + elementCount);
574 :     }
575 :     ensureCapacityHelper(elementCount + 1);
576 :     System.arraycopy(elementData, index, elementData, index + 1, elementCount - index);
577 :     elementData[index] = obj;
578 :     elementCount++;
579 :     }
580 :    
581 :     /**
582 :     * Adds the specified component to the end of this vector,
583 :     * increasing its size by one. The capacity of this vector is
584 : jsr166 1.16 * increased if its size becomes greater than its capacity.
585 : dl 1.1 *
586 : jsr166 1.17 * <p>This method is identical in functionality to the
587 : jsr166 1.18 * {@link #add(Object) add(E)}
588 :     * method (which is part of the {@link List} interface).
589 : dl 1.1 *
590 :     * @param obj the component to be added
591 :     */
592 :     public synchronized void addElement(E obj) {
593 :     modCount++;
594 :     ensureCapacityHelper(elementCount + 1);
595 :     elementData[elementCount++] = obj;
596 :     }
597 :    
598 :     /**
599 :     * Removes the first (lowest-indexed) occurrence of the argument
600 :     * from this vector. If the object is found in this vector, each
601 :     * component in the vector with an index greater or equal to the
602 :     * object's index is shifted downward to have an index one smaller
603 : jsr166 1.16 * than the value it had previously.
604 : dl 1.1 *
605 : jsr166 1.18 * <p>This method is identical in functionality to the
606 :     * {@link #remove(Object)} method (which is part of the
607 :     * {@link List} interface).
608 : dl 1.1 *
609 :     * @param obj the component to be removed
610 : jsr166 1.14 * @return {@code true} if the argument was a component of this
611 :     * vector; {@code false} otherwise.
612 : dl 1.1 */
613 :     public synchronized boolean removeElement(Object obj) {
614 :     modCount++;
615 :     int i = indexOf(obj);
616 :     if (i >= 0) {
617 :     removeElementAt(i);
618 :     return true;
619 :     }
620 :     return false;
621 :     }
622 :    
623 :     /**
624 : jsr166 1.17 * Removes all components from this vector and sets its size to zero.
625 : dl 1.1 *
626 : jsr166 1.17 * <p>This method is identical in functionality to the {@link #clear}
627 :     * method (which is part of the {@link List} interface).
628 : dl 1.1 */
629 :     public synchronized void removeAllElements() {
630 :     modCount++;
631 :     // Let gc do its work
632 :     for (int i = 0; i < elementCount; i++)
633 :     elementData[i] = null;
634 :    
635 :     elementCount = 0;
636 :     }
637 :    
638 :     /**
639 :     * Returns a clone of this vector. The copy will contain a
640 :     * reference to a clone of the internal data array, not a reference
641 : jsr166 1.14 * to the original internal data array of this {@code Vector} object.
642 : dl 1.1 *
643 :     * @return a clone of this vector
644 :     */
645 :     public synchronized Object clone() {
646 :     try {
647 : jsr166 1.22 @SuppressWarnings("unchecked")
648 :     Vector<E> v = (Vector<E>) super.clone();
649 : dl 1.1 v.elementData = Arrays.copyOf(elementData, elementCount);
650 :     v.modCount = 0;
651 :     return v;
652 :     } catch (CloneNotSupportedException e) {
653 :     // this shouldn't happen, since we are Cloneable
654 :     throw new InternalError();
655 :     }
656 :     }
657 :    
658 :     /**
659 :     * Returns an array containing all of the elements in this Vector
660 :     * in the correct order.
661 :     *
662 :     * @since 1.2
663 :     */
664 :     public synchronized Object[] toArray() {
665 :     return Arrays.copyOf(elementData, elementCount);
666 :     }
667 :    
668 :     /**
669 :     * Returns an array containing all of the elements in this Vector in the
670 :     * correct order; the runtime type of the returned array is that of the
671 :     * specified array. If the Vector fits in the specified array, it is
672 :     * returned therein. Otherwise, a new array is allocated with the runtime
673 : jsr166 1.16 * type of the specified array and the size of this Vector.
674 : dl 1.1 *
675 : jsr166 1.16 * <p>If the Vector fits in the specified array with room to spare
676 : dl 1.1 * (i.e., the array has more elements than the Vector),
677 :     * the element in the array immediately following the end of the
678 :     * Vector is set to null. (This is useful in determining the length
679 :     * of the Vector <em>only</em> if the caller knows that the Vector
680 :     * does not contain any null elements.)
681 :     *
682 :     * @param a the array into which the elements of the Vector are to
683 :     * be stored, if it is big enough; otherwise, a new array of the
684 :     * same runtime type is allocated for this purpose.
685 :     * @return an array containing the elements of the Vector
686 : jsr166 1.17 * @throws ArrayStoreException if the runtime type of a is not a supertype
687 : dl 1.1 * of the runtime type of every element in this Vector
688 :     * @throws NullPointerException if the given array is null
689 :     * @since 1.2
690 :     */
691 : jsr166 1.22 @SuppressWarnings("unchecked")
692 : dl 1.1 public synchronized <T> T[] toArray(T[] a) {
693 :     if (a.length < elementCount)
694 :     return (T[]) Arrays.copyOf(elementData, elementCount, a.getClass());
695 :    
696 :     System.arraycopy(elementData, 0, a, 0, elementCount);
697 :    
698 :     if (a.length > elementCount)
699 :     a[elementCount] = null;
700 :    
701 :     return a;
702 :     }
703 :    
704 :     // Positional Access Operations
705 :    
706 : jsr166 1.22 @SuppressWarnings("unchecked")
707 :     E elementData(int index) {
708 :     return (E) elementData[index];
709 :     }
710 :    
711 : dl 1.1 /**
712 :     * Returns the element at the specified position in this Vector.
713 :     *
714 :     * @param index index of the element to return
715 :     * @return object at the specified index
716 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
717 :     * ({@code index < 0 || index >= size()})
718 : dl 1.1 * @since 1.2
719 :     */
720 :     public synchronized E get(int index) {
721 :     if (index >= elementCount)
722 :     throw new ArrayIndexOutOfBoundsException(index);
723 :    
724 : jsr166 1.22 return elementData(index);
725 : dl 1.1 }
726 :    
727 :     /**
728 :     * Replaces the element at the specified position in this Vector with the
729 :     * specified element.
730 :     *
731 :     * @param index index of the element to replace
732 :     * @param element element to be stored at the specified position
733 :     * @return the element previously at the specified position
734 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
735 :     * ({@code index < 0 || index >= size()})
736 : dl 1.1 * @since 1.2
737 :     */
738 :     public synchronized E set(int index, E element) {
739 :     if (index >= elementCount)
740 :     throw new ArrayIndexOutOfBoundsException(index);
741 :    
742 : jsr166 1.22 E oldValue = elementData(index);
743 : dl 1.1 elementData[index] = element;
744 : jsr166 1.22 return oldValue;
745 : dl 1.1 }
746 :    
747 :     /**
748 :     * Appends the specified element to the end of this Vector.
749 :     *
750 :     * @param e element to be appended to this Vector
751 : jsr166 1.14 * @return {@code true} (as specified by {@link Collection#add})
752 : dl 1.1 * @since 1.2
753 :     */
754 :     public synchronized boolean add(E e) {
755 :     modCount++;
756 :     ensureCapacityHelper(elementCount + 1);
757 :     elementData[elementCount++] = e;
758 :     return true;
759 :     }
760 :    
761 :     /**
762 :     * Removes the first occurrence of the specified element in this Vector
763 :     * If the Vector does not contain the element, it is unchanged. More
764 :     * formally, removes the element with the lowest index i such that
765 : jsr166 1.14 * {@code (o==null ? get(i)==null : o.equals(get(i)))} (if such
766 : dl 1.1 * an element exists).
767 :     *
768 :     * @param o element to be removed from this Vector, if present
769 :     * @return true if the Vector contained the specified element
770 :     * @since 1.2
771 :     */
772 :     public boolean remove(Object o) {
773 :     return removeElement(o);
774 :     }
775 :    
776 :     /**
777 :     * Inserts the specified element at the specified position in this Vector.
778 :     * Shifts the element currently at that position (if any) and any
779 :     * subsequent elements to the right (adds one to their indices).
780 :     *
781 :     * @param index index at which the specified element is to be inserted
782 :     * @param element element to be inserted
783 : jsr166 1.17 * @throws ArrayIndexOutOfBoundsException if the index is out of range
784 :     * ({@code index < 0 || index > size()})
785 : dl 1.1 * @since 1.2
786 :     */
787 :     public void add(int index, E element) {
788 :     insertElementAt(element, index);
789 :     }
790 :    
791 :     /**
792 :     * Removes the element at the specified position in this Vector.
793 :     * Shifts any subsequent elements to the left (subtracts one from their
794 :     * indices). Returns the element that was removed from the Vector.
795 :     *
796 : jsr166 1.18 * @throws ArrayIndexOutOfBoundsException if the index is out of range
797 :     * ({@code index < 0 || index >= size()})
798 : dl 1.1 * @param index the index of the element to be removed
799 :     * @return element that was removed
800 :     * @since 1.2
801 :     */
802 :     public synchronized E remove(int index) {
803 :     modCount++;
804 :     if (index >= elementCount)
805 :     throw new ArrayIndexOutOfBoundsException(index);
806 : jsr166 1.22 E oldValue = elementData(index);
807 : dl 1.1
808 :     int numMoved = elementCount - index - 1;
809 :     if (numMoved > 0)
810 :     System.arraycopy(elementData, index+1, elementData, index,
811 :     numMoved);
812 :     elementData[--elementCount] = null; // Let gc do its work
813 :    
814 : jsr166 1.22 return oldValue;
815 : dl 1.1 }
816 :    
817 :     /**
818 :     * Removes all of the elements from this Vector. The Vector will
819 :     * be empty after this call returns (unless it throws an exception).
820 :     *
821 :     * @since 1.2
822 :     */
823 :     public void clear() {
824 :     removeAllElements();
825 :     }
826 :    
827 :     // Bulk Operations
828 :    
829 :     /**
830 :     * Returns true if this Vector contains all of the elements in the
831 :     * specified Collection.
832 :     *
833 :     * @param c a collection whose elements will be tested for containment
834 :     * in this Vector
835 :     * @return true if this Vector contains all of the elements in the
836 :     * specified collection
837 :     * @throws NullPointerException if the specified collection is null
838 :     */
839 :     public synchronized boolean containsAll(Collection<?> c) {
840 :     return super.containsAll(c);
841 :     }
842 :    
843 :     /**
844 :     * Appends all of the elements in the specified Collection to the end of
845 :     * this Vector, in the order that they are returned by the specified
846 :     * Collection's Iterator. The behavior of this operation is undefined if
847 :     * the specified Collection is modified while the operation is in progress.
848 :     * (This implies that the behavior of this call is undefined if the
849 :     * specified Collection is this Vector, and this Vector is nonempty.)
850 :     *
851 :     * @param c elements to be inserted into this Vector
852 : jsr166 1.14 * @return {@code true} if this Vector changed as a result of the call
853 : dl 1.1 * @throws NullPointerException if the specified collection is null
854 :     * @since 1.2
855 :     */
856 :     public synchronized boolean addAll(Collection<? extends E> c) {
857 :     modCount++;
858 :     Object[] a = c.toArray();
859 :     int numNew = a.length;
860 :     ensureCapacityHelper(elementCount + numNew);
861 :     System.arraycopy(a, 0, elementData, elementCount, numNew);
862 :     elementCount += numNew;
863 :     return numNew != 0;
864 :     }
865 :    
866 :     /**
867 :     * Removes from this Vector all of its elements that are contained in the
868 :     * specified Collection.
869 :     *
870 :     * @param c a collection of elements to be removed from the Vector
871 :     * @return true if this Vector changed as a result of the call
872 :     * @throws ClassCastException if the types of one or more elements
873 :     * in this vector are incompatible with the specified
874 :     * collection (optional)
875 :     * @throws NullPointerException if this vector contains one or more null
876 :     * elements and the specified collection does not support null
877 :     * elements (optional), or if the specified collection is null
878 :     * @since 1.2
879 :     */
880 :     public synchronized boolean removeAll(Collection<?> c) {
881 :     return super.removeAll(c);
882 :     }
883 :    
884 :     /**
885 :     * Retains only the elements in this Vector that are contained in the
886 :     * specified Collection. In other words, removes from this Vector all
887 :     * of its elements that are not contained in the specified Collection.
888 :     *
889 :     * @param c a collection of elements to be retained in this Vector
890 :     * (all other elements are removed)
891 :     * @return true if this Vector changed as a result of the call
892 :     * @throws ClassCastException if the types of one or more elements
893 :     * in this vector are incompatible with the specified
894 :     * collection (optional)
895 :     * @throws NullPointerException if this vector contains one or more null
896 :     * elements and the specified collection does not support null
897 :     * elements (optional), or if the specified collection is null
898 :     * @since 1.2
899 :     */
900 :     public synchronized boolean retainAll(Collection<?> c) {
901 :     return super.retainAll(c);
902 :     }
903 :    
904 :     /**
905 :     * Inserts all of the elements in the specified Collection into this
906 :     * Vector at the specified position. Shifts the element currently at
907 :     * that position (if any) and any subsequent elements to the right
908 :     * (increases their indices). The new elements will appear in the Vector
909 :     * in the order that they are returned by the specified Collection's
910 :     * iterator.
911 :     *
912 :     * @param index index at which to insert the first element from the
913 :     * specified collection
914 :     * @param c elements to be inserted into this Vector
915 : jsr166 1.14 * @return {@code true} if this Vector changed as a result of the call
916 : jsr166 1.18 * @throws ArrayIndexOutOfBoundsException if the index is out of range
917 :     * ({@code index < 0 || index > size()})
918 : dl 1.1 * @throws NullPointerException if the specified collection is null
919 :     * @since 1.2
920 :     */
921 :     public synchronized boolean addAll(int index, Collection<? extends E> c) {
922 :     modCount++;
923 :     if (index < 0 || index > elementCount)
924 :     throw new ArrayIndexOutOfBoundsException(index);
925 :    
926 :     Object[] a = c.toArray();
927 :     int numNew = a.length;
928 :     ensureCapacityHelper(elementCount + numNew);
929 :    
930 :     int numMoved = elementCount - index;
931 :     if (numMoved > 0)
932 :     System.arraycopy(elementData, index, elementData, index + numNew,
933 :     numMoved);
934 :    
935 :     System.arraycopy(a, 0, elementData, index, numNew);
936 :     elementCount += numNew;
937 :     return numNew != 0;
938 :     }
939 :    
940 :     /**
941 :     * Compares the specified Object with this Vector for equality. Returns
942 :     * true if and only if the specified Object is also a List, both Lists
943 :     * have the same size, and all corresponding pairs of elements in the two
944 : jsr166 1.14 * Lists are <em>equal</em>. (Two elements {@code e1} and
945 :     * {@code e2} are <em>equal</em> if {@code (e1==null ? e2==null :
946 :     * e1.equals(e2))}.) In other words, two Lists are defined to be
947 : dl 1.1 * equal if they contain the same elements in the same order.
948 :     *
949 :     * @param o the Object to be compared for equality with this Vector
950 :     * @return true if the specified Object is equal to this Vector
951 :     */
952 :     public synchronized boolean equals(Object o) {
953 :     return super.equals(o);
954 :     }
955 :    
956 :     /**
957 :     * Returns the hash code value for this Vector.
958 :     */
959 :     public synchronized int hashCode() {
960 :     return super.hashCode();
961 :     }
962 :    
963 :     /**
964 :     * Returns a string representation of this Vector, containing
965 :     * the String representation of each element.
966 :     */
967 :     public synchronized String toString() {
968 :     return super.toString();
969 :     }
970 :    
971 :     /**
972 : jsr166 1.22 * Returns a view of the portion of this List between fromIndex,
973 :     * inclusive, and toIndex, exclusive. (If fromIndex and toIndex are
974 :     * equal, the returned List is empty.) The returned List is backed by this
975 :     * List, so changes in the returned List are reflected in this List, and
976 :     * vice-versa. The returned List supports all of the optional List
977 :     * operations supported by this List.
978 : dl 1.1 *
979 : jsr166 1.22 * <p>This method eliminates the need for explicit range operations (of
980 :     * the sort that commonly exist for arrays). Any operation that expects
981 :     * a List can be used as a range operation by operating on a subList view
982 :     * instead of a whole List. For example, the following idiom
983 :     * removes a range of elements from a List:
984 :     * <pre>
985 :     * list.subList(from, to).clear();
986 :     * </pre>
987 :     * Similar idioms may be constructed for indexOf and lastIndexOf,
988 :     * and all of the algorithms in the Collections class can be applied to
989 :     * a subList.
990 :     *
991 :     * <p>The semantics of the List returned by this method become undefined if
992 :     * the backing list (i.e., this List) is <i>structurally modified</i> in
993 :     * any way other than via the returned List. (Structural modifications are
994 :     * those that change the size of the List, or otherwise perturb it in such
995 :     * a fashion that iterations in progress may yield incorrect results.)
996 :     *
997 :     * @param fromIndex low endpoint (inclusive) of the subList
998 :     * @param toIndex high endpoint (exclusive) of the subList
999 :     * @return a view of the specified range within this List
1000 :     * @throws IndexOutOfBoundsException if an endpoint index value is out of range
1001 :     * {@code (fromIndex < 0 || toIndex > size)}
1002 :     * @throws IllegalArgumentException if the endpoint indices are out of order
1003 :     * {@code (fromIndex > toIndex)}
1004 :     */
1005 :     public synchronized List<E> subList(int fromIndex, int toIndex) {
1006 :     return Collections.synchronizedList(super.subList(fromIndex, toIndex),
1007 :     this);
1008 :     }
1009 :    
1010 :     /**
1011 :     * Removes from this list all of the elements whose index is between
1012 :     * {@code fromIndex}, inclusive, and {@code toIndex}, exclusive.
1013 :     * Shifts any succeeding elements to the left (reduces their index).
1014 :     * This call shortens the list by {@code (toIndex - fromIndex)} elements.
1015 :     * (If {@code toIndex==fromIndex}, this operation has no effect.)
1016 : dl 1.1 */
1017 :     protected synchronized void removeRange(int fromIndex, int toIndex) {
1018 :     modCount++;
1019 :     int numMoved = elementCount - toIndex;
1020 :     System.arraycopy(elementData, toIndex, elementData, fromIndex,
1021 :     numMoved);
1022 :    
1023 :     // Let gc do its work
1024 :     int newElementCount = elementCount - (toIndex-fromIndex);
1025 :     while (elementCount != newElementCount)
1026 :     elementData[--elementCount] = null;
1027 :     }
1028 :    
1029 :     /**
1030 : jsr166 1.14 * Save the state of the {@code Vector} instance to a stream (that
1031 : dl 1.1 * is, serialize it). This method is present merely for synchronization.
1032 :     * It just calls the default writeObject method.
1033 :     */
1034 :     private synchronized void writeObject(java.io.ObjectOutputStream s)
1035 :     throws java.io.IOException
1036 :     {
1037 :     s.defaultWriteObject();
1038 :     }
1039 :    
1040 :     /**
1041 : jsr166 1.22 * Returns a list iterator over the elements in this list (in proper
1042 : dl 1.1 * sequence), starting at the specified position in the list.
1043 : jsr166 1.22 * The specified index indicates the first element that would be
1044 :     * returned by an initial call to {@link ListIterator#next next}.
1045 :     * An initial call to {@link ListIterator#previous previous} would
1046 :     * return the element with the specified index minus one.
1047 :     *
1048 :     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1049 : dl 1.1 *
1050 :     * @throws IndexOutOfBoundsException {@inheritDoc}
1051 :     */
1052 :     public synchronized ListIterator<E> listIterator(int index) {
1053 :     if (index < 0 || index > elementCount)
1054 :     throw new IndexOutOfBoundsException("Index: "+index);
1055 : jsr166 1.22 return new ListItr(index);
1056 : dl 1.1 }
1057 : jsr166 1.2
1058 : dl 1.1 /**
1059 : jsr166 1.22 * Returns a list iterator over the elements in this list (in proper
1060 :     * sequence).
1061 :     *
1062 :     * <p>The returned list iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1063 :     *
1064 :     * @see #listIterator(int)
1065 : dl 1.3 */
1066 :     public synchronized ListIterator<E> listIterator() {
1067 : jsr166 1.22 return new ListItr(0);
1068 : dl 1.3 }
1069 :    
1070 :     /**
1071 : dl 1.1 * Returns an iterator over the elements in this list in proper sequence.
1072 :     *
1073 : jsr166 1.22 * <p>The returned iterator is <a href="#fail-fast"><i>fail-fast</i></a>.
1074 :     *
1075 : dl 1.1 * @return an iterator over the elements in this list in proper sequence
1076 :     */
1077 :     public synchronized Iterator<E> iterator() {
1078 : jsr166 1.22 return new Itr();
1079 : dl 1.1 }
1080 :    
1081 :     /**
1082 : jsr166 1.22 * An optimized version of AbstractList.Itr
1083 : dl 1.10 */
1084 : jsr166 1.22 private class Itr implements Iterator<E> {
1085 :     int cursor; // index of next element to return
1086 :     int lastRet = -1; // index of last element returned; -1 if no such
1087 :     int expectedModCount = modCount;
1088 :    
1089 :     public boolean hasNext() {
1090 :     // Racy but within spec, since modifications are checked
1091 :     // within or after synchronization in next/previous
1092 :     return cursor != elementCount;
1093 :     }
1094 :    
1095 :     public E next() {
1096 :     synchronized (Vector.this) {
1097 :     checkForComodification();
1098 :     int i = cursor;
1099 :     if (i >= elementCount)
1100 :     throw new NoSuchElementException();
1101 :     cursor = i + 1;
1102 :     return elementData(lastRet = i);
1103 :     }
1104 :     }
1105 :    
1106 :     public void remove() {
1107 :     if (lastRet == -1)
1108 :     throw new IllegalStateException();
1109 :     synchronized (Vector.this) {
1110 :     checkForComodification();
1111 :     Vector.this.remove(lastRet);
1112 :     expectedModCount = modCount;
1113 : dl 1.10 }
1114 : jsr166 1.22 cursor = lastRet;
1115 :     lastRet = -1;
1116 :     }
1117 :    
1118 :     final void checkForComodification() {
1119 :     if (modCount != expectedModCount)
1120 :     throw new ConcurrentModificationException();
1121 :     }
1122 : dl 1.10 }
1123 :    
1124 :     /**
1125 : jsr166 1.22 * An optimized version of AbstractList.ListItr
1126 : dl 1.1 */
1127 : jsr166 1.22 final class ListItr extends Itr implements ListIterator<E> {
1128 :     ListItr(int index) {
1129 :     super();
1130 :     cursor = index;
1131 : dl 1.1 }
1132 :    
1133 :     public boolean hasPrevious() {
1134 : jsr166 1.22 return cursor != 0;
1135 : dl 1.1 }
1136 :    
1137 :     public int nextIndex() {
1138 :     return cursor;
1139 :     }
1140 :    
1141 :     public int previousIndex() {
1142 :     return cursor - 1;
1143 :     }
1144 :    
1145 : jsr166 1.22 public E previous() {
1146 :     synchronized (Vector.this) {
1147 :     checkForComodification();
1148 :     int i = cursor - 1;
1149 :     if (i < 0)
1150 :     throw new NoSuchElementException();
1151 :     cursor = i;
1152 :     return elementData(lastRet = i);
1153 :     }
1154 : dl 1.1 }
1155 :    
1156 : dl 1.10 public void set(E e) {
1157 : jsr166 1.22 if (lastRet == -1)
1158 : dl 1.1 throw new IllegalStateException();
1159 : jsr166 1.22 synchronized (Vector.this) {
1160 :     checkForComodification();
1161 :     Vector.this.set(lastRet, e);
1162 : dl 1.3 }
1163 : dl 1.1 }
1164 :    
1165 :     public void add(E e) {
1166 : jsr166 1.22 int i = cursor;
1167 :     synchronized (Vector.this) {
1168 :     checkForComodification();
1169 :     Vector.this.add(i, e);
1170 :     expectedModCount = modCount;
1171 : dl 1.3 }
1172 : jsr166 1.22 cursor = i + 1;
1173 :     lastRet = -1;
1174 : dl 1.1 }
1175 :     }
1176 :     }

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8