Optimize successive calls SourceFile.getLine().

lib/src/utils.dart

Index: lib/src/utils.dart
diff --git a/lib/src/utils.dart b/lib/src/utils.dart
index 2d3386542dceb182631363fe3e4041deacb92bee..fa0895784f2685639b311fe14b22d79a6429e9f7 100644
--- a/lib/src/utils.dart
+++ b/lib/src/utils.dart
@@ -14,29 +14,6 @@ Comparable min(Comparable obj1, Comparable obj2) =>
 Comparable max(Comparable obj1, Comparable obj2) =>
     obj1.compareTo(obj2) > 0 ? obj1 : obj2;
 
-/// Find the first entry in a sorted [list] that matches a monotonic predicate.
-///
-/// Given a result `n`, that all items before `n` will not match, `n` matches,
-/// and all items after `n` match too. The result is -1 when there are no
-/// items, 0 when all items match, and list.length when none does.
-int binarySearch(List list, bool matches(item)) {
-  if (list.length == 0) return -1;
-  if (matches(list.first)) return 0;
-  if (!matches(list.last)) return list.length;
-
-  int min = 0;
-  int max = list.length - 1;
-  while (min < max) {
-    var half = min + ((max - min) ~/ 2);
-    if (matches(list[half])) {
-      max = half;
-    } else {
-      min = half + 1;
-    }
-  }
-  return max;
-}
-
 /// Finds a line in [context] containing [text] at the specified [column].
 ///
 /// Returns the index in [context] where that line begins, or null if none