Updates the corelib to the new default specification for interfaces and new factory syntax

corelib/src/implementation/hash_map_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.
 
 // Hash map implementation with open addressing and quadratic probing.
 class HashMapImplementation<K extends Hashable, V> implements HashMap<K, V> {
 
   // The [_keys] list contains the keys inserted in the map.
   // The [_keys] list must be a raw list because it
   // will contain both elements of type K, and the [_DELETED_KEY] of type
@@ skipping 32 matching lines @@
   static final int _INITIAL_CAPACITY = 8;  // must be power of 2
 
   HashMapImplementation() {
     _numberOfEntries = 0;
     _numberOfDeleted = 0;
     _loadLimit = _computeLoadLimit(_INITIAL_CAPACITY);
     _keys = new List(_INITIAL_CAPACITY);
     _values = new List<V>(_INITIAL_CAPACITY);
   }
 
-  // See issue 417. Works in the vm, fails in dartc and frog.
-  factory HashMapImplementation.from(Map/*<K, V>*/ other) {
-    Map/*<K, V>*/ result = new HashMapImplementation/*<K, V>*/();
-    other.forEach((/*K*/ key, /*V*/ value) { result[key] = value; });
+  factory HashMapImplementation.from(Map<K, V> other) {
+    Map<K, V> result = new HashMapImplementation<K, V>();
+    other.forEach((K key, V value) { result[key] = value; });
     return result;
   }
 
   static int _computeLoadLimit(int capacity) {
     return (capacity * 3) ~/ 4;
   }
 
   static int _firstProbe(int hashCode, int length) {
     return hashCode & (length - 1);
   }
@@ skipping 201 matching lines @@
     return false;
   }
 }
 
 class HashSetImplementation<E extends Hashable> implements HashSet<E> {
 
   HashSetImplementation() {
     _backingMap = new HashMapImplementation<E, E>();
   }
 
-  // See issue 417. Works in the vm, fails in dartc and frog.
-  factory HashSetImplementation.from(Iterable/*<E>*/ other) {
-    Set/*<E>*/ set = new HashSetImplementation/*<E>*/();
+  factory HashSetImplementation.from(Iterable<E> other) {
+    Set<E> set = new HashSetImplementation<E>();
     for (final e in other) {
       set.add(e);
     }
     return set;
   }
 
   void clear() {
     _backingMap.clear();
   }
 
@@ skipping 133 matching lines @@
 
 /**
  * A singleton sentinel used to represent when a key is deleted from the map.
  * We can't use [: const Object() :] as a sentinel because it would end up
  * canonicalized and then we cannot distinguish the deleted key from the
  * canonicalized [: Object() :].
  */
 class _DeletedKeySentinel {
   const _DeletedKeySentinel();
 }