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

corelib/src/implementation/linked_hash_map.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 represents a pair of two objects, used by LinkedHashMap
  * to store a {key, value} in a list.
  */
 class KeyValuePair<K, V> {
   KeyValuePair(this.key, this.value) {}
@@ skipping 10 matching lines @@
 class LinkedHashMapImplementation<K extends Hashable, V>
     implements LinkedHashMap<K, V> {
   DoubleLinkedQueue<KeyValuePair<K, V>> _list;
   HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>> _map;
 
   LinkedHashMapImplementation() {
     _map = new HashMap<K, DoubleLinkedQueueEntry<KeyValuePair<K, V>>>();
     _list = new DoubleLinkedQueue<KeyValuePair<K, V>>();
   }
 
-  // See issue 417. Works in the vm, fails in dartc and frog.
-  factory LinkedHashMapImplementation.from(Map/*<K, V>*/ other) {
-    Map/*<K, V>*/ result = new LinkedHashMapImplementation/*<K, V>*/();
-    other.forEach((/*K*/ key, /*V*/ value) { result[key] = value; });
+  factory LinkedHashMapImplementation.from(Map<K, V> other) {
+    Map<K, V> result = new LinkedHashMapImplementation<K, V>();
+    other.forEach((K key, V value) { result[key] = value; });
     return result;
   }
 
   void operator []=(K key, V value) {
     if (_map.containsKey(key)) {
       _map[key].element.value = value;
     } else {
       _list.addLast(new KeyValuePair<K, V>(key, value));
       _map[key] = _list.lastEntry();
     }
@@ skipping 64 matching lines @@
 
   bool isEmpty() {
     return length == 0;
   }
 
   void clear() {
     _map.clear();
     _list.clear();
   }
 }