public class CircularPriorityQueue<K,V> extends PriorityBlockingQueue<V>
Constructor and Description |
---|
CircularPriorityQueue(int maxSize,
Class<V> valueType,
Comparator<? super V> comparator,
Function<V,K> keyFunction) |
Modifier and Type | Method and Description |
---|---|
boolean |
addAll(Collection<? extends V> collection) |
Optional<V> |
getByKey(K key) |
Map<K,V> |
keyMap() |
boolean |
offer(V element) |
boolean |
remove(Object elementToRemove) |
List<V> |
toSortedList() |
add, clear, comparator, contains, drainTo, drainTo, iterator, offer, peek, poll, poll, put, remainingCapacity, size, spliterator, take, toArray, toArray, toString
element, remove
containsAll, isEmpty, removeAll, retainAll
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
containsAll, equals, hashCode, isEmpty, parallelStream, removeAll, removeIf, retainAll, stream
public boolean addAll(Collection<? extends V> collection)
addAll
in interface Collection<V>
addAll
in class AbstractQueue<V>
public boolean offer(V element)
offer
in interface BlockingQueue<V>
offer
in interface Queue<V>
offer
in class PriorityBlockingQueue<V>
public boolean remove(Object elementToRemove)
remove
in interface Collection<V>
remove
in interface BlockingQueue<V>
remove
in class PriorityBlockingQueue<V>
Copyright © 2020. All rights reserved.