Java com.google.common.collect Queues fields, constructors, methods, implement or subclass

Example usage for Java com.google.common.collect Queues fields, constructors, methods, implement or subclass

  1. HOME
  2. Java
  3. com.google.common
  4. com.google.common.collect.*
  5. Queues

Introduction

In this page you can find the methods, fields and constructors for com.google.common.collect Queues.

The text is from its open source code.

Method

ArrayBlockingQueuenewArrayBlockingQueue(int capacity)
Creates an empty ArrayBlockingQueue with the given (fixed) capacity and nonfair access policy.
ArrayDequenewArrayDeque(Iterable elements)
Creates an ArrayDeque containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.
ArrayDequenewArrayDeque()
Creates an empty ArrayDeque .
ConcurrentLinkedQueuenewConcurrentLinkedQueue()
Creates an empty ConcurrentLinkedQueue .
ConcurrentLinkedQueuenewConcurrentLinkedQueue(Iterable elements)
Creates a ConcurrentLinkedQueue containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.
LinkedBlockingDequenewLinkedBlockingDeque(int capacity)
Creates an empty LinkedBlockingDeque with the given (fixed) capacity.
LinkedBlockingDequenewLinkedBlockingDeque(Iterable elements)
Creates a LinkedBlockingDeque with a capacity of Integer#MAX_VALUE , containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.
LinkedBlockingDequenewLinkedBlockingDeque()
Creates an empty LinkedBlockingDeque with a capacity of Integer#MAX_VALUE .
LinkedBlockingQueuenewLinkedBlockingQueue()
Creates an empty LinkedBlockingQueue with a capacity of Integer#MAX_VALUE .
LinkedBlockingQueuenewLinkedBlockingQueue(int capacity)
Creates an empty LinkedBlockingQueue with the given (fixed) capacity.
LinkedBlockingQueuenewLinkedBlockingQueue(Iterable elements)
Creates a LinkedBlockingQueue with a capacity of Integer#MAX_VALUE , containing the elements of the specified iterable, in the order they are returned by the iterable's iterator.
PriorityQueuenewPriorityQueue()
Creates an empty PriorityQueue with the ordering given by its elements' natural ordering.
DequesynchronizedDeque(Deque deque)
Returns a synchronized (thread-safe) deque backed by the specified deque.
QueuesynchronizedQueue(Queue queue)
Returns a synchronized (thread-safe) queue backed by the specified queue.