1 |
|
/* |
2 |
|
* %W% %E% |
3 |
|
* |
4 |
< |
* Copyright 2003 Sun Microsystems, Inc. All rights reserved. |
4 |
> |
* Copyright 2004 Sun Microsystems, Inc. All rights reserved. |
5 |
|
* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. |
6 |
|
*/ |
7 |
|
|
32 |
|
* grows automatically. The details of the growth policy are not |
33 |
|
* specified. |
34 |
|
* |
35 |
< |
* <p>This class implements all of the <em>optional</em> methods of |
36 |
< |
* the {@link Collection} and {@link Iterator} interfaces. The |
35 |
> |
* <p>This class and its iterator implement all of the |
36 |
> |
* <em>optional</em> methods of the {@link Collection} and {@link |
37 |
> |
* Iterator} interfaces. |
38 |
> |
* The |
39 |
|
* Iterator provided in method {@link #iterator()} is <em>not</em> |
40 |
|
* guaranteed to traverse the elements of the PriorityQueue in any |
41 |
|
* particular order. If you need ordered traversal, consider using |
327 |
|
return offer(o); |
328 |
|
} |
329 |
|
|
330 |
+ |
/** |
331 |
+ |
* Removes a single instance of the specified element from this |
332 |
+ |
* queue, if it is present. |
333 |
+ |
*/ |
334 |
|
public boolean remove(Object o) { |
335 |
|
if (o == null) |
336 |
|
return false; |
462 |
|
} |
463 |
|
|
464 |
|
/** |
465 |
< |
* Remove all elements from the priority queue. |
465 |
> |
* Removes all elements from the priority queue. |
466 |
> |
* The queue will be empty after this call returns. |
467 |
|
*/ |
468 |
|
public void clear() { |
469 |
|
modCount++; |