| OLD | NEW |
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 part of dart.core; |
| 6 |
| 5 // TODO(ajohnsen): Remove once dart2js intercepters can work without it. | 7 // TODO(ajohnsen): Remove once dart2js intercepters can work without it. |
| 6 /** | 8 /** |
| 7 * WARNING: This method is temporary and will go away soon. | 9 * WARNING: This method is temporary and will go away soon. |
| 8 */ | 10 */ |
| 9 void coreSort(List l, int compare(a, b)) => _Sort.sort(l, compare); | 11 void coreSort(List l, int compare(a, b)) => _Sort.sort(l, compare); |
| 10 | 12 |
| 11 /** | 13 /** |
| 12 * Dual-Pivot Quicksort algorithm. | 14 * Dual-Pivot Quicksort algorithm. |
| 13 * | 15 * |
| 14 * This class implements the dual-pivot quicksort algorithm as presented in | 16 * This class implements the dual-pivot quicksort algorithm as presented in |
| (...skipping 324 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 339 } else { | 341 } else { |
| 340 // The second partition looks as follows: | 342 // The second partition looks as follows: |
| 341 // [ * | >= pivot1 && <= pivot2 | * ] | 343 // [ * | >= pivot1 && <= pivot2 | * ] |
| 342 // ^ ^ | 344 // ^ ^ |
| 343 // less great | 345 // less great |
| 344 // Simply sort it by recursive descent. | 346 // Simply sort it by recursive descent. |
| 345 _doSort(a, less, great, compare); | 347 _doSort(a, less, great, compare); |
| 346 } | 348 } |
| 347 } | 349 } |
| 348 } | 350 } |
| OLD | NEW |