Remove named function literals from library and tests

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.
 
 /**
  * This class is the public interface of a set. A set is a collection
  * without duplicates.
  */
 abstract class Set<E> extends Collection<E> {
   factory Set() => new _HashSetImpl<E>();
@@ skipping 92 matching lines @@
     return _backingMap.containsKey(value);
   }
 
   bool remove(E value) {
     if (!_backingMap.containsKey(value)) return false;
     _backingMap.remove(value);
     return true;
   }
 
   void addAll(Collection<E> collection) {
-    collection.forEach(void _(E value) {
+    collection.forEach((E value) {
       add(value);
     });
   }
 
   Set<E> intersection(Collection<E> collection) {
     Set<E> result = new Set<E>();
-    collection.forEach(void _(E value) {
+    collection.forEach((E value) {
       if (contains(value)) result.add(value);
     });
     return result;
   }
 
   bool isSubsetOf(Collection<E> other) {
     return new Set<E>.from(other).containsAll(this);
   }
 
   void removeAll(Collection<E> collection) {
-    collection.forEach(void _(E value) {
+    collection.forEach((E value) {
       remove(value);
     });
   }
 
   bool containsAll(Collection<E> collection) {
-    return collection.every(bool _(E value) {
+    return collection.every((E value) {
       return contains(value);
     });
   }
 
   void forEach(void f(E element)) {
-    _backingMap.forEach(void _(E key, E value) {
+    _backingMap.forEach((E key, E value) {
       f(key);
     });
   }
 
   Set map(f(E element)) {
     Set result = new Set();
-    _backingMap.forEach(void _(E key, E value) {
+    _backingMap.forEach((E key, E value) {
       result.add(f(key));
     });
     return result;
   }
 
   Dynamic reduce(Dynamic initialValue,
                  Dynamic combine(Dynamic previousValue, E element)) {
     return Collections.reduce(this, initialValue, combine);
   }
 
   Set<E> filter(bool f(E element)) {
     Set<E> result = new Set<E>();
-    _backingMap.forEach(void _(E key, E value) {
+    _backingMap.forEach((E key, E value) {
       if (f(key)) result.add(key);
     });
     return result;
   }
 
   bool every(bool f(E element)) {
     Collection<E> keys = _backingMap.keys;
     return keys.every(f);
   }
 
@@ skipping 64 matching lines @@
   }
 
   // The entries in the set. May contain null or the sentinel value.
   List<E> _entries;
 
   // The next valid index in [_entries] or the length of [entries_].
   // If it is the length of [_entries], calling [hasNext] on the
   // iterator will return false.
   int _nextValidIndex;
 }