Add SetBase/SetMixin.

sdk/lib/_internal/lib/collection_patch.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.
 
 // Patch file for dart:collection classes.
 import 'dart:_foreign_helper' show JS;
 import 'dart:_js_helper' show fillLiteralMap, NoInline;
 
 patch class HashMap<K, V> {
   patch factory HashMap({ bool equals(K key1, K key2),
@@ skipping 1108 matching lines @@
     // TODO(kasperl): Consider getting rid of the bucket list when
     // the length reaches zero.
     _length--;
     _elements = null;
     // TODO(kasperl): It would probably be faster to move the
     // element to the end and reduce the length of the bucket list.
     JS('void', '#.splice(#, 1)', bucket, index);
     return true;
   }
 
-  void removeAll(Iterable<Object> objectsToRemove) {
-    for (var each in objectsToRemove) {
-      remove(each);
-    }
-  }
-
-  void retainAll(Iterable<Object> elements) {
-    super._retainAll(elements, (o) => o is E);
-  }
-
-  void removeWhere(bool test(E element)) {
-    removeAll(_computeElements().where(test));
-  }
-
-  void retainWhere(bool test(E element)) {
-    removeAll(_computeElements().where((E element) => !test(element)));
-  }
-
   void clear() {
     if (_length > 0) {
       _strings = _nums = _rest = _elements = null;
       _length = 0;
     }
   }
 
   List _computeElements() {
     if (_elements != null) return _elements;
     List result = new List(_length);
@@ skipping 183 matching lines @@
 
   E lookup(Object object) {
     if (!_validKey(object)) return null;
     return super._lookup(object);
   }
 
   bool remove(Object object) {
     if (!_validKey(object)) return false;
     return super._remove(object);
   }
-
-  bool containsAll(Iterable<Object> elements) {
-    for (Object element in elements) {
-      if (!_validKey(element) || !this.contains(element)) return false;
-    }
-    return true;
-  }
-
-  void removeAll(Iterable<Object> elements) {
-    for (Object element in elements) {
-      if (_validKey(element)) {
-        super._remove(element);
-      }
-    }
-  }
-
-  void retainAll(Iterable<Object> elements) {
-    super._retainAll(elements, _validKey);
-  }
 }
 
 // TODO(kasperl): Share this code with HashMapKeyIterator<E>?
 class HashSetIterator<E> implements Iterator<E> {
   final _set;
   final List _elements;
   int _offset = 0;
   E _current;
 
   HashSetIterator(this._set, this._elements);
@@ skipping 182 matching lines @@
       _setTableEntry(rest, hash, JS('var', '[#]', cell));
     } else {
       int index = _findBucketIndex(bucket, element);
       if (index >= 0) return false;
       LinkedHashSetCell cell = _newLinkedCell(element);
       JS('void', '#.push(#)', bucket, cell);
     }
     return true;
   }
 
-  void addAll(Iterable<E> objects) {
-    for (E object in objects) {
-      add(object);
-    }
-  }
-
   bool remove(Object object) {
     if (_isStringElement(object)) {
       return _removeHashTableEntry(_strings, object);
     } else if (_isNumericElement(object)) {
       return _removeHashTableEntry(_nums, object);
     } else {
       return _remove(object);
     }
   }
 
   bool _remove(Object object) {
     var rest = _rest;
     if (rest == null) return false;
     var bucket = _getBucket(rest, object);
     int index = _findBucketIndex(bucket, object);
     if (index < 0) return false;
     // Use splice to remove the [cell] element at the index and
     // unlink it.
     LinkedHashSetCell cell = JS('var', '#.splice(#, 1)[0]', bucket, index);
     _unlinkCell(cell);
     return true;
   }
 
-  void removeAll(Iterable objectsToRemove) {
-    for (var each in objectsToRemove) {
-      remove(each);
-    }
-  }
-
-  void retainAll(Iterable<Object> elements) {
-    super._retainAll(elements, (o) => o is E);
-  }
-
   void removeWhere(bool test(E element)) {
     _filterWhere(test, true);
   }
 
   void retainWhere(bool test(E element)) {
     _filterWhere(test, false);
   }
 
   void _filterWhere(bool test(E element), bool removeMatching) {
     LinkedHashSetCell cell = _first;
@@ skipping 212 matching lines @@
     return true;
   }
 
   void removeAll(Iterable<Object> elements) {
     for (Object element in elements) {
       if (_validKey(element)) {
         super._remove(element);
       }
     }
   }
-
-  void retainAll(Iterable<Object> elements) {
-    super._retainAll(elements, _validKey);
-  }
 }
 
 class LinkedHashSetCell {
   final _element;
 
   LinkedHashSetCell _next;
   LinkedHashSetCell _previous;
 
   LinkedHashSetCell(this._element);
 }
@@ skipping 17 matching lines @@
     } else if (_cell == null) {
       _current = null;
       return false;
     } else {
       _current = _cell._element;
       _cell = _cell._next;
       return true;
     }
   }
 }