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

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

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1.14 - (view) (download)

1 : dl 1.1 /*
2 :     * Written by Doug Lea and Josh Bloch with assistance from members of
3 :     * JCP JSR-166 Expert Group and released to the public domain, as explained
4 :     * at http://creativecommons.org/licenses/publicdomain
5 :     */
6 :    
7 :     package java.util;
8 : jsr166 1.14 import java.util.*; // for javadoc
9 : dl 1.1
10 :     /**
11 :     * A linear collection that supports element insertion and removal at
12 :     * both ends. The name <i>deque</i> is short for "double ended queue"
13 :     * and is usually pronounced "deck". Most <tt>Deque</tt>
14 :     * implementations place no fixed limits on the number of elements
15 :     * they may contain, but this interface supports capacity-restricted
16 :     * deques as well as those with no fixed size limit.
17 :     *
18 :     * <p>This interface defines methods to access the elements at both
19 :     * ends of the deque. Methods are provided to insert, remove, and
20 :     * examine the element. Each of these methods exists in two forms:
21 :     * one throws an exception if the operation fails, the other returns a
22 :     * special value (either <tt>null</tt> or <tt>false</tt>, depending on
23 :     * the operation). The latter form of the insert operation is
24 :     * designed specifically for use with capacity-restricted
25 :     * <tt>Deque</tt> implementations; in most implementations, insert
26 :     * operations cannot fail.
27 :     *
28 : dl 1.3 * <p>The twelve methods described above are summarized in the
29 : jsr166 1.5 * following table:
30 : dl 1.3 *
31 : jsr166 1.7 * <p>
32 :     * <table BORDER CELLPADDING=3 CELLSPACING=1>
33 : dl 1.1 * <tr>
34 :     * <td></td>
35 :     * <td ALIGN=CENTER COLSPAN = 2> <b>First Element (Head)</b></td>
36 :     * <td ALIGN=CENTER COLSPAN = 2> <b>Last Element (Tail)</b></td>
37 :     * </tr>
38 :     * <tr>
39 :     * <td></td>
40 :     * <td ALIGN=CENTER><em>Throws exception</em></td>
41 : jsr166 1.8 * <td ALIGN=CENTER><em>Special value</em></td>
42 : dl 1.1 * <td ALIGN=CENTER><em>Throws exception</em></td>
43 : jsr166 1.8 * <td ALIGN=CENTER><em>Special value</em></td>
44 : dl 1.1 * </tr>
45 :     * <tr>
46 :     * <td><b>Insert</b></td>
47 :     * <td>{@link #addFirst addFirst(e)}</td>
48 :     * <td>{@link #offerFirst offerFirst(e)}</td>
49 :     * <td>{@link #addLast addLast(e)}</td>
50 :     * <td>{@link #offerLast offerLast(e)}</td>
51 :     * </tr>
52 :     * <tr>
53 :     * <td><b>Remove</b></td>
54 :     * <td>{@link #removeFirst removeFirst()}</td>
55 :     * <td>{@link #pollFirst pollFirst()}</td>
56 :     * <td>{@link #removeLast removeLast()}</td>
57 :     * <td>{@link #pollLast pollLast()}</td>
58 :     * </tr>
59 :     * <tr>
60 :     * <td><b>Examine</b></td>
61 :     * <td>{@link #getFirst getFirst()}</td>
62 :     * <td>{@link #peekFirst peekFirst()}</td>
63 :     * <td>{@link #getLast getLast()}</td>
64 :     * <td>{@link #peekLast peekLast()}</td>
65 :     * </tr>
66 :     * </table>
67 :     *
68 :     * <p>This interface extends the {@link Queue} interface. When a deque is
69 :     * used as a queue, FIFO (First-In-First-Out) behavior results. Elements are
70 : dl 1.4 * added at the end of the deque and removed from the beginning. The methods
71 : dl 1.1 * inherited from the <tt>Queue</tt> interface are precisely equivalent to
72 : jsr166 1.5 * <tt>Deque</tt> methods as indicated in the following table:
73 : dl 1.1 *
74 : jsr166 1.7 * <p>
75 :     * <table BORDER CELLPADDING=3 CELLSPACING=1>
76 : dl 1.1 * <tr>
77 :     * <td ALIGN=CENTER> <b><tt>Queue</tt> Method</b></td>
78 :     * <td ALIGN=CENTER> <b>Equivalent <tt>Deque</tt> Method</b></td>
79 :     * </tr>
80 :     * <tr>
81 : jsr166 1.8 * <td>{@link java.util.Queue#add add(e)}</td>
82 :     * <td>{@link #addLast addLast(e)}</td>
83 :     * </tr>
84 :     * <tr>
85 : dl 1.1 * <td>{@link java.util.Queue#offer offer(e)}</td>
86 :     * <td>{@link #offerLast offerLast(e)}</td>
87 : jsr166 1.5 * </tr>
88 :     * <tr>
89 : jsr166 1.8 * <td>{@link java.util.Queue#remove remove()}</td>
90 :     * <td>{@link #removeFirst removeFirst()}</td>
91 : jsr166 1.5 * </tr>
92 :     * <tr>
93 : dl 1.1 * <td>{@link java.util.Queue#poll poll()}</td>
94 :     * <td>{@link #pollFirst pollFirst()}</td>
95 : jsr166 1.5 * </tr>
96 :     * <tr>
97 : jsr166 1.8 * <td>{@link java.util.Queue#element element()}</td>
98 :     * <td>{@link #getFirst getFirst()}</td>
99 : jsr166 1.5 * </tr>
100 :     * <tr>
101 : dl 1.1 * <td>{@link java.util.Queue#peek peek()}</td>
102 :     * <td>{@link #peek peekFirst()}</td>
103 : jsr166 1.5 * </tr>
104 : dl 1.1 * </table>
105 :     *
106 :     * <p>Deques can also be used as LIFO (Last-In-First-Out) stacks. This
107 :     * interface should be used in preference to the legacy {@link Stack} class.
108 : dl 1.3 * When a deque is used as a stack, elements are pushed and popped from the
109 : dl 1.1 * beginning of the deque. Stack methods are precisely equivalent to
110 : jsr166 1.5 * <tt>Deque</tt> methods as indicated in the table below:
111 : dl 1.1 *
112 : jsr166 1.7 * <p>
113 :     * <table BORDER CELLPADDING=3 CELLSPACING=1>
114 : dl 1.1 * <tr>
115 :     * <td ALIGN=CENTER> <b>Stack Method</b></td>
116 :     * <td ALIGN=CENTER> <b>Equivalent <tt>Deque</tt> Method</b></td>
117 :     * </tr>
118 :     * <tr>
119 :     * <td>{@link #push push(e)}</td>
120 :     * <td>{@link #addFirst addFirst(e)}</td>
121 : jsr166 1.5 * </tr>
122 :     * <tr>
123 : dl 1.1 * <td>{@link #pop pop()}</td>
124 :     * <td>{@link #removeFirst removeFirst()}</td>
125 : jsr166 1.5 * </tr>
126 :     * <tr>
127 : dl 1.1 * <td>{@link #peek peek()}</td>
128 :     * <td>{@link #peekFirst peekFirst()}</td>
129 : jsr166 1.5 * </tr>
130 : dl 1.1 * </table>
131 :     *
132 :     * <p>Note that the {@link #peek peek} method works equally well when
133 :     * a deque is used as a queue or a stack; in either case, elements are
134 :     * drawn from the beginning of the deque.
135 :     *
136 : dl 1.2 * <p>This interface provides two methods to remove interior
137 : dl 1.1 * elements, {@link #removeFirstOccurrence removeFirstOccurrence} and
138 : jsr166 1.8 * {@link #removeLastOccurrence removeLastOccurrence}.
139 :     *
140 :     * <p>Unlike the {@link List} interface, this interface does not
141 :     * provide support for indexed access to elements.
142 : dl 1.1 *
143 :     * <p>While <tt>Deque</tt> implementations are not strictly required
144 :     * to prohibit the insertion of null elements, they are strongly
145 :     * encouraged to do so. Users of any <tt>Deque</tt> implementations
146 :     * that do allow null elements are strongly encouraged <i>not</i> to
147 :     * take advantage of the ability to insert nulls. This is so because
148 :     * <tt>null</tt> is used as a special return value by various methods
149 :     * to indicated that the deque is empty.
150 : dl 1.3 *
151 : dl 1.1 * <p><tt>Deque</tt> implementations generally do not define
152 :     * element-based versions of the <tt>equals</tt> and <tt>hashCode</tt>
153 :     * methods, but instead inherit the identity-based versions from class
154 :     * <tt>Object</tt>.
155 :     *
156 :     * <p>This interface is a member of the <a
157 :     * href="{@docRoot}/../guide/collections/index.html"> Java Collections
158 :     * Framework</a>.
159 :     *
160 :     * @author Doug Lea
161 :     * @author Josh Bloch
162 :     * @since 1.6
163 :     * @param <E> the type of elements held in this collection
164 :     */
165 :    
166 :     public interface Deque<E> extends Queue<E> {
167 :     /**
168 : jsr166 1.8 * Inserts the specified element at the front of this deque if it is
169 :     * possible to do so immediately without violating capacity restrictions.
170 :     * When using a capacity-restricted deque, it is generally preferable to
171 :     * use method {@link #offerFirst}.
172 :     *
173 :     * @param e the element to add
174 :     * @throws IllegalStateException if the element cannot be added at this
175 :     * time due to capacity restrictions
176 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
177 :     * prevents it from being added to this deque
178 : jsr166 1.8 * @throws NullPointerException if the specified element is null and this
179 :     * deque does not permit null elements
180 :     * @throws IllegalArgumentException if some property of the specified
181 :     * element prevents it from being added to this deque
182 :     */
183 :     void addFirst(E e);
184 :    
185 :     /**
186 : jsr166 1.13 * Inserts the specified element at the end of this deque if it is
187 : jsr166 1.8 * possible to do so immediately without violating capacity restrictions.
188 :     * When using a capacity-restricted deque, it is generally preferable to
189 :     * use method {@link #offerLast}.
190 :     *
191 : jsr166 1.14 * <p>This method is equivalent to {@link #add}.
192 :     *
193 : jsr166 1.8 * @param e the element to add
194 :     * @throws IllegalStateException if the element cannot be added at this
195 :     * time due to capacity restrictions
196 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
197 :     * prevents it from being added to this deque
198 : jsr166 1.8 * @throws NullPointerException if the specified element is null and this
199 :     * deque does not permit null elements
200 :     * @throws IllegalArgumentException if some property of the specified
201 :     * element prevents it from being added to this deque
202 :     */
203 :     void addLast(E e);
204 :    
205 :     /**
206 : dl 1.3 * Inserts the specified element at the front of this deque unless it would
207 : dl 1.1 * violate capacity restrictions. When using a capacity-restricted deque,
208 : jsr166 1.8 * this method is generally preferable to the {@link #addFirst} method,
209 :     * which can fail to insert an element only by throwing an exception.
210 : dl 1.1 *
211 : jsr166 1.8 * @param e the element to add
212 : jsr166 1.11 * @return <tt>true</tt> if the element was added to this deque, else
213 :     * <tt>false</tt>
214 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
215 :     * prevents it from being added to this deque
216 : dl 1.3 * @throws NullPointerException if the specified element is null and this
217 : jsr166 1.8 * deque does not permit null elements
218 :     * @throws IllegalArgumentException if some property of the specified
219 :     * element prevents it from being added to this deque
220 : dl 1.1 */
221 :     boolean offerFirst(E e);
222 :    
223 :     /**
224 : dl 1.4 * Inserts the specified element at the end of this deque unless it would
225 : dl 1.1 * violate capacity restrictions. When using a capacity-restricted deque,
226 : jsr166 1.8 * this method is generally preferable to the {@link #addLast} method,
227 :     * which can fail to insert an element only by throwing an exception.
228 : dl 1.1 *
229 : jsr166 1.8 * @param e the element to add
230 : jsr166 1.11 * @return <tt>true</tt> if the element was added to this deque, else
231 :     * <tt>false</tt>
232 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
233 :     * prevents it from being added to this deque
234 : dl 1.3 * @throws NullPointerException if the specified element is null and this
235 : jsr166 1.8 * deque does not permit null elements
236 :     * @throws IllegalArgumentException if some property of the specified
237 :     * element prevents it from being added to this deque
238 : dl 1.1 */
239 :     boolean offerLast(E e);
240 :    
241 :     /**
242 : jsr166 1.8 * Retrieves and removes the first element of this deque. This method
243 :     * differs from {@link #pollFirst} only in that it throws an exception
244 :     * if this deque is empty.
245 : dl 1.1 *
246 : jsr166 1.8 * @return the head of this deque
247 :     * @throws NoSuchElementException if this deque is empty
248 : dl 1.1 */
249 : jsr166 1.8 E removeFirst();
250 : dl 1.1
251 :     /**
252 : jsr166 1.8 * Retrieves and removes the last element of this deque. This method
253 :     * differs from {@link #pollLast} only in that it throws an exception if
254 :     * this deque is empty.
255 : dl 1.1 *
256 : jsr166 1.8 * @return the tail of this deque
257 :     * @throws NoSuchElementException if this deque is empty
258 : dl 1.1 */
259 : jsr166 1.8 E removeLast();
260 : dl 1.1
261 :     /**
262 : jsr166 1.8 * Retrieves and removes the first element of this deque,
263 :     * or returns <tt>null</tt> if this deque is empty.
264 : dl 1.1 *
265 : jsr166 1.8 * @return the head of this deque, or <tt>null</tt> if this deque is empty
266 : dl 1.1 */
267 :     E pollFirst();
268 :    
269 :     /**
270 : jsr166 1.8 * Retrieves and removes the last element of this deque,
271 :     * or returns <tt>null</tt> if this deque is empty.
272 : dl 1.1 *
273 : jsr166 1.8 * @return the tail of this deque, or <tt>null</tt> if this deque is empty
274 : dl 1.1 */
275 :     E pollLast();
276 :    
277 :     /**
278 : jsr166 1.8 * Retrieves, but does not remove, the first element of this deque.
279 :     * This method differs from {@link #peekFirst} only in that it throws an
280 : dl 1.1 * exception if this deque is empty.
281 :     *
282 : jsr166 1.8 * @return the head of this deque
283 : dl 1.1 * @throws NoSuchElementException if this deque is empty
284 :     */
285 : jsr166 1.8 E getFirst();
286 : dl 1.1
287 :     /**
288 : jsr166 1.8 * Retrieves, but does not remove, the last element of this deque.
289 :     * This method differs from {@link #peekLast} only in that it throws an
290 : dl 1.1 * exception if this deque is empty.
291 :     *
292 : jsr166 1.8 * @return the tail of this deque
293 : dl 1.1 * @throws NoSuchElementException if this deque is empty
294 :     */
295 : jsr166 1.8 E getLast();
296 : dl 1.1
297 :     /**
298 :     * Retrieves, but does not remove, the first element of this deque,
299 : jsr166 1.8 * or returns <tt>null</tt> if this deque is empty.
300 : dl 1.1 *
301 : jsr166 1.8 * @return the head of this deque, or <tt>null</tt> if this deque is empty
302 : dl 1.1 */
303 :     E peekFirst();
304 :    
305 :     /**
306 :     * Retrieves, but does not remove, the last element of this deque,
307 : jsr166 1.8 * or returns <tt>null</tt> if this deque is empty.
308 : dl 1.1 *
309 : jsr166 1.8 * @return the tail of this deque, or <tt>null</tt> if this deque is empty
310 : dl 1.1 */
311 :     E peekLast();
312 :    
313 :     /**
314 : jsr166 1.8 * Removes the first occurrence of the specified element from this deque.
315 :     * If the deque does not contain the element, it is unchanged.
316 :     * More formally, removes the first element <tt>e</tt> such that
317 : jsr166 1.9 * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
318 :     * (if such an element exists).
319 : jsr166 1.12 * Returns <tt>true</tt> if this deque contained the specified element
320 :     * (or equivalently, if this deque changed as a result of the call).
321 : dl 1.1 *
322 : dl 1.3 * @param o element to be removed from this deque, if present
323 : jsr166 1.8 * @return <tt>true</tt> if an element was removed as a result of this call
324 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
325 :     * is incompatible with this deque (optional)
326 : dl 1.4 * @throws NullPointerException if the specified element is null and this
327 : jsr166 1.8 * deque does not permit null elements (optional)
328 : dl 1.1 */
329 : dl 1.3 boolean removeFirstOccurrence(Object o);
330 : dl 1.1
331 :     /**
332 : jsr166 1.8 * Removes the last occurrence of the specified element from this deque.
333 :     * If the deque does not contain the element, it is unchanged.
334 :     * More formally, removes the last element <tt>e</tt> such that
335 : jsr166 1.9 * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
336 :     * (if such an element exists).
337 : jsr166 1.12 * Returns <tt>true</tt> if this deque contained the specified element
338 :     * (or equivalently, if this deque changed as a result of the call).
339 : dl 1.1 *
340 : dl 1.3 * @param o element to be removed from this deque, if present
341 : jsr166 1.8 * @return <tt>true</tt> if an element was removed as a result of this call
342 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
343 :     * is incompatible with this deque (optional)
344 : dl 1.4 * @throws NullPointerException if the specified element is null and this
345 : jsr166 1.8 * deque does not permit null elements (optional)
346 : dl 1.1 */
347 : dl 1.3 boolean removeLastOccurrence(Object o);
348 : dl 1.1
349 : jsr166 1.8 // *** Queue methods ***
350 : dl 1.1
351 : jsr166 1.8 /**
352 :     * Inserts the specified element into the queue represented by this deque
353 :     * (in other words, at the tail of this deque) if it is possible to do so
354 :     * immediately without violating capacity restrictions, returning
355 :     * <tt>true</tt> upon success and throwing an
356 :     * <tt>IllegalStateException</tt> if no space is currently available.
357 :     * When using a capacity-restricted deque, it is generally preferable to
358 :     * use {@link #offer(Object) offer}.
359 :     *
360 : jsr166 1.14 * <p>This method is equivalent to {@link #addLast}.
361 : jsr166 1.8 *
362 :     * @param e the element to add
363 :     * @return <tt>true</tt> (as per the spec for {@link Collection#add})
364 :     * @throws IllegalStateException if the element cannot be added at this
365 :     * time due to capacity restrictions
366 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
367 :     * prevents it from being added to this deque
368 : jsr166 1.8 * @throws NullPointerException if the specified element is null and this
369 :     * deque does not permit null elements
370 :     * @throws IllegalArgumentException if some property of the specified
371 :     * element prevents it from being added to this deque
372 :     */
373 :     boolean add(E e);
374 : dl 1.1
375 :     /**
376 :     * Inserts the specified element into the queue represented by this deque
377 : jsr166 1.8 * (in other words, at the tail of this deque) if it is possible to do so
378 :     * immediately without violating capacity restrictions, returning
379 :     * <tt>true</tt> upon success and <tt>false</tt> if no space is currently
380 :     * available. When using a capacity-restricted deque, this method is
381 :     * generally preferable to the {@link #add} method, which can fail to
382 :     * insert an element only by throwing an exception.
383 : dl 1.1 *
384 :     * <p>This method is equivalent to {@link #offerLast}.
385 :     *
386 : jsr166 1.8 * @param e the element to add
387 :     * @return <tt>true</tt> if the element was added to this deque, else
388 :     * <tt>false</tt>
389 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
390 :     * prevents it from being added to this deque
391 : dl 1.3 * @throws NullPointerException if the specified element is null and this
392 : jsr166 1.8 * deque does not permit null elements
393 :     * @throws IllegalArgumentException if some property of the specified
394 :     * element prevents it from being added to this deque
395 : dl 1.1 */
396 :     boolean offer(E e);
397 :    
398 :     /**
399 : jsr166 1.8 * Retrieves and removes the head of the queue represented by this deque
400 :     * (in other words, the first element of this deque).
401 :     * This method differs from {@link #poll} only in that it throws an
402 :     * exception if this deque is empty.
403 : dl 1.1 *
404 : jsr166 1.8 * <p>This method is equivalent to {@link #removeFirst()}.
405 : dl 1.1 *
406 : jsr166 1.8 * @return the head of the queue represented by this deque
407 :     * @throws NoSuchElementException if this deque is empty
408 : dl 1.1 */
409 : jsr166 1.8 E remove();
410 : dl 1.1
411 :     /**
412 : jsr166 1.8 * Retrieves and removes the head of the queue represented by this deque
413 :     * (in other words, the first element of this deque), or returns
414 :     * <tt>null</tt> if this deque is empty.
415 : dl 1.1 *
416 :     * <p>This method is equivalent to {@link #pollFirst()}.
417 :     *
418 :     * @return the first element of this deque, or <tt>null</tt> if
419 : jsr166 1.8 * this deque is empty
420 : dl 1.1 */
421 :     E poll();
422 :    
423 :     /**
424 : jsr166 1.8 * Retrieves, but does not remove, the head of the queue represented by
425 :     * this deque (in other words, the first element of this deque).
426 :     * This method differs from {@link #peek} only in that it throws an
427 :     * exception if this deque is empty.
428 : dl 1.1 *
429 : jsr166 1.8 * <p>This method is equivalent to {@link #getFirst()}.
430 : dl 1.1 *
431 :     * @return the head of the queue represented by this deque
432 :     * @throws NoSuchElementException if this deque is empty
433 :     */
434 : jsr166 1.8 E element();
435 : dl 1.1
436 :     /**
437 :     * Retrieves, but does not remove, the head of the queue represented by
438 : jsr166 1.8 * this deque (in other words, the first element of this deque), or
439 :     * returns <tt>null</tt> if this deque is empty.
440 : dl 1.1 *
441 : dl 1.3 * <p>This method is equivalent to {@link #peekFirst()}.
442 : dl 1.1 *
443 :     * @return the head of the queue represented by this deque, or
444 : jsr166 1.8 * <tt>null</tt> if this deque is empty
445 : dl 1.1 */
446 :     E peek();
447 :    
448 :    
449 :     // *** Stack methods ***
450 :    
451 :     /**
452 : jsr166 1.8 * Pushes an element onto the stack represented by this deque (in other
453 :     * words, at the head of this deque) if it is possible to do so
454 :     * immediately without violating capacity restrictions, returning
455 :     * <tt>true</tt> upon success and throwing an
456 :     * <tt>IllegalStateException</tt> if no space is currently available.
457 : dl 1.1 *
458 :     * <p>This method is equivalent to {@link #addFirst}.
459 :     *
460 : dl 1.3 * @param e the element to push
461 : jsr166 1.8 * @throws IllegalStateException if the element cannot be added at this
462 :     * time due to capacity restrictions
463 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
464 :     * prevents it from being added to this deque
465 : dl 1.3 * @throws NullPointerException if the specified element is null and this
466 : jsr166 1.8 * deque does not permit null elements
467 :     * @throws IllegalArgumentException if some property of the specified
468 :     * element prevents it from being added to this deque
469 : dl 1.1 */
470 :     void push(E e);
471 :    
472 :     /**
473 :     * Pops an element from the stack represented by this deque. In other
474 : dl 1.2 * words, removes and returns the first element of this deque.
475 : dl 1.1 *
476 :     * <p>This method is equivalent to {@link #removeFirst()}.
477 :     *
478 :     * @return the element at the front of this deque (which is the top
479 : jsr166 1.8 * of the stack represented by this deque)
480 : dl 1.1 * @throws NoSuchElementException if this deque is empty
481 :     */
482 :     E pop();
483 :    
484 :    
485 : jsr166 1.8 // *** Collection methods ***
486 :    
487 :     /**
488 :     * Removes the first occurrence of the specified element from this deque.
489 :     * If the deque does not contain the element, it is unchanged.
490 :     * More formally, removes the first element <tt>e</tt> such that
491 : jsr166 1.9 * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>
492 :     * (if such an element exists).
493 : jsr166 1.12 * Returns <tt>true</tt> if this deque contained the specified element
494 :     * (or equivalently, if this deque changed as a result of the call).
495 : jsr166 1.8 *
496 :     * <p>This method is equivalent to {@link #removeFirstOccurrence}.
497 :     *
498 :     * @param o element to be removed from this deque, if present
499 :     * @return <tt>true</tt> if an element was removed as a result of this call
500 : jsr166 1.9 * @throws ClassCastException if the class of the specified element
501 :     * is incompatible with this deque (optional)
502 : jsr166 1.8 * @throws NullPointerException if the specified element is null and this
503 :     * deque does not permit null elements (optional)
504 :     */
505 :     boolean remove(Object o);
506 :    
507 :     /**
508 :     * Returns <tt>true</tt> if this deque contains the specified element.
509 : jsr166 1.9 * More formally, returns <tt>true</tt> if and only if this deque contains
510 :     * at least one element <tt>e</tt> such that
511 :     * <tt>(o==null&nbsp;?&nbsp;e==null&nbsp;:&nbsp;o.equals(e))</tt>.
512 : jsr166 1.8 *
513 :     * @param o element whose presence in this deque is to be tested
514 :     * @return <tt>true</tt> if this deque contains the specified element
515 :     * @throws ClassCastException if the type of the specified element
516 :     * is incompatible with this deque (optional)
517 :     * @throws NullPointerException if the specified element is null and this
518 :     * deque does not permit null elements (optional)
519 :     */
520 :     boolean contains(Object o);
521 :    
522 :     /**
523 :     * Returns the number of elements in this deque.
524 :     *
525 :     * @return the number of elements in this deque
526 :     */
527 :     public int size();
528 : dl 1.1
529 :     /**
530 : jsr166 1.10 * Returns an iterator over the elements in this deque in proper sequence.
531 :     * The elements will be returned in order from first (head) to last (tail).
532 : dl 1.3 *
533 : jsr166 1.10 * @return an iterator over the elements in this deque in proper sequence
534 : dl 1.1 */
535 :     Iterator<E> iterator();
536 :     }

Doug Lea
ViewVC Help
Powered by ViewVC 1.0.8