anchor.diff:     *
      * See [:sort:] for requirements of the [:compare:] function.
      */
  -  static void sortRange(List a, int from, int to, int compare(a, b)) {
  +  static void sortRange/*<E>*/(List/*<E>*/ a, int from, int to, int compare(dynamic /*=E*/ a, dynamic /*=E*/ b)) {
       if ((from < 0) || (to > a.length) || (to < from)) {
         throw "OutOfRange";
       }
  
positive.code:     }
    }
  
    static void _dualPivotQuicksort(List a,
                                    int left, int right,
                                    int compare(a, b)) {
      assert(right - left > _INSERTION_SORT_THRESHOLD);
  
      // Compute the two pivots by looking at 5 elements.
  
negative.code:     }
    }
  
    static void _insertionSort/*<E>*/(List/*<E>*/ a, int left, int right, int compare(dynamic /*=E*/ a, dynamic /*=E*/ b)) {
      for (int i = left + 1; i <= right; i++) {
        var el = a[i];
        int j = i;
  