public class PriorityQueue<E> extends AbstractQueue<E>
| Constructor and Description |
|---|
PriorityQueue() |
PriorityQueue(Collection<? extends E> c) |
PriorityQueue(int initialCapacity) |
PriorityQueue(int initialCapacity,
Comparator<? super E> comparator) |
PriorityQueue(PriorityQueue<? extends E> c) |
PriorityQueue(SortedSet<? extends E> c) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(E o) |
void |
clear() |
Comparator<? super E> |
comparator() |
boolean |
contains(Object object) |
Iterator<E> |
iterator() |
boolean |
offer(E o) |
E |
peek() |
E |
poll() |
boolean |
remove(Object o) |
int |
size() |
Object[] |
toArray() |
<T> T[] |
toArray(T[] array) |
addAll, element, removecontainsAll, isEmpty, removeAll, retainAll, toStringclone, equals, getClass, hashCode, notify, notifyAll, wait, wait, waitcontainsAll, equals, hashCode, isEmpty, removeAll, removeIf, retainAllpublic PriorityQueue()
public PriorityQueue(int initialCapacity)
public PriorityQueue(int initialCapacity,
Comparator<? super E> comparator)
public PriorityQueue(Collection<? extends E> c)
public PriorityQueue(PriorityQueue<? extends E> c)
public Iterator<E> iterator()
iterator in interface Iterable<E>iterator in interface Collection<E>iterator in class AbstractCollection<E>public int size()
size in interface Collection<E>size in class AbstractCollection<E>public void clear()
clear in interface Collection<E>clear in class AbstractQueue<E>public boolean offer(E o)
public E poll()
public E peek()
public Comparator<? super E> comparator()
public boolean remove(Object o)
remove in interface Collection<E>remove in class AbstractCollection<E>public boolean add(E o)
add in interface Collection<E>add in class AbstractQueue<E>public boolean contains(Object object)
contains in interface Collection<E>contains in class AbstractCollection<E>public Object[] toArray()
toArray in interface Collection<E>toArray in class AbstractCollection<E>public <T> T[] toArray(T[] array)
toArray in interface Collection<E>toArray in class AbstractCollection<E>Copyright © 2026. All rights reserved.