Java java.util.concurrent PriorityBlockingQueue fields, constructors, methods, implement or subclass

Example usage for Java java.util.concurrent PriorityBlockingQueue fields, constructors, methods, implement or subclass

Introduction

In this page you can find the methods, fields and constructors for java.util.concurrent PriorityBlockingQueue.

The text is from its open source code.

java.util.concurrent.PriorityBlockingQueue has subclasses.
Click this link to see all its subclasses.

int	size The number of elements in the priority queue.

	PriorityBlockingQueue(int initialCapacity) Creates a PriorityBlockingQueue with the specified initial capacity that orders its elements according to their Comparable natural ordering .
	PriorityBlockingQueue(Collection c) Creates a PriorityBlockingQueue containing the elements in the specified collection.
	PriorityBlockingQueue() Creates a PriorityBlockingQueue with the default initial capacity (11) that orders its elements according to their Comparable natural ordering .
	PriorityBlockingQueue(int initialCapacity, Comparator comparator) Creates a PriorityBlockingQueue with the specified initial capacity that orders its elements according to the specified comparator.

boolean	add(E e) Inserts the specified element into this priority queue.
void	clear() Atomically removes all of the elements from this queue.
boolean	isEmpty() Returns true if this collection contains no elements.
boolean	offer(E e) Inserts the specified element into this priority queue.
E	poll()