| Index: packages/collection/lib/priority_queue.dart
|
| diff --git a/packages/collection/lib/priority_queue.dart b/packages/collection/lib/priority_queue.dart
|
| index efb3239027b38ff953a0b6356d9c5da806902fcf..e1a01777119884731eb24b2dc0aa9cc161225490 100644
|
| --- a/packages/collection/lib/priority_queue.dart
|
| +++ b/packages/collection/lib/priority_queue.dart
|
| @@ -275,7 +275,7 @@ class HeapPriorityQueue<E> implements PriorityQueue<E> {
|
| */
|
| 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.
|
|
|