Allow Object when doing lookups.

sdk/lib/collection/hash_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 dart.collection;
 
 /** Common parts of [HashSet] and [LinkedHashSet] implementations. */
 abstract class _HashSetBase<E> extends IterableBase<E> implements Set<E> {
   // Set.
-  bool containsAll(Iterable<E> other) {
-    for (E object in other) {
+  bool containsAll(Iterable<Object> other) {
+    for (Object object in other) {
       if (!this.contains(object)) return false;
     }
     return true;
   }
 
   /** Create a new Set of the same type as this. */
   Set _newSet();
 
-  Set<E> intersection(Set<E> other) {
+  Set<E> intersection(Set<Object> other) {
     Set<E> result = _newSet();
     if (other.length < this.length) {
-      for (E element in other) {
+      for (var element in other) {
         if (this.contains(element)) result.add(element);
       }
     } else {
       for (E element in this) {
         if (other.contains(element)) result.add(element);
       }
     }
     return result;
   }
 
@@ skipping 54 matching lines @@
 
   external bool contains(Object object);
 
   // Set.
   external void add(E element);
 
   external void addAll(Iterable<E> objects);
 
   external bool remove(Object object);
 
-  external void removeAll(Iterable objectsToRemove);
+  external void removeAll(Iterable<Object> objectsToRemove);
 
   external void removeWhere(bool test(E element));
 
   external void retainWhere(bool test(E element));
 
   external void clear();
 
   Set<E> _newSet() => new HashSet<E>();
 }