Chromium Code Reviews| Index: lib/core/sort.dart |
| diff --git a/lib/coreimpl/dual_pivot_quicksort.dart b/lib/core/sort.dart |
| similarity index 98% |
| rename from lib/coreimpl/dual_pivot_quicksort.dart |
| rename to lib/core/sort.dart |
| index c74e90fc000b2560bcf605660b32d41164f72bd0..0617d54d27b9adc3c3e56e38abaf412903935ad9 100644 |
| --- a/lib/coreimpl/dual_pivot_quicksort.dart |
| +++ b/lib/core/sort.dart |
| @@ -2,6 +2,9 @@ |
| // 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. |
| +// TODO(ajohnsen): Remove once coreimpl is eliminated. |
| +void coreSort(List l, int compare(a, b)) => _Sort.sort(l, compare); |
|
floitsch
2012/10/23 17:25:29
Add a dartdoc explaining that this method will go
Anders Johnsen
2012/10/23 17:33:00
Done.
|
| + |
| /** |
| * Dual-Pivot Quicksort algorithm. |
| * |
| @@ -10,7 +13,7 @@ |
| * |
| * Some improvements have been copied from Android's implementation. |
| */ |
| -class DualPivotQuicksort { |
| +class _Sort { |
| // When a list has less then [:_INSERTION_SORT_THRESHOLD:] elements it will |
| // be sorted by an insertion sort. |
| static const int _INSERTION_SORT_THRESHOLD = 32; |