22d2778e00
This is just the first step; future CLs will add support for the new API to various packages currently using the old one. BUG=19930 R=sigmund@google.com Review URL: https://codereview.chromium.org//381363002 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@38360 260f80e4-7a28-3924-810f-c04153c831b5
52 lines
1.4 KiB
Dart
52 lines
1.4 KiB
Dart
// Copyright (c) 2013, 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.
|
|
|
|
import 'package:unittest/unittest.dart';
|
|
import 'package:source_span/src/utils.dart';
|
|
|
|
main() {
|
|
group('binary search', () {
|
|
test('empty', () {
|
|
expect(binarySearch([], (x) => true), -1);
|
|
});
|
|
|
|
test('single element', () {
|
|
expect(binarySearch([1], (x) => true), 0);
|
|
expect(binarySearch([1], (x) => false), 1);
|
|
});
|
|
|
|
test('no matches', () {
|
|
var list = [1, 2, 3, 4, 5, 6, 7];
|
|
expect(binarySearch(list, (x) => false), list.length);
|
|
});
|
|
|
|
test('all match', () {
|
|
var list = [1, 2, 3, 4, 5, 6, 7];
|
|
expect(binarySearch(list, (x) => true), 0);
|
|
});
|
|
|
|
test('compare with linear search', () {
|
|
for (int size = 0; size < 100; size++) {
|
|
var list = [];
|
|
for (int i = 0; i < size; i++) {
|
|
list.add(i);
|
|
}
|
|
for (int pos = 0; pos <= size; pos++) {
|
|
expect(binarySearch(list, (x) => x >= pos),
|
|
_linearSearch(list, (x) => x >= pos));
|
|
}
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
_linearSearch(list, predicate) {
|
|
if (list.length == 0) return -1;
|
|
for (int i = 0; i < list.length; i++) {
|
|
if (predicate(list[i])) return i;
|
|
}
|
|
return list.length;
|
|
}
|
|
|