/**@class java.util.concurrent.LinkedBlockingQueue
 implements java.util.concurrent.BlockingQueue

 implements java.io.Serializable

@extends java.util.AbstractQueue

 An optionally-bounded {@linkplain java.util.concurrent.BlockingQueue blocking queue} based on
 linked nodes.
 This queue orders elements FIFO (first-in-first-out).
 The <em>head</em> of the queue is that element that has been on the
 queue the longest time.
 The <em>tail</em> of the queue is that element that has been on the
 queue the shortest time. New elements
 are inserted at the tail of the queue, and the queue retrieval
 operations obtain elements at the head of the queue.
 Linked queues typically have higher throughput than array-based queues but
 less predictable performance in most concurrent applications.

 <p>The optional capacity bound constructor argument serves as a
 way to prevent excessive queue expansion. The capacity, if unspecified,
 is equal to {@link Integer#MAX_VALUE}.  Linked nodes are
 dynamically created upon each insertion unless this would bring the
 queue above capacity.

 <p>This class and its iterator implement all of the
 <em>optional</em> methods of the {@link Collection} and {@link Iterator} interfaces.

 @since 1.5
 @author Doug Lea
 @param <E> the type of elements held in this queue
*/
var LinkedBlockingQueue = {

/**Returns the number of elements in this queue.
@return {Number} the number of elements in this queue
*/
size : function(  ) {},

/**Returns the number of additional elements that this queue can ideally
 (in the absence of memory or resource constraints) accept without
 blocking. This is always equal to the initial capacity of this queue
 less the current {@code size} of this queue.

 <p>Note that you <em>cannot</em> always tell if an attempt to insert
 an element will succeed by inspecting {@code remainingCapacity}
 because it may be the case that another thread is about to
 insert or remove an element.
*/
remainingCapacity : function(  ) {},

/**Inserts the specified element at the tail of this queue, waiting if
 necessary for space to become available.
@throws InterruptedException {@inheritDoc}
@throws NullPointerException {@inheritDoc}
*/
put : function(  ) {},

/**Inserts the specified element at the tail of this queue, waiting if
 necessary up to the specified wait time for space to become available.
@return {Boolean} {@code true} if successful, or {@code false} if
         the specified waiting time elapses before space is available
@throws InterruptedException {@inheritDoc}
@throws NullPointerException {@inheritDoc}
*/
offer : function(  ) {},

/**Inserts the specified element at the tail of this queue if it is
 possible to do so immediately without exceeding the queue's capacity,
 returning {@code true} upon success and {@code false} if this queue
 is full.
 When using a capacity-restricted queue, this method is generally
 preferable to method {@link java.util.concurrent.BlockingQueue#add add}, which can fail to
 insert an element only by throwing an exception.
@throws NullPointerException if the specified element is null
*/
offer : function(  ) {},

/**
*/
take : function(  ) {},

/**
*/
poll : function(  ) {},

/**
*/
poll : function(  ) {},

/**
*/
peek : function(  ) {},

/**Removes a single instance of the specified element from this queue,
 if it is present.  More formally, removes an element {@code e} such
 that {@code o.equals(e)}, if this queue contains one or more such
 elements.
 Returns {@code true} if this queue contained the specified element
 (or equivalently, if this queue changed as a result of the call).
@param {Object {Object}} o element to be removed from this queue, if present
@return {Boolean} {@code true} if this queue changed as a result of the call
*/
remove : function(  ) {},

/**Returns {@code true} if this queue contains the specified element.
 More formally, returns {@code true} if and only if this queue contains
 at least one element {@code e} such that {@code o.equals(e)}.
@param {Object {Object}} o object to be checked for containment in this queue
@return {Boolean} {@code true} if this queue contains the specified element
*/
contains : function(  ) {},

/**Returns an array containing all of the elements in this queue, in
 proper sequence.

 <p>The returned array will be "safe" in that no references to it are
 maintained by this queue.  (In other words, this method must allocate
 a new array).  The caller is thus free to modify the returned array.

 <p>This method acts as bridge between array-based and collection-based
 APIs.
@return {Object {java.lang.Object}} an array containing all of the elements in this queue
*/
toArray : function(  ) {},

/**Returns an array containing all of the elements in this queue, in
 proper sequence; the runtime type of the returned array is that of
 the specified array.  If the queue fits in the specified array, it
 is returned therein.  Otherwise, a new array is allocated with the
 runtime type of the specified array and the size of this queue.

 <p>If this queue fits in the specified array with room to spare
 (i.e., the array has more elements than this queue), the element in
 the array immediately following the end of the queue is set to
 {@code null}.

 <p>Like the {@link #toArray}() method, this method acts as bridge between
 array-based and collection-based APIs.  Further, this method allows
 precise control over the runtime type of the output array, and may,
 under certain circumstances, be used to save allocation costs.

 <p>Suppose {@code x} is a queue known to contain only strings.
 The following code can be used to dump the queue into a newly
 allocated array of {@code String}:

 <pre> {@code String[] y = x.toArray(new String[0]);}</pre>

 Note that {@code toArray(new Object[0])} is identical in function to
 {@code toArray()}.
@param {Object {java.lang.Object[]}} a the array into which the elements of the queue are to
          be stored, if it is big enough; otherwise, a new array of the
          same runtime type is allocated for this purpose
@return {Object {java.lang.Object}} an array containing all of the elements in this queue
@throws ArrayStoreException if the runtime type of the specified array
         is not a supertype of the runtime type of every element in
         this queue
@throws NullPointerException if the specified array is null
*/
toArray : function(  ) {},

/**
*/
toString : function(  ) {},

/**Atomically removes all of the elements from this queue.
 The queue will be empty after this call returns.
*/
clear : function(  ) {},

/**
@throws UnsupportedOperationException {@inheritDoc}
@throws ClassCastException            {@inheritDoc}
@throws NullPointerException          {@inheritDoc}
@throws IllegalArgumentException      {@inheritDoc}
*/
drainTo : function(  ) {},

/**
@throws UnsupportedOperationException {@inheritDoc}
@throws ClassCastException            {@inheritDoc}
@throws NullPointerException          {@inheritDoc}
@throws IllegalArgumentException      {@inheritDoc}
*/
drainTo : function(  ) {},

/**Returns an iterator over the elements in this queue in proper sequence.
 The elements will be returned in order from first (head) to last (tail).

 <p>The returned iterator is
 <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.
@return {Object {java.util.Iterator}} an iterator over the elements in this queue in proper sequence
*/
iterator : function(  ) {},

/**Returns a {@link Spliterator} over the elements in this queue.

 <p>The returned spliterator is
 <a href="package-summary.html#Weakly"><i>weakly consistent</i></a>.

 <p>The {@code Spliterator} reports {@link Spliterator#CONCURRENT},
 {@link Spliterator#ORDERED}, and {@link Spliterator#NONNULL}.
@implNote The {@code Spliterator} implements {@code trySplit} to permit limited
 parallelism.
@return {Object {java.util.Spliterator}} a {@code Spliterator} over the elements in this queue
@since 1.8
*/
spliterator : function(  ) {},


};