Examples of edu.emory.mathcs.backport.java.util.PriorityQueue

Package edu.emory.mathcs.backport.java.util

Examples of edu.emory.mathcs.backport.java.util.PriorityQueue

edu.emory.mathcs.backport.java.util.PriorityQueue
An unbounded {@linkplain Queue queue} that supports element retrievalin the order of relative priority. The ordering can be defined via an explicit comparator; otherwise, the natural ordering of elements is used. Element at the head of the queue is always the smallest one according to the given ordering.
While this queue is logically unbounded, attempted additions may fail due to resource exhaustion (causing OutOfMemoryError). This class does not permit null elements. A priority queue relying on {@linkplain Comparable natural ordering} also does not permit insertion ofnon-comparable objects (doing so results in ClassCastException).
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces. The Iterator provided in method {@link #iterator()} is not guaranteed to traverse the elements ofthe PriorityQueue in any particular order. If you need ordered traversal, consider using Arrays.sort(pq.toArray()).
Operations on this class make no guarantees about the ordering of elements with equal priority. If you need to enforce an ordering, you can define custom classes or comparators that use a secondary key to break ties in primary priority values. See {@link edu.emory.mathcs.backport.java.util.concurrent.PriorityBlockingQueue}for an example.
Implementation note: basic mutative methods (insert, offer, remove, poll etc) have complexity O(log(n)). Parameterless inspection methods (peek, element,isEmpty) have complexity O(1). Methods contains(Object) and remove(Object) have complexity O(n). @since 1.5 @author Dawid Kurzyniec


    protected AbstractBoundedEventHeap(int capacity, EventQueueOverflowStrategy overflowStrategy, Object lock, Comparator comparator)
    {
        super(capacity, overflowStrategy, lock);


        heap_ = new PriorityQueue(capacity, comparator);
    }

View Full Code Here


    protected AbstractBoundedEventHeap(int capacity, EventQueueOverflowStrategy overflowStrategy, Object lock, Comparator comparator)
    {
        super(capacity, overflowStrategy, lock);
        
        heap_ = new PriorityQueue(capacity, comparator);
    }

View Full Code Here

     * capacity
     * (11) that orders its elements according to their natural
     * ordering (using <tt>Comparable</tt>).
     */
    public PriorityBlockingQueue() {
        q = new PriorityQueue();
    }

View Full Code Here

     * @param initialCapacity the initial capacity for this priority queue.
     * @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
     * than 1
     */
    public PriorityBlockingQueue(int initialCapacity) {
        q = new PriorityQueue(initialCapacity, null);
    }

View Full Code Here

     * ordering.
     * @throws IllegalArgumentException if <tt>initialCapacity</tt> is less
     * than 1
     */
    public PriorityBlockingQueue(int initialCapacity, Comparator comparator) {
        q = new PriorityQueue(initialCapacity, comparator);
    }

View Full Code Here

     *         queue's ordering.
     * @throws NullPointerException if <tt>c</tt> or any element within it
     * is <tt>null</tt>
     */
    public PriorityBlockingQueue(Collection c) {
        q = new PriorityQueue(c);
    }

View Full Code Here

     * @param priority The order of this item in comparison to others
     * @param parent   The menu to go to when the "Previous" item is selected
     */
    public LauncherMenu(String name, int priority, LauncherMenu parent) {
        super(name, priority);
        mItems = new PriorityQueue();
        mParent = parent;
        setHasArrow(true);
    }

View Full Code Here

     * Converts the list of menu items into a dialog containing the items.
     */
    public void initMenu() {
        mDialog = new MenuDialog(getCurrentAppId());
        mDialog.setTitle(this.getValue());
        PriorityQueue copy = new PriorityQueue();
        while (!mItems.isEmpty()) {
            LauncherAction item = (LauncherAction) mItems.remove();
            if (item.hasArrow())
                mDialog.addActionWithIndicator(item);
            else
                mDialog.addAction(item);
            copy.add(item);
        }
        if (mParent != null) {
            mParent.putValue(Action.NAME, "« Previous");
            mDialog.addAction(mParent);
        }

View Full Code Here

TOP

Related Classes of edu.emory.mathcs.backport.java.util.PriorityQueue

com.yifanlu.Kindle.LauncherMenu

edu.emory.mathcs.backport.java.util.concurrent.PriorityBlockingQueue

org.jacorb.notification.queue.AbstractBoundedEventHeap

java.util.ArrayList

java.util.ConcurrentModificationException

java.util.SortedSet

java.util.NoSuchElementException

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.