Move implementation from IterableBase to Iterable.

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;
 
 /**
  * A collection of objects in which each object can occur only once.
  *
  * That is, for each object of the element type, the object is either considered
@@ skipping 13 matching lines @@
  *   uspecified,
  * * [LinkedHashSet] iterates in the insertion order of its elements, and
  * * a sorted set like [SplayTreeSet] iterates the elements in sorted order.
  *
  * It is generally not allowed to modify the set (add or remove elements) while
  * an operation on the set is being performed, for example during a call to
  * [forEach] or [containsAll]. Nor is it allowed to modify the set while
  * iterating either the set itself or any [Iterable] that is backed by the set,
  * such as the ones returned by methods like [where] and [map].
  */
-abstract class Set<E> extends IterableBase<E> implements EfficientLength {
+abstract class Set<E> extends Iterable<E> implements EfficientLength {
   /**
    * Creates an empty [Set].
    *
    * The created [Set] is a plain [LinkedHashSet].
    * As such, it considers elements that are equal (using [==]) to be
    * indistinguishable, and requires them to have a compatible
    * [Object.hashCode] implementation.
    *
    * The set is equivalent to one created by `new LinkedHashSet<E>()`.
    */
@@ skipping 134 matching lines @@
   /* Creates a [Set] with the same elements and behavior as this `Set`.
    *
    * The returned set behaves the same as this set
    * with regard to adding and removing elements.
    * It initially contains the same elements.
    * If this set specifies an ordering of the elements,
    * the returned set will have the same order.
    */
   Set<E> toSet();
 }