| Index: sdk/lib/_internal/compiler/implementation/util/expensive_map.dart
|
| diff --git a/sdk/lib/_internal/compiler/implementation/util/expensive_map.dart b/sdk/lib/_internal/compiler/implementation/util/expensive_map.dart
|
| index b904821c1f7b71a9c75e9de604bd7bbde1e27b7f..d9c76599fa32c61a4a9b985a8ed23cd3eb22314e 100644
|
| --- a/sdk/lib/_internal/compiler/implementation/util/expensive_map.dart
|
| +++ b/sdk/lib/_internal/compiler/implementation/util/expensive_map.dart
|
| @@ -9,14 +9,14 @@ part of dart2js.util;
|
| * excessive memory usage due to large maps. It acts as an ordinary
|
| * hash map, but it uses 10 times more memory (by default).
|
| */
|
| -class ExpensiveMap<K, V> implements LinkedHashMap<K, V> {
|
| +class ExpensiveMap<K, V> implements Map<K, V> {
|
|
|
| final List _maps;
|
|
|
| ExpensiveMap([int copies = 10]) : _maps = new List(copies) {
|
| assert(copies > 0);
|
| for (int i = 0; i < _maps.length; i++) {
|
| - _maps[i] = new LinkedHashMap<K, V>();
|
| + _maps[i] = new Map<K, V>();
|
| }
|
| }
|
|
|
|
|