Fix various documentation issues.

sdk/lib/core/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.
 
 part of dart.core;
 
 /**
  * An collection of key-value pairs, from which you retrieve a value
  * by using its associated key.
  *
  * Each key can occur at most once in a map.
  *
  * Maps, and their keys and values, can be iterated.
  * The order of iteration is defined by the individual type of map.
  * Examples:
  *
  * * The plain [HashMap] is unordered (no order is guaranteed),
  * * the [LinkedHashMap] iterates in key insertion order,
- * * and a sorted my like [SplayTreeMap] iterates the keys in sorted order.
+ * * and a sorted map like [SplayTreeMap] iterates the keys in sorted order.
  *
  * It is generally not allowed to modify the map (add or remove keys) while
  * an operation is being performed on the map, for example in functions called
  * during a [forEach] or [putIfAbsent] call.
  * Modifying the map while iterating the keys or values
  * may also break the iteration.
  */
 abstract class Map<K, V> {
   /**
    * Creates a Map instance with the default implementation, [LinkedHashMap].
@@ skipping 195 matching lines @@
   /**
    * Returns true if there is no key-value pair in the map.
    */
   bool get isEmpty;
 
   /**
    * Returns true if there is at least one key-value pair in the map.
    */
   bool get isNotEmpty;
 }