Fix new line breaks on }

test/dart_codegen/expect/_internal/sort.dart

 part of dart._internal;
  class Sort {static const int _INSERTION_SORT_THRESHOLD = 32;
  static void sort(List a, int compare(a, b)) {
   _doSort(a, 0, a.length - 1, compare);
   }
  static void sortRange(List a, int from, int to, int compare(a, b)) {
   if ((from < 0) || (to > a.length) || (to < from)) {
     throw "OutOfRange";
     }
    _doSort(a, from, to - 1, compare);
   }
  static void _doSort(List a, int left, int right, int compare(a, b)) {
   if ((right - left) <= _INSERTION_SORT_THRESHOLD) {
     _insertionSort(a, left, right, compare);
     }
    else {
     _dualPivotQuicksort(a, left, right, compare);
     }
   }
  static void _insertionSort(List a, int left, int right, int compare(a, b)) {
-  for (int i = left + 1;
-   i <= right;
-   i++) {
+  for (int i = left + 1; i <= right; i++) {
     var el = a[i];
      int j = i;
      while ((j > left) && (compare(a[j - 1], el) > 0)) {
       a[j] = a[j - 1];
        j--;
       }
      a[j] = el;
     }
   }
  static void _dualPivotQuicksort(List a, int left, int right, int compare(a, b)) {
@@ skipping 58 matching lines @@
    a[index1] = el1;
    a[index3] = el3;
    a[index5] = el5;
    a[index2] = a[left];
    a[index4] = a[right];
    int less = left + 1;
    int great = right - 1;
    bool pivots_are_equal = (compare(pivot1, pivot2) == 0);
    if (pivots_are_equal) {
     var pivot = pivot1;
-     for (int k = less;
-     k <= great;
-     k++) {
+     for (int k = less; k <= great; k++) {
       var ak = a[k];
        int comp = compare(ak, pivot);
        if (comp == 0) continue;
        if (comp < 0) {
         if (k != less) {
           a[k] = a[less];
            a[less] = ak;
           }
          less++;
         }
@@ skipping 13 matching lines @@
            else {
             a[k] = a[great];
              a[great--] = ak;
              break;
             }
           }
         }
       }
     }
    else {
-    for (int k = less;
-     k <= great;
-     k++) {
+    for (int k = less; k <= great; k++) {
       var ak = a[k];
        int comp_pivot1 = compare(ak, pivot1);
        if (comp_pivot1 < 0) {
         if (k != less) {
           a[k] = a[less];
            a[less] = ak;
           }
          less++;
         }
        else {
@@ skipping 32 matching lines @@
    _doSort(a, great + 2, right, compare);
    if (pivots_are_equal) {
     return;}
    if (less < index1 && great > index5) {
     while (compare(a[less], pivot1) == 0) {
       less++;
       }
      while (compare(a[great], pivot2) == 0) {
       great--;
       }
-     for (int k = less;
-     k <= great;
-     k++) {
+     for (int k = less; k <= great; k++) {
       var ak = a[k];
        int comp_pivot1 = compare(ak, pivot1);
        if (comp_pivot1 == 0) {
         if (k != less) {
           a[k] = a[less];
            a[less] = ak;
           }
          less++;
         }
        else {
@@ skipping 23 matching lines @@
           }
         }
       }
      _doSort(a, less, great, compare);
     }
    else {
     _doSort(a, less, great, compare);
     }
   }
 }