priorityqueue

priorityqueuepriorityqueue
  1. Because LinkedList isn 't new , let 's look at the new PriorityQueue class .

    因为LinkedList不是新事物,所以我们来看一下新的PriorityQueue类。

  2. The PriorityQueue class essentially maintains an ordered list .

    PriorityQueue类实质上维护了一个有序列表。

  3. In this article , I 'll look at three other changes : the updated Arrays and Collections classes and the new Queue interface , with its PriorityQueue implementation .

    在本文中,我将研究其他三个变化:更新过的Arrays和Collections类、新的Queue接口以及它的PriorityQueue实现。

  4. And , instead of creating your own subclasses , you can use one of the several built-in implementations , two of which aren 't blocking queues : PriorityQueue and ConcurrentLinkedQueue .

    而且,不必创建自己的子类,可以使用几个内置的实现,其中两个是不阻塞队列:PriorityQueue和ConcurrentLinkedQueue。