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