Add Set.union, Set.difference. Change Set methods to expect Set.

sdk/lib/core/set.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 dart.core;
 
 /**
  * This class is the public interface of a set. A set is a collection
  * without duplicates.
  */
@@ skipping 17 matching lines @@
   void add(E value);
 
   /**
    * Removes [value] from the set. Returns true if [value] was
    * in the set. Returns false otherwise. The method has no effect
    * if [value] value was not in the set.
    */
   bool remove(Object value);
 
   /**
-   * Returns true if [collection] contains all the elements of this
-   * collection.
+   * Returns true if [other] contains all the elements of this Set.
    */
-  bool isSubsetOf(Collection<E> collection);
+  bool isSubsetOf(Set<E> other);
 
   /**
-   * Returns true if this collection contains all the elements of
-   * [collection].
+   * Returns true if this Set contains all the elements of

[floitsch, 2013/03/12 16:25:00]

Fits on one line.

[Lasse Reichstein Nielsen, 2013/03/13 13:01:42]

Done.

+   * [other].
    */
-  bool containsAll(Collection<E> collection);
+  bool containsAll(Set<E> other);
 
   /**
    * Returns a new set which is the intersection between this set and

[floitsch, 2013/03/12 16:25:00]

ditto.

[Lasse Reichstein Nielsen, 2013/03/13 13:01:42]

Done.

[Lasse Reichstein Nielsen, 2013/03/13 13:01:42]

Done.

-   * the given collection.
+   * [other].
    */
-  Set<E> intersection(Collection<E> other);
+  Set<E> intersection(Set<E> other);
+
+  /**
+   * Returns a new set which contains all the elements of this set and [other].
+   */
+  Set<E> union(Set<E> other);
+
+  /**
+   * Returns a new set with the the elements of this that are not in [other].
+   */
+  Set<E> difference(Set<E> other);
 
   /**
    * Removes all elements in the set.
    */
   void clear();
 }