| Index: sdk/lib/_internal/compiler/implementation/util/expensive_set.dart
|
| diff --git a/sdk/lib/_internal/compiler/implementation/util/expensive_set.dart b/sdk/lib/_internal/compiler/implementation/util/expensive_set.dart
|
| index e506fa1820bd68e78aa44f9da4254e818c4a4ffa..4fb39498cf5cb9a311ff56ac3b19d811c61b2105 100644
|
| --- a/sdk/lib/_internal/compiler/implementation/util/expensive_set.dart
|
| +++ b/sdk/lib/_internal/compiler/implementation/util/expensive_set.dart
|
| @@ -9,14 +9,14 @@ part of dart2js.util;
|
| * excessive memory usage due to large sets. It acts as an ordinary
|
| * hash set, but it uses 10 times more memory (by default).
|
| */
|
| -class ExpensiveSet<E> extends IterableBase<E> implements LinkedHashSet<E> {
|
| +class ExpensiveSet<E> extends IterableBase<E> implements Set<E> {
|
|
|
| final List _sets;
|
|
|
| ExpensiveSet([int copies = 10]) : _sets = new List(copies) {
|
| assert(copies > 0);
|
| for (int i = 0; i < _sets.length; i++) {
|
| - _sets[i] = new LinkedHashSet<E>();
|
| + _sets[i] = new Set<E>();
|
| }
|
| }
|
|
|
|
|