jdk.util.concurrent.PriorityBlockingQueue

Liking cljdoc? Tell your friends :D

Clojure only.

->priority-blocking-queue
add
clear
comparator
contains
drain-to
iterator
offer
peek
poll
put
remaining-capacity
remove
size
spliterator
take
to-array
to-string

An unbounded java.util.concurrent.blocking queue that uses the same ordering rules as class PriorityQueue and supplies blocking retrieval operations. 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 java.lang.natural ordering also does not permit insertion of non-comparable objects (doing so results in ClassCastException).

This class and its iterator implement all of the optional methods of the Collection and Iterator interfaces. The Iterator provided in method iterator() is not guaranteed to traverse the elements of the PriorityBlockingQueue in any particular order. If you need ordered traversal, consider using Arrays.sort(pq.toArray()). Also, method drainTo can be used to remove some or all elements in priority order and place them in another collection.

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. For example, here is a class that applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a new FIFOEntry(anEntry) instead of a plain entry object.

class FIFOEntry<E extends Comparable<? super E>> implements Comparable<FIFOEntry<E>> { static final AtomicLong seq = new AtomicLong(0); final long seqNum; final E entry; public FIFOEntry(E entry) { seqNum = seq.getAndIncrement(); this.entry = entry; } public E getEntry() { return entry; } public int compareTo(FIFOEntry<E> other) { int res = entry.compareTo(other.entry); if (res == 0 && other.entry != this.entry) res = (seqNum < other.seqNum ? -1 : 1); return res; } }

This class is a member of the

Java Collections Framework.

An unbounded java.util.concurrent.blocking queue that uses
the same ordering rules as class PriorityQueue and supplies
blocking retrieval operations.  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 java.lang.natural ordering also does not permit insertion of
non-comparable objects (doing so results in
ClassCastException).

This class and its iterator implement all of the
optional methods of the Collection and Iterator interfaces.  The Iterator provided in method iterator() is not guaranteed to traverse the elements of
the PriorityBlockingQueue in any particular order. If you need
ordered traversal, consider using
Arrays.sort(pq.toArray()).  Also, method drainTo
can be used to remove some or all elements in priority
order and place them in another collection.

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.  For
example, here is a class that applies first-in-first-out
tie-breaking to comparable elements. To use it, you would insert a
new FIFOEntry(anEntry) instead of a plain entry object.



class FIFOEntry<E extends Comparable<? super E>>
    implements Comparable<FIFOEntry<E>> {
  static final AtomicLong seq = new AtomicLong(0);
  final long seqNum;
  final E entry;
  public FIFOEntry(E entry) {
    seqNum = seq.getAndIncrement();
    this.entry = entry;
  }
  public E getEntry() { return entry; }
  public int compareTo(FIFOEntry<E> other) {
    int res = entry.compareTo(other.entry);
    if (res == 0 && other.entry != this.entry)
      res = (seqNum < other.seqNum ? -1 : 1);
    return res;
  }
}

This class is a member of the

Java Collections Framework.

jdk.util.concurrent.PriorityBlockingQueue

->priority-blocking-queueclj

addclj

clearclj

comparatorclj

containsclj

drain-toclj

iteratorclj

offerclj

peekclj

pollclj

putclj

remaining-capacityclj

removeclj

sizeclj

spliteratorclj

takeclj

to-arrayclj

to-stringclj

->priority-blocking-queue^clj

add^clj

clear^clj

comparator^clj

contains^clj

drain-to^clj

iterator^clj

offer^clj

peek^clj

poll^clj

put^clj

remaining-capacity^clj

remove^clj

size^clj

spliterator^clj

take^clj

to-array^clj

to-string^clj