Adapt private variables with trailing underscores.

sdk/lib/_collection_dev/sort.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of dart._collection.dev;
 
 /**
  * Dual-Pivot Quicksort algorithm.
  *
  * This class implements the dual-pivot quicksort algorithm as presented in
@@ skipping 36 matching lines @@
       throw "OutOfRange";
     }
     _doSort(a, from, to - 1, compare);
   }
 
   /**
    * Sorts the list in the interval [:left:] to [:right:] (both inclusive).
    */
   static void _doSort(List a, int left, int right, int compare(a, b)) {
     if ((right - left) <= _INSERTION_SORT_THRESHOLD) {
-      insertionSort_(a, left, right, compare);
+      _insertionSort(a, left, right, compare);
     } else {
       _dualPivotQuicksort(a, left, right, compare);
     }
   }
 
-  static void insertionSort_(List a, int left, int right, int compare(a, b)) {
+  static void _insertionSort(List a, int left, int right, int compare(a, b)) {
     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;
     }
   }
@@ skipping 261 matching lines @@
     } else {
       // The second partition looks as follows:
       // [  *  |  >= pivot1 && <= pivot2  | * ]
       //        ^                        ^
       //       less                    great
       // Simply sort it by recursive descent.
       _doSort(a, less, great, compare);
     }
   }
 }