Index: lib/src/priority_queue.dart |
diff --git a/lib/src/priority_queue.dart b/lib/src/priority_queue.dart |
index 64fd84f03bea8a0dae8124a07f7b03ccf2a43bbf..2367428de607b20c5b196a96e9f747b50e49c845 100644 |
--- a/lib/src/priority_queue.dart |
+++ b/lib/src/priority_queue.dart |
@@ -121,7 +121,7 @@ class HeapPriorityQueue<E> implements PriorityQueue<E> { |
static const int _INITIAL_CAPACITY = 7; |
/// The comparison being used to compare the priority of elements. |
- final Comparator comparison; |
+ final Comparator<E> comparison; |
/// List implementation of a heap. |
List<E> _queue = new List<E>(_INITIAL_CAPACITY); |