Add missing signatures for add and addAll to priority queue.

pkg/collection/lib/priority_queue.dart

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library dart.pkg.collection.priority_queue;
 
 import "dart:collection" show SplayTreeSet;
 
 /**
  * A priority queue is a priority based work-list of elements.
@@ skipping 17 matching lines @@
   bool get isNotEmpty;
 
   /**
    * Checks if [object] is in the queue.
    *
    * Returns true if the element is found.
    */
   bool contains(E object);
 
   /**
+   * Adds element to the queue.
+   *
+   * The element will become the next to be removed by [removeFirst]
+   * when all elements with higher priority have been removed.
+   */
+  void add(E element);
+
+  /**
+   * Adds all [elements] to the queue.
+   */
+  void addAll(Iterable<E> elements);
+
+  /**
    * Returns the next element that will be returned by [removeFirst].
    *
    * The element is not removed from the queue.
    *
    * The queue must not be empty when this method is called.
    */
   E get first;
 
   /**
    * Removes and returns the element with the highest priority.
    *
    * Repeatedly calling this method, without adding element in between,
    * is guaranteed to return elements in non-decreasing order as, specified by
    * [comparison].
    *
    * The queue must not be empty when this method is called.
    */
   E removeFirst();
 
   /**
    * Removes an element that compares equal to [element] in the queue.
    *
    * Returns true if an element is found and removed,
-   * and false if not equal element is found.
+   * and false if no equal element is found.
    */
   bool remove(E element);
 
   /**
    * Removes all the elements from this queue and returns them.
    *
    * The returned iterable has no specified order.
    */
   Iterable<E> removeAll();
 
@@ skipping 302 matching lines @@
    * Called when the list is full.
    */
   void _grow() {
     int newCapacity = _queue.length * 2 + 1;
     if (newCapacity < _INITIAL_CAPACITY) newCapacity = _INITIAL_CAPACITY;
     List<E> newQueue = new List<E>(newCapacity);
     newQueue.setRange(0, _length, _queue);
     _queue = newQueue;
   }
 }