Johnni Winther
34fb48bb8a
Migrates libraries dependent only on already migrated libraries. Change-Id: I0e85ee8dbc2afce031b92e0009e71c206a55af28 Reviewed-on: https://dart-review.googlesource.com/c/sdk/+/179502 Commit-Queue: Johnni Winther <johnniwinther@google.com> Reviewed-by: Jens Johansen <jensj@google.com>
41 lines
1011 B
Dart
41 lines
1011 B
Dart
// Copyright (c) 2017, the Dart project authors. Please see the AUTHORS file
|
|
// 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.
|
|
|
|
// @dart = 2.9
|
|
|
|
import 'package:kernel/src/heap.dart';
|
|
import 'package:test/test.dart';
|
|
|
|
main() {
|
|
check_sort(Iterable<int> initialOrder) {
|
|
var values = initialOrder.toList();
|
|
var heap = new _intHeap();
|
|
values.forEach(heap.add);
|
|
values.sort();
|
|
var result = <int>[];
|
|
while (heap.isNotEmpty) {
|
|
expect(heap.isEmpty, isFalse);
|
|
result.add(heap.remove());
|
|
}
|
|
expect(heap.isEmpty, isTrue);
|
|
expect(result, values);
|
|
}
|
|
|
|
test('sort', () {
|
|
check_sort(<int>[3, 1, 4, 1, 5, 9, 2, 6]);
|
|
});
|
|
|
|
test('sort_already_sorted', () {
|
|
check_sort(<int>[1, 1, 2, 3, 4, 5, 6, 9]);
|
|
});
|
|
|
|
test('sort_reverse_sorted', () {
|
|
check_sort(<int>[9, 6, 5, 4, 3, 2, 1, 1]);
|
|
});
|
|
}
|
|
|
|
class _intHeap extends Heap<int> {
|
|
bool sortsBefore(int a, int b) => a < b;
|
|
}
|