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 // Dart test for sort routines. | 5 // Dart test for sort routines. |
6 #library("SortTest.dart"); | 6 #library("SortTest.dart"); |
7 #import("dart:coreimpl"); | 7 #import("dart:coreimpl"); |
8 #source("SortHelper.dart"); | 8 #source("sort_helper.dart"); |
9 | 9 |
10 main() { | 10 main() { |
11 var compare = (a, b) => a.compareTo(b); | 11 var compare = (a, b) => a.compareTo(b); |
12 var sort = (list) => DualPivotQuicksort.sort(list, compare); | 12 var sort = (list) => DualPivotQuicksort.sort(list, compare); |
13 new SortHelper(sort, compare).run(); | 13 new SortHelper(sort, compare).run(); |
14 | 14 |
15 compare = (a, b) => -a.compareTo(b); | 15 compare = (a, b) => -a.compareTo(b); |
16 new SortHelper(sort, compare).run(); | 16 new SortHelper(sort, compare).run(); |
17 | 17 |
18 compare = (a, b) => a.compareTo(b); | 18 compare = (a, b) => a.compareTo(b); |
(...skipping 20 matching lines...) Expand all Loading... |
39 // The second partition will be big (more than 2/3 of the list), and an | 39 // The second partition will be big (more than 2/3 of the list), and an |
40 // optimization kicks in that removes the pivots from the partition. | 40 // optimization kicks in that removes the pivots from the partition. |
41 list = [0, 9, 0, 9, 3, 9, 0, 1/**/, 1, 0, 1, 9, 8, 2, 1, | 41 list = [0, 9, 0, 9, 3, 9, 0, 1/**/, 1, 0, 1, 9, 8, 2, 1, |
42 1/**/, 4, 5, 2, 5, 0, 1, 8/**/, 8, 8, 5, 2, 2, 9, 8/**/, | 42 1/**/, 4, 5, 2, 5, 0, 1, 8/**/, 8, 8, 5, 2, 2, 9, 8/**/, |
43 8, 4, 4, 1, 5, 3, 2, 8/**/, 5, 1, 2, 8, 5, 6, 8]; | 43 8, 4, 4, 1, 5, 3, 2, 8/**/, 5, 1, 2, 8, 5, 6, 8]; |
44 list.sort(compare); | 44 list.sort(compare); |
45 Expect.listEquals(list, [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, | 45 Expect.listEquals(list, [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, |
46 2, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, | 46 2, 2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, |
47 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9]); | 47 6, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9]); |
48 } | 48 } |
OLD | NEW |