Index: tool/input_sdk/lib/core/map.dart |
diff --git a/tool/input_sdk/lib/core/map.dart b/tool/input_sdk/lib/core/map.dart |
index 755e7b891975565dfb4207d2001dbf1d9901dcf1..ac4581f7c004779f8a5592110a3a52f158ca4156 100644 |
--- a/tool/input_sdk/lib/core/map.dart |
+++ b/tool/input_sdk/lib/core/map.dart |
@@ -35,7 +35,7 @@ abstract class Map<K, V> { |
* `operator==` and `hashCode`, and it allows null as a key. |
* It iterates in key insertion order. |
*/ |
- factory Map() = LinkedHashMap<K, V>; |
+ external factory Map(); |
/** |
* Creates a [LinkedHashMap] instance that contains all key-value pairs of |
@@ -244,7 +244,7 @@ abstract class Map<K, V> { |
* The values of [this]. |
* |
* The values are iterated in the order of their corresponding keys. |
- * This means that iterating [keys] and [values] in parrallel will |
+ * This means that iterating [keys] and [values] in parallel will |
* provided matching pairs of keys and values. |
* |
* The returned iterable has an efficient `length` method based on the |