1 |
tim |
1.1 |
/* |
2 |
dl |
1.6 |
* %W% %E% |
3 |
tim |
1.1 |
* |
4 |
dl |
1.3 |
* Copyright 2003 Sun Microsystems, Inc. All rights reserved. |
5 |
tim |
1.1 |
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. |
6 |
|
|
*/ |
7 |
|
|
|
8 |
|
|
package java.util; |
9 |
|
|
|
10 |
|
|
/** |
11 |
|
|
* Linked list implementation of the <tt>List</tt> interface. Implements all |
12 |
|
|
* optional list operations, and permits all elements (including |
13 |
|
|
* <tt>null</tt>). In addition to implementing the <tt>List</tt> interface, |
14 |
|
|
* the <tt>LinkedList</tt> class provides uniformly named methods to |
15 |
|
|
* <tt>get</tt>, <tt>remove</tt> and <tt>insert</tt> an element at the |
16 |
|
|
* beginning and end of the list. These operations allow linked lists to be |
17 |
|
|
* used as a stack, queue, or double-ended queue (deque).<p> |
18 |
|
|
* |
19 |
dl |
1.3 |
* The class implements the <tt>Queue</tt> interface, providing |
20 |
|
|
* first-in-first-out queue operations for <tt>add</tt>, |
21 |
|
|
* <tt>poll</tt>, etc. Other stack and deque operations could be |
22 |
|
|
* easily recast in terms of the standard list operations. They're |
23 |
|
|
* included here primarily for convenience, though they may run |
24 |
|
|
* slightly faster than the equivalent List operations.<p> |
25 |
tim |
1.1 |
* |
26 |
|
|
* All of the operations perform as could be expected for a doubly-linked |
27 |
|
|
* list. Operations that index into the list will traverse the list from |
28 |
dl |
1.8 |
* the beginning or the end, whichever is closer to the specified index.<p> |
29 |
tim |
1.1 |
* |
30 |
|
|
* <b>Note that this implementation is not synchronized.</b> If multiple |
31 |
|
|
* threads access a list concurrently, and at least one of the threads |
32 |
|
|
* modifies the list structurally, it <i>must</i> be synchronized |
33 |
|
|
* externally. (A structural modification is any operation that adds or |
34 |
|
|
* deletes one or more elements; merely setting the value of an element is not |
35 |
|
|
* a structural modification.) This is typically accomplished by |
36 |
|
|
* synchronizing on some object that naturally encapsulates the list. If no |
37 |
|
|
* such object exists, the list should be "wrapped" using the |
38 |
|
|
* Collections.synchronizedList method. This is best done at creation time, |
39 |
|
|
* to prevent accidental unsynchronized access to the list: <pre> |
40 |
|
|
* List list = Collections.synchronizedList(new LinkedList(...)); |
41 |
|
|
* </pre><p> |
42 |
|
|
* |
43 |
|
|
* The iterators returned by the this class's <tt>iterator</tt> and |
44 |
|
|
* <tt>listIterator</tt> methods are <i>fail-fast</i>: if the list is |
45 |
|
|
* structurally modified at any time after the iterator is created, in any way |
46 |
|
|
* except through the Iterator's own <tt>remove</tt> or <tt>add</tt> methods, |
47 |
|
|
* the iterator will throw a <tt>ConcurrentModificationException</tt>. Thus, |
48 |
|
|
* in the face of concurrent modification, the iterator fails quickly and |
49 |
|
|
* cleanly, rather than risking arbitrary, non-deterministic behavior at an |
50 |
|
|
* undetermined time in the future. |
51 |
|
|
* |
52 |
|
|
* <p>Note that the fail-fast behavior of an iterator cannot be guaranteed |
53 |
|
|
* as it is, generally speaking, impossible to make any hard guarantees in the |
54 |
|
|
* presence of unsynchronized concurrent modification. Fail-fast iterators |
55 |
dl |
1.3 |
* throw <tt>ConcurrentModificationException</tt> on a best-effort basis. |
56 |
tim |
1.1 |
* Therefore, it would be wrong to write a program that depended on this |
57 |
|
|
* exception for its correctness: <i>the fail-fast behavior of iterators |
58 |
dl |
1.3 |
* should be used only to detect bugs.</i><p> |
59 |
|
|
* |
60 |
|
|
* This class is a member of the |
61 |
|
|
* <a href="{@docRoot}/../guide/collections/index.html"> |
62 |
|
|
* Java Collections Framework</a>. |
63 |
tim |
1.1 |
* |
64 |
|
|
* @author Josh Bloch |
65 |
dl |
1.6 |
* @version %I%, %G% |
66 |
dl |
1.3 |
* @see List |
67 |
|
|
* @see ArrayList |
68 |
|
|
* @see Vector |
69 |
|
|
* @see Collections#synchronizedList(List) |
70 |
tim |
1.1 |
* @since 1.2 |
71 |
dl |
1.10 |
* @param <E> the type of elements held in this collection |
72 |
tim |
1.1 |
*/ |
73 |
|
|
|
74 |
dl |
1.3 |
public class LinkedList<E> |
75 |
|
|
extends AbstractSequentialList<E> |
76 |
|
|
implements List<E>, Queue<E>, Cloneable, java.io.Serializable |
77 |
tim |
1.1 |
{ |
78 |
dl |
1.3 |
private transient Entry<E> header = new Entry<E>(null, null, null); |
79 |
tim |
1.1 |
private transient int size = 0; |
80 |
|
|
|
81 |
|
|
/** |
82 |
|
|
* Constructs an empty list. |
83 |
|
|
*/ |
84 |
|
|
public LinkedList() { |
85 |
|
|
header.next = header.previous = header; |
86 |
|
|
} |
87 |
|
|
|
88 |
|
|
/** |
89 |
|
|
* Constructs a list containing the elements of the specified |
90 |
|
|
* collection, in the order they are returned by the collection's |
91 |
|
|
* iterator. |
92 |
|
|
* |
93 |
|
|
* @param c the collection whose elements are to be placed into this list. |
94 |
|
|
* @throws NullPointerException if the specified collection is null. |
95 |
|
|
*/ |
96 |
dl |
1.3 |
public LinkedList(Collection<? extends E> c) { |
97 |
|
|
this(); |
98 |
|
|
addAll(c); |
99 |
tim |
1.1 |
} |
100 |
|
|
|
101 |
|
|
/** |
102 |
|
|
* Returns the first element in this list. |
103 |
|
|
* |
104 |
|
|
* @return the first element in this list. |
105 |
|
|
* @throws NoSuchElementException if this list is empty. |
106 |
|
|
*/ |
107 |
dl |
1.3 |
public E getFirst() { |
108 |
|
|
if (size==0) |
109 |
|
|
throw new NoSuchElementException(); |
110 |
tim |
1.1 |
|
111 |
dl |
1.3 |
return header.next.element; |
112 |
tim |
1.1 |
} |
113 |
|
|
|
114 |
|
|
/** |
115 |
|
|
* Returns the last element in this list. |
116 |
|
|
* |
117 |
|
|
* @return the last element in this list. |
118 |
|
|
* @throws NoSuchElementException if this list is empty. |
119 |
|
|
*/ |
120 |
dl |
1.3 |
public E getLast() { |
121 |
|
|
if (size==0) |
122 |
|
|
throw new NoSuchElementException(); |
123 |
tim |
1.1 |
|
124 |
dl |
1.3 |
return header.previous.element; |
125 |
tim |
1.1 |
} |
126 |
|
|
|
127 |
|
|
/** |
128 |
|
|
* Removes and returns the first element from this list. |
129 |
|
|
* |
130 |
|
|
* @return the first element from this list. |
131 |
|
|
* @throws NoSuchElementException if this list is empty. |
132 |
|
|
*/ |
133 |
dl |
1.3 |
public E removeFirst() { |
134 |
|
|
E first = header.next.element; |
135 |
|
|
remove(header.next); |
136 |
|
|
return first; |
137 |
tim |
1.1 |
} |
138 |
|
|
|
139 |
|
|
/** |
140 |
|
|
* Removes and returns the last element from this list. |
141 |
|
|
* |
142 |
|
|
* @return the last element from this list. |
143 |
|
|
* @throws NoSuchElementException if this list is empty. |
144 |
|
|
*/ |
145 |
dl |
1.3 |
public E removeLast() { |
146 |
|
|
E last = header.previous.element; |
147 |
|
|
remove(header.previous); |
148 |
|
|
return last; |
149 |
tim |
1.1 |
} |
150 |
|
|
|
151 |
|
|
/** |
152 |
|
|
* Inserts the given element at the beginning of this list. |
153 |
dl |
1.3 |
* |
154 |
tim |
1.1 |
* @param o the element to be inserted at the beginning of this list. |
155 |
|
|
*/ |
156 |
dl |
1.3 |
public void addFirst(E o) { |
157 |
|
|
addBefore(o, header.next); |
158 |
tim |
1.1 |
} |
159 |
|
|
|
160 |
|
|
/** |
161 |
|
|
* Appends the given element to the end of this list. (Identical in |
162 |
|
|
* function to the <tt>add</tt> method; included only for consistency.) |
163 |
dl |
1.3 |
* |
164 |
tim |
1.1 |
* @param o the element to be inserted at the end of this list. |
165 |
|
|
*/ |
166 |
dl |
1.3 |
public void addLast(E o) { |
167 |
|
|
addBefore(o, header); |
168 |
tim |
1.1 |
} |
169 |
|
|
|
170 |
|
|
/** |
171 |
|
|
* Returns <tt>true</tt> if this list contains the specified element. |
172 |
|
|
* More formally, returns <tt>true</tt> if and only if this list contains |
173 |
|
|
* at least one element <tt>e</tt> such that <tt>(o==null ? e==null |
174 |
|
|
* : o.equals(e))</tt>. |
175 |
|
|
* |
176 |
|
|
* @param o element whose presence in this list is to be tested. |
177 |
|
|
* @return <tt>true</tt> if this list contains the specified element. |
178 |
|
|
*/ |
179 |
|
|
public boolean contains(Object o) { |
180 |
|
|
return indexOf(o) != -1; |
181 |
|
|
} |
182 |
|
|
|
183 |
|
|
/** |
184 |
|
|
* Returns the number of elements in this list. |
185 |
|
|
* |
186 |
|
|
* @return the number of elements in this list. |
187 |
|
|
*/ |
188 |
|
|
public int size() { |
189 |
dl |
1.3 |
return size; |
190 |
tim |
1.1 |
} |
191 |
|
|
|
192 |
|
|
/** |
193 |
|
|
* Appends the specified element to the end of this list. |
194 |
|
|
* |
195 |
|
|
* @param o element to be appended to this list. |
196 |
|
|
* @return <tt>true</tt> (as per the general contract of |
197 |
|
|
* <tt>Collection.add</tt>). |
198 |
|
|
*/ |
199 |
dl |
1.3 |
public boolean add(E o) { |
200 |
|
|
addBefore(o, header); |
201 |
tim |
1.1 |
return true; |
202 |
|
|
} |
203 |
|
|
|
204 |
|
|
/** |
205 |
|
|
* Removes the first occurrence of the specified element in this list. If |
206 |
|
|
* the list does not contain the element, it is unchanged. More formally, |
207 |
|
|
* removes the element with the lowest index <tt>i</tt> such that |
208 |
|
|
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt> (if such an |
209 |
|
|
* element exists). |
210 |
|
|
* |
211 |
|
|
* @param o element to be removed from this list, if present. |
212 |
|
|
* @return <tt>true</tt> if the list contained the specified element. |
213 |
|
|
*/ |
214 |
|
|
public boolean remove(Object o) { |
215 |
|
|
if (o==null) { |
216 |
dl |
1.3 |
for (Entry<E> e = header.next; e != header; e = e.next) { |
217 |
tim |
1.1 |
if (e.element==null) { |
218 |
|
|
remove(e); |
219 |
|
|
return true; |
220 |
|
|
} |
221 |
|
|
} |
222 |
|
|
} else { |
223 |
dl |
1.3 |
for (Entry<E> e = header.next; e != header; e = e.next) { |
224 |
tim |
1.1 |
if (o.equals(e.element)) { |
225 |
|
|
remove(e); |
226 |
|
|
return true; |
227 |
|
|
} |
228 |
|
|
} |
229 |
|
|
} |
230 |
|
|
return false; |
231 |
|
|
} |
232 |
|
|
|
233 |
|
|
/** |
234 |
|
|
* Appends all of the elements in the specified collection to the end of |
235 |
|
|
* this list, in the order that they are returned by the specified |
236 |
|
|
* collection's iterator. The behavior of this operation is undefined if |
237 |
|
|
* the specified collection is modified while the operation is in |
238 |
|
|
* progress. (This implies that the behavior of this call is undefined if |
239 |
|
|
* the specified Collection is this list, and this list is nonempty.) |
240 |
|
|
* |
241 |
|
|
* @param c the elements to be inserted into this list. |
242 |
|
|
* @return <tt>true</tt> if this list changed as a result of the call. |
243 |
|
|
* @throws NullPointerException if the specified collection is null. |
244 |
|
|
*/ |
245 |
dl |
1.3 |
public boolean addAll(Collection<? extends E> c) { |
246 |
tim |
1.1 |
return addAll(size, c); |
247 |
|
|
} |
248 |
|
|
|
249 |
|
|
/** |
250 |
|
|
* Inserts all of the elements in the specified collection into this |
251 |
|
|
* list, starting at the specified position. Shifts the element |
252 |
|
|
* currently at that position (if any) and any subsequent elements to |
253 |
|
|
* the right (increases their indices). The new elements will appear |
254 |
|
|
* in the list in the order that they are returned by the |
255 |
|
|
* specified collection's iterator. |
256 |
|
|
* |
257 |
|
|
* @param index index at which to insert first element |
258 |
dl |
1.3 |
* from the specified collection. |
259 |
tim |
1.1 |
* @param c elements to be inserted into this list. |
260 |
|
|
* @return <tt>true</tt> if this list changed as a result of the call. |
261 |
|
|
* @throws IndexOutOfBoundsException if the specified index is out of |
262 |
|
|
* range (<tt>index < 0 || index > size()</tt>). |
263 |
|
|
* @throws NullPointerException if the specified collection is null. |
264 |
|
|
*/ |
265 |
dl |
1.3 |
public boolean addAll(int index, Collection<? extends E> c) { |
266 |
dl |
1.4 |
if (index < 0 || index > size) |
267 |
dl |
1.3 |
throw new IndexOutOfBoundsException("Index: "+index+ |
268 |
|
|
", Size: "+size); |
269 |
|
|
Object[] a = c.toArray(); |
270 |
|
|
int numNew = a.length; |
271 |
|
|
if (numNew==0) |
272 |
|
|
return false; |
273 |
|
|
modCount++; |
274 |
|
|
|
275 |
|
|
Entry<E> successor = (index==size ? header : entry(index)); |
276 |
|
|
Entry<E> predecessor = successor.previous; |
277 |
|
|
for (int i=0; i<numNew; i++) { |
278 |
|
|
Entry<E> e = new Entry<E>((E)a[i], successor, predecessor); |
279 |
tim |
1.1 |
predecessor.next = e; |
280 |
|
|
predecessor = e; |
281 |
|
|
} |
282 |
|
|
successor.previous = predecessor; |
283 |
|
|
|
284 |
|
|
size += numNew; |
285 |
|
|
return true; |
286 |
|
|
} |
287 |
|
|
|
288 |
|
|
/** |
289 |
|
|
* Removes all of the elements from this list. |
290 |
|
|
*/ |
291 |
|
|
public void clear() { |
292 |
dl |
1.3 |
modCount++; |
293 |
tim |
1.1 |
header.next = header.previous = header; |
294 |
dl |
1.3 |
size = 0; |
295 |
tim |
1.1 |
} |
296 |
|
|
|
297 |
|
|
|
298 |
|
|
// Positional Access Operations |
299 |
|
|
|
300 |
|
|
/** |
301 |
|
|
* Returns the element at the specified position in this list. |
302 |
|
|
* |
303 |
|
|
* @param index index of element to return. |
304 |
|
|
* @return the element at the specified position in this list. |
305 |
dl |
1.3 |
* |
306 |
tim |
1.1 |
* @throws IndexOutOfBoundsException if the specified index is is out of |
307 |
|
|
* range (<tt>index < 0 || index >= size()</tt>). |
308 |
|
|
*/ |
309 |
dl |
1.3 |
public E get(int index) { |
310 |
tim |
1.1 |
return entry(index).element; |
311 |
|
|
} |
312 |
|
|
|
313 |
|
|
/** |
314 |
|
|
* Replaces the element at the specified position in this list with the |
315 |
|
|
* specified element. |
316 |
|
|
* |
317 |
|
|
* @param index index of element to replace. |
318 |
|
|
* @param element element to be stored at the specified position. |
319 |
|
|
* @return the element previously at the specified position. |
320 |
|
|
* @throws IndexOutOfBoundsException if the specified index is out of |
321 |
dl |
1.3 |
* range (<tt>index < 0 || index >= size()</tt>). |
322 |
tim |
1.1 |
*/ |
323 |
dl |
1.3 |
public E set(int index, E element) { |
324 |
|
|
Entry<E> e = entry(index); |
325 |
|
|
E oldVal = e.element; |
326 |
tim |
1.1 |
e.element = element; |
327 |
|
|
return oldVal; |
328 |
|
|
} |
329 |
|
|
|
330 |
|
|
/** |
331 |
|
|
* Inserts the specified element at the specified position in this list. |
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 |
dl |
1.3 |
* |
338 |
tim |
1.1 |
* @throws IndexOutOfBoundsException if the specified index is out of |
339 |
dl |
1.3 |
* range (<tt>index < 0 || index > size()</tt>). |
340 |
tim |
1.1 |
*/ |
341 |
dl |
1.3 |
public void add(int index, E element) { |
342 |
tim |
1.1 |
addBefore(element, (index==size ? header : entry(index))); |
343 |
|
|
} |
344 |
|
|
|
345 |
|
|
/** |
346 |
|
|
* Removes the element at the specified position in this list. Shifts any |
347 |
|
|
* subsequent elements to the left (subtracts one from their indices). |
348 |
|
|
* Returns the element that was removed from the list. |
349 |
|
|
* |
350 |
|
|
* @param index the index of the element to removed. |
351 |
|
|
* @return the element previously at the specified position. |
352 |
dl |
1.3 |
* |
353 |
tim |
1.1 |
* @throws IndexOutOfBoundsException if the specified index is out of |
354 |
dl |
1.3 |
* range (<tt>index < 0 || index >= size()</tt>). |
355 |
tim |
1.1 |
*/ |
356 |
dl |
1.3 |
public E remove(int index) { |
357 |
|
|
Entry<E> e = entry(index); |
358 |
tim |
1.1 |
remove(e); |
359 |
|
|
return e.element; |
360 |
|
|
} |
361 |
|
|
|
362 |
|
|
/** |
363 |
|
|
* Return the indexed entry. |
364 |
|
|
*/ |
365 |
dl |
1.3 |
private Entry<E> entry(int index) { |
366 |
tim |
1.1 |
if (index < 0 || index >= size) |
367 |
|
|
throw new IndexOutOfBoundsException("Index: "+index+ |
368 |
|
|
", Size: "+size); |
369 |
dl |
1.3 |
Entry<E> e = header; |
370 |
tim |
1.1 |
if (index < (size >> 1)) { |
371 |
|
|
for (int i = 0; i <= index; i++) |
372 |
|
|
e = e.next; |
373 |
|
|
} else { |
374 |
|
|
for (int i = size; i > index; i--) |
375 |
|
|
e = e.previous; |
376 |
|
|
} |
377 |
|
|
return e; |
378 |
|
|
} |
379 |
|
|
|
380 |
|
|
|
381 |
|
|
// Search Operations |
382 |
|
|
|
383 |
|
|
/** |
384 |
|
|
* Returns the index in this list of the first occurrence of the |
385 |
|
|
* specified element, or -1 if the List does not contain this |
386 |
|
|
* element. More formally, returns the lowest index i such that |
387 |
|
|
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, or -1 if |
388 |
|
|
* there is no such index. |
389 |
|
|
* |
390 |
|
|
* @param o element to search for. |
391 |
|
|
* @return the index in this list of the first occurrence of the |
392 |
dl |
1.3 |
* specified element, or -1 if the list does not contain this |
393 |
|
|
* element. |
394 |
tim |
1.1 |
*/ |
395 |
|
|
public int indexOf(Object o) { |
396 |
|
|
int index = 0; |
397 |
|
|
if (o==null) { |
398 |
|
|
for (Entry e = header.next; e != header; e = e.next) { |
399 |
|
|
if (e.element==null) |
400 |
|
|
return index; |
401 |
|
|
index++; |
402 |
|
|
} |
403 |
|
|
} else { |
404 |
|
|
for (Entry e = header.next; e != header; e = e.next) { |
405 |
|
|
if (o.equals(e.element)) |
406 |
|
|
return index; |
407 |
|
|
index++; |
408 |
|
|
} |
409 |
|
|
} |
410 |
|
|
return -1; |
411 |
|
|
} |
412 |
|
|
|
413 |
|
|
/** |
414 |
|
|
* Returns the index in this list of the last occurrence of the |
415 |
|
|
* specified element, or -1 if the list does not contain this |
416 |
|
|
* element. More formally, returns the highest index i such that |
417 |
|
|
* <tt>(o==null ? get(i)==null : o.equals(get(i)))</tt>, or -1 if |
418 |
|
|
* there is no such index. |
419 |
|
|
* |
420 |
|
|
* @param o element to search for. |
421 |
|
|
* @return the index in this list of the last occurrence of the |
422 |
dl |
1.3 |
* specified element, or -1 if the list does not contain this |
423 |
|
|
* element. |
424 |
tim |
1.1 |
*/ |
425 |
|
|
public int lastIndexOf(Object o) { |
426 |
|
|
int index = size; |
427 |
|
|
if (o==null) { |
428 |
|
|
for (Entry e = header.previous; e != header; e = e.previous) { |
429 |
|
|
index--; |
430 |
|
|
if (e.element==null) |
431 |
|
|
return index; |
432 |
|
|
} |
433 |
|
|
} else { |
434 |
|
|
for (Entry e = header.previous; e != header; e = e.previous) { |
435 |
|
|
index--; |
436 |
|
|
if (o.equals(e.element)) |
437 |
|
|
return index; |
438 |
|
|
} |
439 |
|
|
} |
440 |
|
|
return -1; |
441 |
|
|
} |
442 |
|
|
|
443 |
dl |
1.3 |
// Queue operations. |
444 |
|
|
|
445 |
|
|
/** |
446 |
dl |
1.7 |
* Retrieves, but does not remove, the head (first element) of this list. |
447 |
dl |
1.3 |
* @return the head of this queue, or <tt>null</tt> if this queue is empty. |
448 |
dl |
1.7 |
* @since 1.5 |
449 |
dl |
1.3 |
*/ |
450 |
|
|
public E peek() { |
451 |
|
|
if (size==0) |
452 |
|
|
return null; |
453 |
|
|
return getFirst(); |
454 |
|
|
} |
455 |
|
|
|
456 |
|
|
/** |
457 |
dl |
1.7 |
* Retrieves, but does not remove, the head (first element) of this list. |
458 |
dl |
1.3 |
* @return the head of this queue. |
459 |
|
|
* @throws NoSuchElementException if this queue is empty. |
460 |
dl |
1.7 |
* @since 1.5 |
461 |
dl |
1.3 |
*/ |
462 |
|
|
public E element() { |
463 |
|
|
return getFirst(); |
464 |
|
|
} |
465 |
|
|
|
466 |
|
|
/** |
467 |
dl |
1.7 |
* Retrieves and removes the head (first element) of this list. |
468 |
dl |
1.3 |
* @return the head of this queue, or <tt>null</tt> if this queue is empty. |
469 |
dl |
1.7 |
* @since 1.5 |
470 |
dl |
1.3 |
*/ |
471 |
|
|
public E poll() { |
472 |
|
|
if (size==0) |
473 |
|
|
return null; |
474 |
|
|
return removeFirst(); |
475 |
|
|
} |
476 |
|
|
|
477 |
|
|
/** |
478 |
dl |
1.7 |
* Retrieves and removes the head (first element) of this list. |
479 |
dl |
1.3 |
* @return the head of this queue. |
480 |
|
|
* @throws NoSuchElementException if this queue is empty. |
481 |
dl |
1.7 |
* @since 1.5 |
482 |
dl |
1.3 |
*/ |
483 |
|
|
public E remove() { |
484 |
|
|
return removeFirst(); |
485 |
|
|
} |
486 |
|
|
|
487 |
|
|
/** |
488 |
|
|
* Adds the specified element as the tail (last element) of this list. |
489 |
|
|
* |
490 |
jsr166 |
1.11 |
* @param o the element to add. |
491 |
dl |
1.3 |
* @return <tt>true</tt> (as per the general contract of |
492 |
|
|
* <tt>Queue.offer</tt>) |
493 |
dl |
1.7 |
* @since 1.5 |
494 |
dl |
1.3 |
*/ |
495 |
jsr166 |
1.11 |
public boolean offer(E o) { |
496 |
|
|
return add(o); |
497 |
dl |
1.3 |
} |
498 |
|
|
|
499 |
tim |
1.1 |
/** |
500 |
|
|
* Returns a list-iterator of the elements in this list (in proper |
501 |
|
|
* sequence), starting at the specified position in the list. |
502 |
|
|
* Obeys the general contract of <tt>List.listIterator(int)</tt>.<p> |
503 |
|
|
* |
504 |
|
|
* The list-iterator is <i>fail-fast</i>: if the list is structurally |
505 |
|
|
* modified at any time after the Iterator is created, in any way except |
506 |
|
|
* through the list-iterator's own <tt>remove</tt> or <tt>add</tt> |
507 |
|
|
* methods, the list-iterator will throw a |
508 |
|
|
* <tt>ConcurrentModificationException</tt>. Thus, in the face of |
509 |
|
|
* concurrent modification, the iterator fails quickly and cleanly, rather |
510 |
|
|
* than risking arbitrary, non-deterministic behavior at an undetermined |
511 |
|
|
* time in the future. |
512 |
|
|
* |
513 |
|
|
* @param index index of first element to be returned from the |
514 |
dl |
1.3 |
* list-iterator (by a call to <tt>next</tt>). |
515 |
tim |
1.1 |
* @return a ListIterator of the elements in this list (in proper |
516 |
dl |
1.3 |
* sequence), starting at the specified position in the list. |
517 |
tim |
1.1 |
* @throws IndexOutOfBoundsException if index is out of range |
518 |
dl |
1.3 |
* (<tt>index < 0 || index > size()</tt>). |
519 |
|
|
* @see List#listIterator(int) |
520 |
tim |
1.1 |
*/ |
521 |
dl |
1.3 |
public ListIterator<E> listIterator(int index) { |
522 |
|
|
return new ListItr(index); |
523 |
tim |
1.1 |
} |
524 |
|
|
|
525 |
dl |
1.3 |
private class ListItr implements ListIterator<E> { |
526 |
|
|
private Entry<E> lastReturned = header; |
527 |
|
|
private Entry<E> next; |
528 |
|
|
private int nextIndex; |
529 |
|
|
private int expectedModCount = modCount; |
530 |
|
|
|
531 |
|
|
ListItr(int index) { |
532 |
|
|
if (index < 0 || index > size) |
533 |
|
|
throw new IndexOutOfBoundsException("Index: "+index+ |
534 |
|
|
", Size: "+size); |
535 |
|
|
if (index < (size >> 1)) { |
536 |
|
|
next = header.next; |
537 |
|
|
for (nextIndex=0; nextIndex<index; nextIndex++) |
538 |
|
|
next = next.next; |
539 |
|
|
} else { |
540 |
|
|
next = header; |
541 |
|
|
for (nextIndex=size; nextIndex>index; nextIndex--) |
542 |
|
|
next = next.previous; |
543 |
|
|
} |
544 |
|
|
} |
545 |
|
|
|
546 |
|
|
public boolean hasNext() { |
547 |
|
|
return nextIndex != size; |
548 |
|
|
} |
549 |
|
|
|
550 |
|
|
public E next() { |
551 |
|
|
checkForComodification(); |
552 |
|
|
if (nextIndex == size) |
553 |
|
|
throw new NoSuchElementException(); |
554 |
|
|
|
555 |
|
|
lastReturned = next; |
556 |
|
|
next = next.next; |
557 |
|
|
nextIndex++; |
558 |
|
|
return lastReturned.element; |
559 |
|
|
} |
560 |
|
|
|
561 |
|
|
public boolean hasPrevious() { |
562 |
|
|
return nextIndex != 0; |
563 |
|
|
} |
564 |
|
|
|
565 |
|
|
public E previous() { |
566 |
|
|
if (nextIndex == 0) |
567 |
|
|
throw new NoSuchElementException(); |
568 |
|
|
|
569 |
|
|
lastReturned = next = next.previous; |
570 |
|
|
nextIndex--; |
571 |
|
|
checkForComodification(); |
572 |
|
|
return lastReturned.element; |
573 |
|
|
} |
574 |
|
|
|
575 |
|
|
public int nextIndex() { |
576 |
|
|
return nextIndex; |
577 |
|
|
} |
578 |
|
|
|
579 |
|
|
public int previousIndex() { |
580 |
|
|
return nextIndex-1; |
581 |
|
|
} |
582 |
tim |
1.1 |
|
583 |
dl |
1.3 |
public void remove() { |
584 |
tim |
1.1 |
checkForComodification(); |
585 |
|
|
try { |
586 |
|
|
LinkedList.this.remove(lastReturned); |
587 |
|
|
} catch (NoSuchElementException e) { |
588 |
|
|
throw new IllegalStateException(); |
589 |
|
|
} |
590 |
dl |
1.3 |
if (next==lastReturned) |
591 |
tim |
1.1 |
next = lastReturned.next; |
592 |
|
|
else |
593 |
dl |
1.3 |
nextIndex--; |
594 |
|
|
lastReturned = header; |
595 |
|
|
expectedModCount++; |
596 |
|
|
} |
597 |
|
|
|
598 |
|
|
public void set(E o) { |
599 |
|
|
if (lastReturned == header) |
600 |
|
|
throw new IllegalStateException(); |
601 |
|
|
checkForComodification(); |
602 |
|
|
lastReturned.element = o; |
603 |
|
|
} |
604 |
|
|
|
605 |
|
|
public void add(E o) { |
606 |
|
|
checkForComodification(); |
607 |
|
|
lastReturned = header; |
608 |
|
|
addBefore(o, next); |
609 |
|
|
nextIndex++; |
610 |
|
|
expectedModCount++; |
611 |
|
|
} |
612 |
|
|
|
613 |
|
|
final void checkForComodification() { |
614 |
|
|
if (modCount != expectedModCount) |
615 |
|
|
throw new ConcurrentModificationException(); |
616 |
|
|
} |
617 |
|
|
} |
618 |
|
|
|
619 |
|
|
private static class Entry<E> { |
620 |
|
|
E element; |
621 |
|
|
Entry<E> next; |
622 |
|
|
Entry<E> previous; |
623 |
|
|
|
624 |
|
|
Entry(E element, Entry<E> next, Entry<E> previous) { |
625 |
|
|
this.element = element; |
626 |
|
|
this.next = next; |
627 |
|
|
this.previous = previous; |
628 |
|
|
} |
629 |
|
|
} |
630 |
|
|
|
631 |
|
|
private Entry<E> addBefore(E o, Entry<E> e) { |
632 |
|
|
Entry<E> newEntry = new Entry<E>(o, e, e.previous); |
633 |
|
|
newEntry.previous.next = newEntry; |
634 |
|
|
newEntry.next.previous = newEntry; |
635 |
|
|
size++; |
636 |
|
|
modCount++; |
637 |
|
|
return newEntry; |
638 |
|
|
} |
639 |
|
|
|
640 |
|
|
private void remove(Entry<E> e) { |
641 |
|
|
if (e == header) |
642 |
|
|
throw new NoSuchElementException(); |
643 |
|
|
|
644 |
|
|
e.previous.next = e.next; |
645 |
|
|
e.next.previous = e.previous; |
646 |
|
|
size--; |
647 |
|
|
modCount++; |
648 |
tim |
1.1 |
} |
649 |
|
|
|
650 |
|
|
/** |
651 |
|
|
* Returns a shallow copy of this <tt>LinkedList</tt>. (The elements |
652 |
|
|
* themselves are not cloned.) |
653 |
|
|
* |
654 |
|
|
* @return a shallow copy of this <tt>LinkedList</tt> instance. |
655 |
|
|
*/ |
656 |
|
|
public Object clone() { |
657 |
dl |
1.3 |
LinkedList<E> clone = null; |
658 |
|
|
try { |
659 |
|
|
clone = (LinkedList<E>) super.clone(); |
660 |
|
|
} catch (CloneNotSupportedException e) { |
661 |
|
|
throw new InternalError(); |
662 |
|
|
} |
663 |
tim |
1.1 |
|
664 |
|
|
// Put clone into "virgin" state |
665 |
dl |
1.3 |
clone.header = new Entry<E>(null, null, null); |
666 |
tim |
1.1 |
clone.header.next = clone.header.previous = clone.header; |
667 |
|
|
clone.size = 0; |
668 |
|
|
clone.modCount = 0; |
669 |
|
|
|
670 |
|
|
// Initialize clone with our elements |
671 |
dl |
1.3 |
for (Entry<E> e = header.next; e != header; e = e.next) |
672 |
tim |
1.1 |
clone.add(e.element); |
673 |
|
|
|
674 |
|
|
return clone; |
675 |
|
|
} |
676 |
|
|
|
677 |
|
|
/** |
678 |
|
|
* Returns an array containing all of the elements in this list |
679 |
|
|
* in the correct order. |
680 |
|
|
* |
681 |
|
|
* @return an array containing all of the elements in this list |
682 |
dl |
1.3 |
* in the correct order. |
683 |
tim |
1.1 |
*/ |
684 |
|
|
public Object[] toArray() { |
685 |
dl |
1.3 |
Object[] result = new Object[size]; |
686 |
tim |
1.1 |
int i = 0; |
687 |
dl |
1.3 |
for (Entry<E> e = header.next; e != header; e = e.next) |
688 |
tim |
1.1 |
result[i++] = e.element; |
689 |
dl |
1.3 |
return result; |
690 |
tim |
1.1 |
} |
691 |
|
|
|
692 |
|
|
/** |
693 |
|
|
* Returns an array containing all of the elements in this list in |
694 |
|
|
* the correct order; the runtime type of the returned array is that of |
695 |
|
|
* the specified array. If the list fits in the specified array, it |
696 |
|
|
* is returned therein. Otherwise, a new array is allocated with the |
697 |
|
|
* runtime type of the specified array and the size of this list.<p> |
698 |
|
|
* |
699 |
|
|
* If the list fits in the specified array with room to spare |
700 |
|
|
* (i.e., the array has more elements than the list), |
701 |
|
|
* the element in the array immediately following the end of the |
702 |
|
|
* collection is set to null. This is useful in determining the length |
703 |
|
|
* of the list <i>only</i> if the caller knows that the list |
704 |
|
|
* does not contain any null elements. |
705 |
|
|
* |
706 |
|
|
* @param a the array into which the elements of the list are to |
707 |
dl |
1.3 |
* be stored, if it is big enough; otherwise, a new array of the |
708 |
|
|
* same runtime type is allocated for this purpose. |
709 |
tim |
1.1 |
* @return an array containing the elements of the list. |
710 |
|
|
* @throws ArrayStoreException if the runtime type of a is not a |
711 |
|
|
* supertype of the runtime type of every element in this list. |
712 |
|
|
* @throws NullPointerException if the specified array is null. |
713 |
|
|
*/ |
714 |
dl |
1.3 |
public <T> T[] toArray(T[] a) { |
715 |
tim |
1.1 |
if (a.length < size) |
716 |
dl |
1.3 |
a = (T[])java.lang.reflect.Array.newInstance( |
717 |
tim |
1.1 |
a.getClass().getComponentType(), size); |
718 |
|
|
int i = 0; |
719 |
dl |
1.3 |
Object[] result = a; |
720 |
|
|
for (Entry<E> e = header.next; e != header; e = e.next) |
721 |
|
|
result[i++] = e.element; |
722 |
tim |
1.1 |
|
723 |
|
|
if (a.length > size) |
724 |
|
|
a[size] = null; |
725 |
|
|
|
726 |
|
|
return a; |
727 |
|
|
} |
728 |
|
|
|
729 |
|
|
private static final long serialVersionUID = 876323262645176354L; |
730 |
|
|
|
731 |
|
|
/** |
732 |
|
|
* Save the state of this <tt>LinkedList</tt> instance to a stream (that |
733 |
|
|
* is, serialize it). |
734 |
|
|
* |
735 |
|
|
* @serialData The size of the list (the number of elements it |
736 |
dl |
1.3 |
* contains) is emitted (int), followed by all of its |
737 |
|
|
* elements (each an Object) in the proper order. |
738 |
tim |
1.1 |
*/ |
739 |
dl |
1.3 |
private void writeObject(java.io.ObjectOutputStream s) |
740 |
tim |
1.1 |
throws java.io.IOException { |
741 |
dl |
1.3 |
// Write out any hidden serialization magic |
742 |
|
|
s.defaultWriteObject(); |
743 |
tim |
1.1 |
|
744 |
|
|
// Write out size |
745 |
|
|
s.writeInt(size); |
746 |
|
|
|
747 |
dl |
1.3 |
// Write out all elements in the proper order. |
748 |
tim |
1.1 |
for (Entry e = header.next; e != header; e = e.next) |
749 |
|
|
s.writeObject(e.element); |
750 |
|
|
} |
751 |
|
|
|
752 |
|
|
/** |
753 |
|
|
* Reconstitute this <tt>LinkedList</tt> instance from a stream (that is |
754 |
|
|
* deserialize it). |
755 |
|
|
*/ |
756 |
dl |
1.3 |
private void readObject(java.io.ObjectInputStream s) |
757 |
tim |
1.1 |
throws java.io.IOException, ClassNotFoundException { |
758 |
dl |
1.3 |
// Read in any hidden serialization magic |
759 |
|
|
s.defaultReadObject(); |
760 |
tim |
1.1 |
|
761 |
|
|
// Read in size |
762 |
|
|
int size = s.readInt(); |
763 |
|
|
|
764 |
|
|
// Initialize header |
765 |
dl |
1.3 |
header = new Entry<E>(null, null, null); |
766 |
tim |
1.1 |
header.next = header.previous = header; |
767 |
|
|
|
768 |
dl |
1.3 |
// Read in all elements in the proper order. |
769 |
|
|
for (int i=0; i<size; i++) |
770 |
|
|
addBefore((E)s.readObject(), header); |
771 |
tim |
1.1 |
} |
772 |
|
|
} |