| 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.collection.dev; | 5 part of dart._collection.dev; |
| 6 | 6 |
| 7 /** | 7 /** |
| 8 * Dual-Pivot Quicksort algorithm. | 8 * Dual-Pivot Quicksort algorithm. |
| 9 * | 9 * |
| 10 * This class implements the dual-pivot quicksort algorithm as presented in | 10 * This class implements the dual-pivot quicksort algorithm as presented in |
| 11 * Vladimir Yaroslavskiy's paper. | 11 * Vladimir Yaroslavskiy's paper. |
| 12 * | 12 * |
| 13 * Some improvements have been copied from Android's implementation. | 13 * Some improvements have been copied from Android's implementation. |
| 14 */ | 14 */ |
| 15 class Sort { | 15 class Sort { |
| (...skipping 319 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 335 } else { | 335 } else { |
| 336 // The second partition looks as follows: | 336 // The second partition looks as follows: |
| 337 // [ * | >= pivot1 && <= pivot2 | * ] | 337 // [ * | >= pivot1 && <= pivot2 | * ] |
| 338 // ^ ^ | 338 // ^ ^ |
| 339 // less great | 339 // less great |
| 340 // Simply sort it by recursive descent. | 340 // Simply sort it by recursive descent. |
| 341 _doSort(a, less, great, compare); | 341 _doSort(a, less, great, compare); |
| 342 } | 342 } |
| 343 } | 343 } |
| 344 } | 344 } |
| OLD | NEW |