co.paralleluniverse.concurrent.util

Class ConcurrentSkipListPriorityQueue<E>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

co.paralleluniverse.concurrent.util.ConcurrentSkipListPriorityQueue<E>

All Implemented Interfaces:

java.io.Serializable, java.lang.Cloneable, java.lang.Iterable<E>, java.util.Collection<E>, java.util.Queue<E>

public class ConcurrentSkipListPriorityQueue<E>
extends java.util.AbstractQueue<E>
implements java.lang.Cloneable, java.io.Serializable

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
ConcurrentSkipListPriorityQueue() Constructs a new, empty map, sorted according to the natural ordering of the keys.
ConcurrentSkipListPriorityQueue(java.util.Collection<? extends E> m)
ConcurrentSkipListPriorityQueue(java.util.Comparator<? super E> comparator) Constructs a new, empty map, sorted according to the specified comparator.

Method Summary

Modifier and Type	Method and Description
void	clear() Removes all of the mappings from this map.
ConcurrentSkipListPriorityQueue<E>	clone() Returns a shallow copy of this ConcurrentSkipListMap instance.
java.util.Comparator<? super E>	comparator()
boolean	contains(java.lang.Object key)
boolean	isEmpty() Returns true if this map contains no key-value mappings.
java.util.Iterator<E>	iterator()
boolean	offer(E key)
E	peek()
E	peekLast()
E	poll()
boolean	remove(java.lang.Object key)
int	size() Returns the number of key-value mappings in this map.
java.lang.Object[]	toArray()
<T> T[]	toArray(T[] a)

Methods inherited from class java.util.AbstractQueue

add, addAll, element, remove

Methods inherited from class java.util.AbstractCollection

containsAll, removeAll, retainAll, toString

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

containsAll, equals, hashCode, parallelStream, removeAll, removeIf, retainAll, spliterator, stream

Methods inherited from interface java.lang.Iterable

forEach

Constructor Detail

ConcurrentSkipListPriorityQueue

public ConcurrentSkipListPriorityQueue()

Constructs a new, empty map, sorted according to the natural ordering of the keys.

ConcurrentSkipListPriorityQueue

public ConcurrentSkipListPriorityQueue(java.util.Comparator<? super E> comparator)

Constructs a new, empty map, sorted according to the specified comparator.

Parameters:

comparator - the comparator that will be used to order this map. If null, the natural ordering of the keys will be used.

ConcurrentSkipListPriorityQueue

public ConcurrentSkipListPriorityQueue(java.util.Collection<? extends E> m)

Method Detail

clone

public ConcurrentSkipListPriorityQueue<E> clone()

Returns a shallow copy of this ConcurrentSkipListMap instance. (The keys and values themselves are not cloned.)

Overrides:

clone in class java.lang.Object

Returns:

a shallow copy of this map

contains

public boolean contains(java.lang.Object key)

Specified by:

contains in interface java.util.Collection<E>

Overrides:

contains in class java.util.AbstractCollection<E>

offer

public boolean offer(E key)

Specified by:

offer in interface java.util.Queue<E>

poll

public E poll()

Specified by:

poll in interface java.util.Queue<E>

peek

public E peek()

Specified by:

peek in interface java.util.Queue<E>

peekLast

public E peekLast()

iterator

public java.util.Iterator<E> iterator()

Specified by:

iterator in interface java.lang.Iterable<E>

Specified by:

iterator in interface java.util.Collection<E>

Specified by:

iterator in class java.util.AbstractCollection<E>

remove

public boolean remove(java.lang.Object key)

Specified by:

remove in interface java.util.Collection<E>

Overrides:

remove in class java.util.AbstractCollection<E>

size

public int size()

Returns the number of key-value mappings in this map. If this map contains more than Integer.MAX_VALUE elements, it returns Integer.MAX_VALUE.

Beware that, unlike in most collections, this method is NOT a constant-time operation. Because of the asynchronous nature of these maps, determining the current number of elements requires traversing them all to count them. Additionally, it is possible for the size to change during execution of this method, in which case the returned result will be inaccurate. Thus, this method is typically not very useful in concurrent applications.

Specified by:

size in interface java.util.Collection<E>

Specified by:

size in class java.util.AbstractCollection<E>

Returns:

the number of elements in this map

isEmpty

public boolean isEmpty()

Returns true if this map contains no key-value mappings.

Specified by:

isEmpty in interface java.util.Collection<E>

Overrides:

isEmpty in class java.util.AbstractCollection<E>

Returns:

true if this map contains no key-value mappings

clear

public void clear()

Removes all of the mappings from this map.

Specified by:

clear in interface java.util.Collection<E>

Overrides:

clear in class java.util.AbstractQueue<E>

comparator

public java.util.Comparator<? super E> comparator()

toArray

public java.lang.Object[] toArray()

Specified by:

toArray in interface java.util.Collection<E>

Overrides:

toArray in class java.util.AbstractCollection<E>

toArray

public <T> T[] toArray(T[] a)

Specified by:

toArray in interface java.util.Collection<E>

Overrides:

toArray in class java.util.AbstractCollection<E>