List of usage examples for java.util Queue interface-usage
From source file org.apache.hama.bsp.FCFSQueue.java
class FCFSQueue implements Queue<JobInProgress> { public static final Log LOG = LogFactory.getLog(FCFSQueue.class); private final String name; private BlockingQueue<JobInProgress> queue = new LinkedBlockingQueue<JobInProgress>();
From source file org.archive.queue.MemQueue.java
/** An in-memory implementation of a {@link Queue}. * * @author Gordon Mohr * */ public class MemQueue<T> extends LinkedList<T> implements Queue<T> {
From source file com.cyberway.issue.queue.MemQueue.java
/** An in-memory implementation of a {@link Queue}. * * @author Gordon Mohr * */ public class MemQueue<T> extends LinkedList<T> implements Queue<T> {
From source file edu.uci.ics.jung.algorithms.util.MapBinaryHeap.java
/**
* An array-based binary heap implementation of a priority queue,
* which also provides
* efficient <code>update()</code> and <code>contains</code> operations.
* It contains extra infrastructure (a hash table) to keep track of the
* position of each element in the array; thus, if the key value of an element
From source file com.chinamobile.bcbsp.bspcontroller.FCFSQueue.java
/** * first come first service queue for processing,finished and failed jobs. * @author hadoop */ class FCFSQueue implements Queue<JobInProgress> { /** log file for FCFSQueue */
From source file BinaryHeapQueue.java
public class BinaryHeapQueue implements Queue, Externalizable { /** The default capacity for a binary heap. */ private final static int DEFAULT_CAPACITY = 13; /** The comparator used to order the elements */ private Comparator comparator;
From source file org.deeplearning4j.util.DiskBasedQueue.java
/** * Naive disk based queue for storing items on disk. * Only meant for poll and adding items. * @author Adam Gibson */ public class DiskBasedQueue<E> implements Queue<E>, Serializable {
From source file com.chinamobile.bcbsp.bspcontroller.HRNQueue.java
/** * High response ratio job waitQueues * @author hadoop * */ public class HRNQueue implements Queue<JobInProgress> {
From source file ShortPriorityQueue.java
/**
* A {@code ShortPriorityQueue<E>} is a length-bounded priority queue
* optimized for short lengths. Rather than maintaining tree or heap
* data structures, it keeps elements in an array and uses a simple
* bubble sort.
*
From source file net.javacoding.queue.DiskBackedQueue.java
/**
* Queue which uses a DiskQueue ('tailQ') for spillover entries once a in-memory
* LinkedList ('headQ') reaches a maximum size.
*
* @author Gordon Mohr
*/