89 |
|
* collection, in the order they are returned by the collection's |
90 |
|
* iterator. |
91 |
|
* |
92 |
< |
* @param c the collection whose elements are to be placed into this list. |
93 |
< |
* @throws NullPointerException if the specified collection is null. |
92 |
> |
* @param c the collection whose elements are to be placed into this list |
93 |
> |
* @throws NullPointerException if the specified collection is null |
94 |
|
*/ |
95 |
|
public LinkedList(Collection<? extends E> c) { |
96 |
|
this(); |
100 |
|
/** |
101 |
|
* Returns the first element in this list. |
102 |
|
* |
103 |
< |
* @return the first element in this list. |
104 |
< |
* @throws NoSuchElementException if this list is empty. |
103 |
> |
* @return the first element in this list |
104 |
> |
* @throws NoSuchElementException if this list is empty |
105 |
|
*/ |
106 |
|
public E getFirst() { |
107 |
|
if (size==0) |
113 |
|
/** |
114 |
|
* Returns the last element in this list. |
115 |
|
* |
116 |
< |
* @return the last element in this list. |
117 |
< |
* @throws NoSuchElementException if this list is empty. |
116 |
> |
* @return the last element in this list |
117 |
> |
* @throws NoSuchElementException if this list is empty |
118 |
|
*/ |
119 |
|
public E getLast() { |
120 |
|
if (size==0) |
126 |
|
/** |
127 |
|
* Removes and returns the first element from this list. |
128 |
|
* |
129 |
< |
* @return the first element from this list. |
130 |
< |
* @throws NoSuchElementException if this list is empty. |
129 |
> |
* @return the first element from this list |
130 |
> |
* @throws NoSuchElementException if this list is empty |
131 |
|
*/ |
132 |
|
public E removeFirst() { |
133 |
|
return remove(header.next); |
136 |
|
/** |
137 |
|
* Removes and returns the last element from this list. |
138 |
|
* |
139 |
< |
* @return the last element from this list. |
140 |
< |
* @throws NoSuchElementException if this list is empty. |
139 |
> |
* @return the last element from this list |
140 |
> |
* @throws NoSuchElementException if this list is empty |
141 |
|
*/ |
142 |
|
public E removeLast() { |
143 |
|
return remove(header.previous); |
146 |
|
/** |
147 |
|
* Inserts the given element at the beginning of this list. |
148 |
|
* |
149 |
< |
* @param e the element to be inserted at the beginning of this list. |
149 |
> |
* @param e the element to be inserted at the beginning of this list |
150 |
|
*/ |
151 |
|
public void addFirst(E e) { |
152 |
|
addBefore(e, header.next); |
156 |
|
* Appends the given element to the end of this list. (Identical in |
157 |
|
* function to the <tt>add</tt> method; included only for consistency.) |
158 |
|
* |
159 |
< |
* @param e the element to be inserted at the end of this list. |
159 |
> |
* @param e the element to be inserted at the end of this list |
160 |
|
*/ |
161 |
|
public void addLast(E e) { |
162 |
|
addBefore(e, header); |
165 |
|
/** |
166 |
|
* Returns <tt>true</tt> if this list contains the specified element. |
167 |
|
* More formally, returns <tt>true</tt> if and only if this list contains |
168 |
< |
* at least one element <tt>e</tt> such that <tt>(o==null ? e==null |
169 |
< |
* : o.equals(e))</tt>. |
168 |
> |
* at least one element <tt>e</tt> such that |
169 |
> |
* <tt>(o==null ? e==null : o.equals(e))</tt>. |
170 |
|
* |
171 |
< |
* @param o element whose presence in this list is to be tested. |
172 |
< |
* @return <tt>true</tt> if this list contains the specified element. |
171 |
> |
* @param o element whose presence in this list is to be tested |
172 |
> |
* @return <tt>true</tt> if this list contains the specified element |
173 |
|
*/ |
174 |
|
public boolean contains(Object o) { |
175 |
|
return indexOf(o) != -1; |
178 |
|
/** |
179 |
|
* Returns the number of elements in this list. |
180 |
|
* |
181 |
< |
* @return the number of elements in this list. |
181 |
> |
* @return the number of elements in this list |
182 |
|
*/ |
183 |
|
public int size() { |
184 |
|
return size; |
187 |
|
/** |
188 |
|
* Appends the specified element to the end of this list. |
189 |
|
* |
190 |
< |
* @param o element to be appended to this list. |
191 |
< |
* @return <tt>true</tt> (as per the general contract of |
192 |
< |
* <tt>Collection.add</tt>). |
190 |
> |
* @param e element to be appended to this list |
191 |
> |
* @return <tt>true</tt> (as per the spec for {@link Collection#add}) |
192 |
|
*/ |
193 |
< |
public boolean add(E o) { |
194 |
< |
addBefore(o, header); |
193 |
> |
public boolean add(E e) { |
194 |
> |
addBefore(e, header); |
195 |
|
return true; |
196 |
|
} |
197 |
|
|
198 |
|
/** |
199 |
< |
* Removes the first occurrence of the specified element in this list. If |
200 |
< |
* the list does not contain the element, it is unchanged. More formally, |
201 |
< |
* removes the element with the lowest index <tt>i</tt> such that |
202 |
< |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt> (if such an |
203 |
< |
* element exists). |
199 |
> |
* Removes the first occurrence of the specified element from this list, |
200 |
> |
* if it is present. If this list does not contain the element, it is |
201 |
> |
* unchanged. More formally, removes the element with the lowest index |
202 |
> |
* <tt>i</tt> such that |
203 |
> |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt> |
204 |
> |
* (if such an element exists). Returns <tt>true</tt> if this list |
205 |
> |
* contained the specified element (or equivalently, if this list |
206 |
> |
* changed as a result of the call). |
207 |
|
* |
208 |
< |
* @param o element to be removed from this list, if present. |
209 |
< |
* @return <tt>true</tt> if the list contained the specified element. |
208 |
> |
* @param o element to be removed from this list, if present |
209 |
> |
* @return <tt>true</tt> if this list contained the specified element |
210 |
|
*/ |
211 |
|
public boolean remove(Object o) { |
212 |
|
if (o==null) { |
235 |
|
* progress. (This implies that the behavior of this call is undefined if |
236 |
|
* the specified Collection is this list, and this list is nonempty.) |
237 |
|
* |
238 |
< |
* @param c the elements to be inserted into this list. |
239 |
< |
* @return <tt>true</tt> if this list changed as a result of the call. |
240 |
< |
* @throws NullPointerException if the specified collection is null. |
238 |
> |
* @param c collection containing elements to be added to this list |
239 |
> |
* @return <tt>true</tt> if this list changed as a result of the call |
240 |
> |
* @throws NullPointerException if the specified collection is null |
241 |
|
*/ |
242 |
|
public boolean addAll(Collection<? extends E> c) { |
243 |
|
return addAll(size, c); |
251 |
|
* in the list in the order that they are returned by the |
252 |
|
* specified collection's iterator. |
253 |
|
* |
254 |
< |
* @param index index at which to insert first element |
255 |
< |
* from the specified collection. |
256 |
< |
* @param c elements to be inserted into this list. |
257 |
< |
* @return <tt>true</tt> if this list changed as a result of the call. |
258 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
259 |
< |
* (<tt>index < 0 || index > size()</tt>). |
258 |
< |
* @throws NullPointerException if the specified collection is null. |
254 |
> |
* @param index index at which to insert the first element |
255 |
> |
* from the specified collection |
256 |
> |
* @param c collection containing elements to be added to this list |
257 |
> |
* @return <tt>true</tt> if this list changed as a result of the call |
258 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
259 |
> |
* @throws NullPointerException if the specified collection is null |
260 |
|
*/ |
261 |
|
public boolean addAll(int index, Collection<? extends E> c) { |
262 |
|
if (index < 0 || index > size) |
303 |
|
/** |
304 |
|
* Returns the element at the specified position in this list. |
305 |
|
* |
306 |
< |
* @param index index of element to return. |
307 |
< |
* @return the element at the specified position in this list. |
308 |
< |
* |
308 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
309 |
< |
* (<tt>index < 0 || index > size()</tt>). |
306 |
> |
* @param index index of the element to return |
307 |
> |
* @return the element at the specified position in this list |
308 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
309 |
|
*/ |
310 |
|
public E get(int index) { |
311 |
|
return entry(index).element; |
315 |
|
* Replaces the element at the specified position in this list with the |
316 |
|
* specified element. |
317 |
|
* |
318 |
< |
* @param index index of element to replace. |
319 |
< |
* @param element element to be stored at the specified position. |
320 |
< |
* @return the element previously at the specified position. |
321 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
323 |
< |
* (<tt>index < 0 || index > size()</tt>). |
318 |
> |
* @param index index of the element to replace |
319 |
> |
* @param element element to be stored at the specified position |
320 |
> |
* @return the element previously at the specified position |
321 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
322 |
|
*/ |
323 |
|
public E set(int index, E element) { |
324 |
|
Entry<E> e = entry(index); |
332 |
|
* Shifts the element currently at that position (if any) and any |
333 |
|
* subsequent elements to the right (adds one to their indices). |
334 |
|
* |
335 |
< |
* @param index index at which the specified element is to be inserted. |
336 |
< |
* @param element element to be inserted. |
337 |
< |
* |
340 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
341 |
< |
* (<tt>index < 0 || index > size()</tt>). |
335 |
> |
* @param index index at which the specified element is to be inserted |
336 |
> |
* @param element element to be inserted |
337 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
338 |
|
*/ |
339 |
|
public void add(int index, E element) { |
340 |
|
addBefore(element, (index==size ? header : entry(index))); |
345 |
|
* subsequent elements to the left (subtracts one from their indices). |
346 |
|
* Returns the element that was removed from the list. |
347 |
|
* |
348 |
< |
* @param index the index of the element to removed. |
349 |
< |
* @return the element previously at the specified position. |
350 |
< |
* |
355 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
356 |
< |
* (<tt>index < 0 || index > size()</tt>). |
348 |
> |
* @param index the index of the element to be removed |
349 |
> |
* @return the element previously at the specified position |
350 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
351 |
|
*/ |
352 |
|
public E remove(int index) { |
353 |
|
return remove(entry(index)); |
375 |
|
// Search Operations |
376 |
|
|
377 |
|
/** |
378 |
< |
* Returns the index in this list of the first occurrence of the |
379 |
< |
* specified element, or -1 if the List does not contain this |
380 |
< |
* element. More formally, returns the lowest index i such that |
381 |
< |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, or -1 if |
382 |
< |
* there is no such index. |
383 |
< |
* |
384 |
< |
* @param o element to search for. |
385 |
< |
* @return the index in this list of the first occurrence of the |
386 |
< |
* specified element, or -1 if the list does not contain this |
393 |
< |
* element. |
378 |
> |
* Returns the index of the first occurrence of the specified element |
379 |
> |
* in this list, or -1 if this list does not contain the element. |
380 |
> |
* More formally, returns the lowest index <tt>i</tt> such that |
381 |
> |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, |
382 |
> |
* or -1 if there is no such index. |
383 |
> |
* |
384 |
> |
* @param o element to search for |
385 |
> |
* @return the index of the first occurrence of the specified element in |
386 |
> |
* this list, or -1 if this list does not contain the element |
387 |
|
*/ |
388 |
|
public int indexOf(Object o) { |
389 |
|
int index = 0; |
404 |
|
} |
405 |
|
|
406 |
|
/** |
407 |
< |
* Returns the index in this list of the last occurrence of the |
408 |
< |
* specified element, or -1 if the list does not contain this |
409 |
< |
* element. More formally, returns the highest index i such that |
410 |
< |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, or -1 if |
411 |
< |
* there is no such index. |
412 |
< |
* |
413 |
< |
* @param o element to search for. |
414 |
< |
* @return the index in this list of the last occurrence of the |
415 |
< |
* specified element, or -1 if the list does not contain this |
423 |
< |
* element. |
407 |
> |
* Returns the index of the last occurrence of the specified element |
408 |
> |
* in this list, or -1 if this list does not contain the element. |
409 |
> |
* More formally, returns the highest index <tt>i</tt> such that |
410 |
> |
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, |
411 |
> |
* or -1 if there is no such index. |
412 |
> |
* |
413 |
> |
* @param o element to search for |
414 |
> |
* @return the index of the last occurrence of the specified element in |
415 |
> |
* this list, or -1 if this list does not contain the element |
416 |
|
*/ |
417 |
|
public int lastIndexOf(Object o) { |
418 |
|
int index = size; |
436 |
|
|
437 |
|
/** |
438 |
|
* Retrieves, but does not remove, the head (first element) of this list. |
439 |
< |
* @return the head of this list, or <tt>null</tt> if this list is empty. |
439 |
> |
* @return the head of this list, or <tt>null</tt> if this list is empty |
440 |
|
* @since 1.5 |
441 |
|
*/ |
442 |
|
public E peek() { |
447 |
|
|
448 |
|
/** |
449 |
|
* Retrieves, but does not remove, the head (first element) of this list. |
450 |
< |
* @return the head of this list. |
451 |
< |
* @throws NoSuchElementException if this list is empty. |
450 |
> |
* @return the head of this list |
451 |
> |
* @throws NoSuchElementException if this list is empty |
452 |
|
* @since 1.5 |
453 |
|
*/ |
454 |
|
public E element() { |
456 |
|
} |
457 |
|
|
458 |
|
/** |
459 |
< |
* Retrieves and removes the head (first element) of this list. |
460 |
< |
* @return the head of this list, or <tt>null</tt> if this list is empty. |
459 |
> |
* Retrieves and removes the head (first element) of this list |
460 |
> |
* @return the head of this list, or <tt>null</tt> if this list is empty |
461 |
|
* @since 1.5 |
462 |
|
*/ |
463 |
|
public E poll() { |
468 |
|
|
469 |
|
/** |
470 |
|
* Retrieves and removes the head (first element) of this list. |
471 |
< |
* @return the head of this list. |
472 |
< |
* @throws NoSuchElementException if this list is empty. |
471 |
> |
* |
472 |
> |
* @return the head of this list |
473 |
> |
* @throws NoSuchElementException if this list is empty |
474 |
|
* @since 1.5 |
475 |
|
*/ |
476 |
|
public E remove() { |
480 |
|
/** |
481 |
|
* Adds the specified element as the tail (last element) of this list. |
482 |
|
* |
483 |
< |
* @param o the element to add. |
484 |
< |
* @return <tt>true</tt> (as per the general contract of |
492 |
< |
* <tt>Queue.offer</tt>) |
483 |
> |
* @param e the element to add |
484 |
> |
* @return <tt>true</tt> (as per the spec for {@link Queue#offer}) |
485 |
|
* @since 1.5 |
486 |
|
*/ |
487 |
< |
public boolean offer(E o) { |
488 |
< |
return add(o); |
487 |
> |
public boolean offer(E e) { |
488 |
> |
return add(e); |
489 |
|
} |
490 |
|
|
491 |
|
// Deque operations |
515 |
|
|
516 |
|
/** |
517 |
|
* Retrieves, but does not remove, the first element of this list, |
518 |
< |
* returning <tt>null</tt> if this list is empty. |
518 |
> |
* or returns <tt>null</tt> if this list is empty. |
519 |
|
* |
520 |
< |
* @return the first element of this list, or <tt>null</tt> if |
521 |
< |
* this list is empty |
520 |
> |
* @return the first element of this list, or <tt>null</tt> |
521 |
> |
* if this list is empty |
522 |
|
* @since 1.6 |
523 |
|
*/ |
524 |
|
public E peekFirst() { |
529 |
|
|
530 |
|
/** |
531 |
|
* Retrieves, but does not remove, the last element of this list, |
532 |
< |
* returning <tt>null</tt> if this list is empty. |
532 |
> |
* or returns <tt>null</tt> if this list is empty. |
533 |
|
* |
534 |
< |
* @return the last element of this list, or <tt>null</tt> if this list |
535 |
< |
* is empty |
534 |
> |
* @return the last element of this list, or <tt>null</tt> |
535 |
> |
* if this list is empty |
536 |
|
* @since 1.6 |
537 |
|
*/ |
538 |
|
public E peekLast() { |
589 |
|
* <p>This method is equivalent to {@link #removeFirst()}. |
590 |
|
* |
591 |
|
* @return the element at the front of this list (which is the top |
592 |
< |
* of the stack represented by this list) |
593 |
< |
* @throws NoSuchElementException if this list is empty. |
592 |
> |
* of the stack represented by this list) |
593 |
> |
* @throws NoSuchElementException if this list is empty |
594 |
|
* @since 1.6 |
595 |
|
*/ |
596 |
|
public E pop() { |
652 |
|
* than risking arbitrary, non-deterministic behavior at an undetermined |
653 |
|
* time in the future. |
654 |
|
* |
655 |
< |
* @param index index of first element to be returned from the |
656 |
< |
* list-iterator (by a call to <tt>next</tt>). |
655 |
> |
* @param index index of the first element to be returned from the |
656 |
> |
* list-iterator (by a call to <tt>next</tt>) |
657 |
|
* @return a ListIterator of the elements in this list (in proper |
658 |
< |
* sequence), starting at the specified position in the list. |
659 |
< |
* @throws IndexOutOfBoundsException if the index is out of range |
668 |
< |
* (<tt>index < 0 || index > size()</tt>). |
658 |
> |
* sequence), starting at the specified position in the list |
659 |
> |
* @throws IndexOutOfBoundsException {@inheritDoc} |
660 |
|
* @see List#listIterator(int) |
661 |
|
*/ |
662 |
|
public ListIterator<E> listIterator(int index) { |
737 |
|
expectedModCount++; |
738 |
|
} |
739 |
|
|
740 |
< |
public void set(E o) { |
740 |
> |
public void set(E e) { |
741 |
|
if (lastReturned == header) |
742 |
|
throw new IllegalStateException(); |
743 |
|
checkForComodification(); |
744 |
< |
lastReturned.element = o; |
744 |
> |
lastReturned.element = e; |
745 |
|
} |
746 |
|
|
747 |
< |
public void add(E o) { |
747 |
> |
public void add(E e) { |
748 |
|
checkForComodification(); |
749 |
|
lastReturned = header; |
750 |
< |
addBefore(o, next); |
750 |
> |
addBefore(e, next); |
751 |
|
nextIndex++; |
752 |
|
expectedModCount++; |
753 |
|
} |
770 |
|
} |
771 |
|
} |
772 |
|
|
773 |
< |
private Entry<E> addBefore(E o, Entry<E> e) { |
774 |
< |
Entry<E> newEntry = new Entry<E>(o, e, e.previous); |
773 |
> |
private Entry<E> addBefore(E e, Entry<E> entry) { |
774 |
> |
Entry<E> newEntry = new Entry<E>(e, entry, entry.previous); |
775 |
|
newEntry.previous.next = newEntry; |
776 |
|
newEntry.next.previous = newEntry; |
777 |
|
size++; |
797 |
|
* Returns a shallow copy of this <tt>LinkedList</tt>. (The elements |
798 |
|
* themselves are not cloned.) |
799 |
|
* |
800 |
< |
* @return a shallow copy of this <tt>LinkedList</tt> instance. |
800 |
> |
* @return a shallow copy of this <tt>LinkedList</tt> instance |
801 |
|
*/ |
802 |
|
public Object clone() { |
803 |
|
LinkedList<E> clone = null; |
822 |
|
|
823 |
|
/** |
824 |
|
* Returns an array containing all of the elements in this list |
825 |
< |
* in the correct order. |
825 |
> |
* in proper sequence (from first to last element). |
826 |
> |
* |
827 |
> |
* <p>The returned array will be "safe" in that no references to it are |
828 |
> |
* maintained by this list. (In other words, this method must allocate |
829 |
> |
* a new array). The caller is thus free to modify the returned array. |
830 |
> |
* |
831 |
> |
* <p>This method acts as bridge between array-based and collection-based |
832 |
> |
* APIs. |
833 |
|
* |
834 |
|
* @return an array containing all of the elements in this list |
835 |
< |
* in the correct order. |
835 |
> |
* in proper sequence |
836 |
|
*/ |
837 |
|
public Object[] toArray() { |
838 |
|
Object[] result = new Object[size]; |
844 |
|
|
845 |
|
/** |
846 |
|
* Returns an array containing all of the elements in this list in |
847 |
< |
* the correct order; the runtime type of the returned array is that of |
848 |
< |
* the specified array. If the list fits in the specified array, it |
849 |
< |
* is returned therein. Otherwise, a new array is allocated with the |
850 |
< |
* runtime type of the specified array and the size of this list.<p> |
851 |
< |
* |
852 |
< |
* If the list fits in the specified array with room to spare |
853 |
< |
* (i.e., the array has more elements than the list), |
854 |
< |
* the element in the array immediately following the end of the |
855 |
< |
* collection is set to null. This is useful in determining the length |
856 |
< |
* of the list <i>only</i> if the caller knows that the list |
857 |
< |
* does not contain any null elements. |
847 |
> |
* proper sequence (from first to last element); the runtime type of |
848 |
> |
* the returned array is that of the specified array. If the list fits |
849 |
> |
* in the specified array, it is returned therein. Otherwise, a new |
850 |
> |
* array is allocated with the runtime type of the specified array and |
851 |
> |
* the size of this list. |
852 |
> |
* |
853 |
> |
* <p>If the list fits in the specified array with room to spare (i.e., |
854 |
> |
* the array has more elements than the list), the element in the array |
855 |
> |
* immediately following the end of the list is set to <tt>null</tt>. |
856 |
> |
* (This is useful in determining the length of the list <i>only</i> if |
857 |
> |
* the caller knows that the list does not contain any null elements.) |
858 |
> |
* |
859 |
> |
* <p>Like the {@link #toArray()} method, this method acts as bridge between |
860 |
> |
* array-based and collection-based APIs. Further, this method allows |
861 |
> |
* precise control over the runtime type of the output array, and may, |
862 |
> |
* under certain circumstances, be used to save allocation costs. |
863 |
> |
* |
864 |
> |
* <p>Suppose <tt>x</tt> is a list known to contain only strings. |
865 |
> |
* The following code can be used to dump the list into a newly |
866 |
> |
* allocated array of <tt>String</tt>: |
867 |
> |
* |
868 |
> |
* <pre> |
869 |
> |
* String[] y = x.toArray(new String[0]);</pre> |
870 |
> |
* |
871 |
> |
* Note that <tt>toArray(new Object[0])</tt> is identical in function to |
872 |
> |
* <tt>toArray()</tt>. |
873 |
|
* |
874 |
|
* @param a the array into which the elements of the list are to |
875 |
< |
* be stored, if it is big enough; otherwise, a new array of the |
876 |
< |
* same runtime type is allocated for this purpose. |
877 |
< |
* @return an array containing the elements of the list. |
878 |
< |
* @throws ArrayStoreException if the runtime type of a is not a |
879 |
< |
* supertype of the runtime type of every element in this list. |
880 |
< |
* @throws NullPointerException if the specified array is null. |
875 |
> |
* be stored, if it is big enough; otherwise, a new array of the |
876 |
> |
* same runtime type is allocated for this purpose. |
877 |
> |
* @return an array containing the elements of the list |
878 |
> |
* @throws ArrayStoreException if the runtime type of the specified array |
879 |
> |
* is not a supertype of the runtime type of every element in |
880 |
> |
* this list |
881 |
> |
* @throws NullPointerException if the specified array is null |
882 |
|
*/ |
883 |
|
public <T> T[] toArray(T[] a) { |
884 |
|
if (a.length < size) |
902 |
|
* is, serialize it). |
903 |
|
* |
904 |
|
* @serialData The size of the list (the number of elements it |
905 |
< |
* contains) is emitted (int), followed by all of its |
906 |
< |
* elements (each an Object) in the proper order. |
905 |
> |
* contains) is emitted (int), followed by all of its |
906 |
> |
* elements (each an Object) in the proper order. |
907 |
|
*/ |
908 |
|
private void writeObject(java.io.ObjectOutputStream s) |
909 |
|
throws java.io.IOException { |