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 | |
7 // TODO(ajohnsen): Remove once dart2js intercepters can work without it. | 5 // TODO(ajohnsen): Remove once dart2js intercepters can work without it. |
8 /** | 6 /** |
9 * WARNING: This method is temporary and will go away soon. | 7 * WARNING: This method is temporary and will go away soon. |
10 */ | 8 */ |
11 void coreSort(List l, int compare(a, b)) => _Sort.sort(l, compare); | 9 void coreSort(List l, int compare(a, b)) => _Sort.sort(l, compare); |
12 | 10 |
13 /** | 11 /** |
14 * Dual-Pivot Quicksort algorithm. | 12 * Dual-Pivot Quicksort algorithm. |
15 * | 13 * |
16 * This class implements the dual-pivot quicksort algorithm as presented in | 14 * This class implements the dual-pivot quicksort algorithm as presented in |
(...skipping 324 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
341 } else { | 339 } else { |
342 // The second partition looks as follows: | 340 // The second partition looks as follows: |
343 // [ * | >= pivot1 && <= pivot2 | * ] | 341 // [ * | >= pivot1 && <= pivot2 | * ] |
344 // ^ ^ | 342 // ^ ^ |
345 // less great | 343 // less great |
346 // Simply sort it by recursive descent. | 344 // Simply sort it by recursive descent. |
347 _doSort(a, less, great, compare); | 345 _doSort(a, less, great, compare); |
348 } | 346 } |
349 } | 347 } |
350 } | 348 } |
OLD | NEW |