| OLD | NEW |
| 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 import "package:collection/collection.dart"; | 5 import "package:collection/collection.dart"; |
| 6 import "package:unittest/unittest.dart"; | 6 import "package:test/test.dart"; |
| 7 | 7 |
| 8 void main() { | 8 void main() { |
| 9 group("new QueueList()", () { | 9 group("new QueueList()", () { |
| 10 test("creates an empty QueueList", () { | 10 test("creates an empty QueueList", () { |
| 11 expect(new QueueList(), isEmpty); | 11 expect(new QueueList(), isEmpty); |
| 12 }); | 12 }); |
| 13 | 13 |
| 14 test("takes an initial capacity", () { | 14 test("takes an initial capacity", () { |
| 15 expect(new QueueList(100), isEmpty); | 15 expect(new QueueList(100), isEmpty); |
| 16 }); | 16 }); |
| (...skipping 248 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 265 } | 265 } |
| 266 for (var i = 5; i < 8; i++) { | 266 for (var i = 5; i < 8; i++) { |
| 267 queue.addLast(i); | 267 queue.addLast(i); |
| 268 } | 268 } |
| 269 return queue; | 269 return queue; |
| 270 } | 270 } |
| 271 | 271 |
| 272 /// Returns a matcher that expects that a closure throws a | 272 /// Returns a matcher that expects that a closure throws a |
| 273 /// [ConcurrentModificationError]. | 273 /// [ConcurrentModificationError]. |
| 274 final throwsConcurrentModificationError = throwsA( | 274 final throwsConcurrentModificationError = throwsA( |
| 275 new isInstanceOf<ConcurrentModificationError>( | 275 new isInstanceOf<ConcurrentModificationError>()); |
| 276 "ConcurrentModificationError")); | |
| OLD | NEW |