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

sdk/lib/collection/list.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;
 
 /**
  * Abstract implementation of a list.
  *
  * All operations are defined in terms of `length`, `operator[]`,
@@ skipping 231 matching lines @@
   void remove(Object element) {
     for (int i = 0; i < this.length; i++) {
       if (this[i] == element) {
         this.setRange(i, this.length - i - 1, this, i + 1);
         this.length -= 1;
         return;
       }
     }
   }
 
-  void removeAll(Iterable<Object> elements) {
-    if (elements is! Set) {
-      elements = elements.toSet();
-    }
-    _filter(this, elements.contains, false);
-  }
-
-
-  void retainAll(Iterable<E> elements) {
-    if (elements is! Set) {
-      elements = elements.toSet();
-    }
-    _filter(this, elements.contains, true);
-  }
-
   void removeWhere(bool test(E element)) {
     _filter(this, test, false);
   }
 
   void retainWhere(bool test(E element)) {
     _filter(this, test, true);
   }
 
   static void _filter(List source,
                       bool test(var element),
@@ skipping 154 matching lines @@
     for (int i = startIndex; i >= 0; i--) {
       if (this[i] == element) {
         return i;
       }
     }
     return -1;
   }
 
   Iterable<E> get reversed => new ReversedListIterable(this);
 }