ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/main/java/util/concurrent/PriorityBlockingQueue.java
(Generate patch)

Comparing jsr166/src/main/java/util/concurrent/PriorityBlockingQueue.java (file contents):
Revision 1.108 by jsr166, Sun Jan 4 09:15:11 2015 UTC vs.
Revision 1.109 by jsr166, Tue Feb 17 18:55:39 2015 UTC

# Line 49 | Line 49 | import java.util.function.Consumer;
49   * tie-breaking to comparable elements. To use it, you would insert a
50   * {@code new FIFOEntry(anEntry)} instead of a plain entry object.
51   *
52 < *  <pre> {@code
52 > * <pre> {@code
53   * class FIFOEntry<E extends Comparable<? super E>>
54   *     implements Comparable<FIFOEntry<E>> {
55   *   static final AtomicLong seq = new AtomicLong(0);
# Line 799 | Line 799 | public class PriorityBlockingQueue<E> ex
799       * The following code can be used to dump the queue into a newly
800       * allocated array of {@code String}:
801       *
802 <     *  <pre> {@code String[] y = x.toArray(new String[0]);}</pre>
802 >     * <pre> {@code String[] y = x.toArray(new String[0]);}</pre>
803       *
804       * Note that {@code toArray(new Object[0])} is identical in function to
805       * {@code toArray()}.

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines