Changed LinkedHashSet to Set and LinkedHashMap to Map.

sdk/lib/_internal/compiler/implementation/util/expensive_set.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.
 
 part of dart2js.util;
 
 /**
  * The expensive set is a data structure useful for tracking down
  * 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>();
     }
   }
 
   int get length => _sets[0].length;
   bool get isEmpty => _sets[0].isEmpty;
   bool get isNotEmpty => _sets[0].isNotEmpty;
 
   Iterator<E> get iterator => _sets[0].iterator;
 
   bool contains(Object object) => _sets[0].contains(object);
@@ skipping 83 matching lines @@
     if (objectsToRetain is Set) {
       retainSet = objectsToRetain;
     } else {
       retainSet = objectsToRetain.toSet();
     }
     retainWhere(retainSet.contains);
   }
 
   String toString() => "expensive(${_sets[0]}x${_sets.length})";
 }