OLD | NEW |
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 library dart.pkg.collection.priority_queue; | 5 library dart.pkg.collection.priority_queue; |
6 | 6 |
7 import "dart:collection" show SplayTreeSet; | 7 import "dart:collection" show SplayTreeSet; |
8 | 8 |
9 /** | 9 /** |
10 * A priority queue is a priority based work-list of elements. | 10 * A priority queue is a priority based work-list of elements. |
(...skipping 376 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
387 * Called when the list is full. | 387 * Called when the list is full. |
388 */ | 388 */ |
389 void _grow() { | 389 void _grow() { |
390 int newCapacity = _queue.length * 2 + 1; | 390 int newCapacity = _queue.length * 2 + 1; |
391 if (newCapacity < _INITIAL_CAPACITY) newCapacity = _INITIAL_CAPACITY; | 391 if (newCapacity < _INITIAL_CAPACITY) newCapacity = _INITIAL_CAPACITY; |
392 List<E> newQueue = new List<E>(newCapacity); | 392 List<E> newQueue = new List<E>(newCapacity); |
393 newQueue.setRange(0, _length, _queue); | 393 newQueue.setRange(0, _length, _queue); |
394 _queue = newQueue; | 394 _queue = newQueue; |
395 } | 395 } |
396 } | 396 } |
OLD | NEW |