Example usage for java.util AbstractQueue subclass-usage

Introduction

In this page you can find the example usage for java.util AbstractQueue subclass-usage.

Usage

From source file CircularArrayQueueTest.java

/** 
A first-in, first-out bounded collection. 
*/
class CircularArrayQueue<E> extends AbstractQueue<E> {
    /** 
        Constructs an empty queue. 

From source file org.apache.hadoop.mapred.JobQueue.java

/**
 *
 */
class JobQueue extends AbstractQueue {

    static final Log LOG = LogFactory.getLog(JobQueue.class);

From source file LinkedTransferQueue.java

/**
 * An unbounded {@link TransferQueue} based on linked nodes.
 * This queue orders elements FIFO (first-in-first-out) with respect
 * to any given producer.  The <em>head</em> of the queue is that
 * element that has been on the queue the longest time for some
 * producer.  The <em>tail</em> of the queue is that element that has

From source file LinkedTransferQueue.java

/**
 * An unbounded <tt>TransferQueue</tt> based on linked nodes.
 * This queue orders elements FIFO (first-in-first-out) with respect
 * to any given producer.  The <em>head</em> of the queue is that
 * element that has been on the queue the longest time for some
 * producer.  The <em>tail</em> of the queue is that element that has

From source file edu.brown.cs.systems.retro.throttling.throttlingqueues.ThrottlingLockingQueue.java

/**
 * An unbounded {@linkplain BlockingQueue blocking queue} of <tt>Delayed</tt>
 * elements, in which an element can only be taken when its delay has expired.
 * The <em>head</em> of the queue is that <tt>Delayed</tt> element whose delay
 * expired furthest in the past. If no delay has expired there is no head and
 * <tt>poll</tt> will return <tt>null</tt>. Expiration occurs when an element's

From source file org.apache.hadoop.hbase.util.BoundedPriorityBlockingQueue.java

/**
 * A generic bounded blocking Priority-Queue.
 *
 * The elements of the priority queue are ordered according to the Comparator
 * provided at queue construction time.
 *

From source file org.apache.hadoop.ipc.FairCallQueue.java

/**
 * A queue with multiple levels for each priority.
 */
public class FairCallQueue<E extends Schedulable> extends AbstractQueue<E> implements BlockingQueue<E> {
    @Deprecated
    public static final int IPC_CALLQUEUE_PRIORITY_LEVELS_DEFAULT = 4;

From source file org.springframework.integration.store.MessageGroupQueue.java

/**
 * A {@link BlockingQueue} that is backed by a {@link MessageGroupStore}. Can be used to ensure guaranteed delivery in
 * the face of transaction rollback (assuming the store is transactional) and also to ensure messages are not lost if
 * the process dies (assuming the store is durable). To use the queue across process re-starts, the same group id
 * must be provided, so it needs to be unique but identifiable with a single logical instance of the queue.
 *