Remove Collection, Collections and clean up List/Set/Queue implementations of retain/remove.

sdk/lib/html/html_common/filtered_element_list.dart

 // Copyright (c) 2011, 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 html_common;
 
 /**
  * An indexable collection of a node's descendants in the document tree,
  * filtered so that only elements are in the collection.
  */
@@ skipping 104 matching lines @@
     if (element is! Element) return;
     for (int i = 0; i < length; i++) {
       Element indexElement = this[i];
       if (identical(indexElement, element)) {
         indexElement.remove();
         return;
       }
     }
   }
 
-  // Operations defined in terms of [Collections]' [remove].
-
-  void removeAll(Iterable elements) {
-    // This should be optimized to not use [remove] directly.
-    IterableMixinWorkaround.removeAll(this, elements);
-  }
-
-  void retainAll(Iterable elements) {
-    IterableMixinWorkaround.retainAll(this, elements);
-  }
-
-  void removeWhere(bool test(Element element)) {
-    IterableMixinWorkaround.removeWhere(this, test);
-  }
-
-  void retainWhere(bool test(Element element)) {
-    IterableMixinWorkaround.retainWhere(this, test);
-  }
 
   Element reduce(Element combine(Element value, Element element)) {
     return _filtered.reduce(combine);
   }
 
   dynamic fold(dynamic initialValue,
       dynamic combine(dynamic previousValue, Element element)) {
     return _filtered.fold(initialValue, combine);
   }
 
@@ skipping 57 matching lines @@
   Element get single => _filtered.single;
 
   Element min([int compare(Element a, Element b)]) => _filtered.min(compare);
 
   Element max([int compare(Element a, Element b)]) => _filtered.max(compare);
 
   Map<int, Element> asMap() {
     return IterableMixinWorkaround.asMapList(this);
   }
 }