Roll Observatory deps (charted -> ^0.3.0)

packages/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 257 matching lines @@
     _bubbleUp(element, _length++);
   }
 
   /**
    * Find the index of an object in the heap.
    *
    * Returns -1 if the object is not found.
    */
   int _locate(E object) {
     if (_length == 0) return -1;
-    // Count positions from one instad of zero. This gives the numbers
+    // Count positions from one instead of zero. This gives the numbers
     // some nice properties. For example, all right children are odd,
     // their left sibling is even, and the parent is found by shifting
     // right by one.
     // Valid range for position is [1.._length], inclusive.
     int position = 1;
     // Pre-order depth first search, omit child nodes if the current
     // node has lower priority than [object], because all nodes lower
     // in the heap will also have lower priority.
     do {
       int index = position - 1;
@@ skipping 98 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;
   }
 }