Fix documentation for identity sets/maps.

sdk/lib/collection/linked_hash_set.dart

 // Copyright (c) 2013, 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.collection;
 
 /**
  * A [LinkedHashSet] is a hash-table based [Set] implementation.
  *
  * The `LinkedHashSet` also keep track of the order that elements were inserted
@@ skipping 65 matching lines @@
    */
   external factory LinkedHashSet({bool equals(E e1, E e2),
                                   int hashCode(E e),
                                   bool isValidKey(potentialKey)});
 
   /**
    * Creates an insertion-ordered identity-based set.
    *
    * Effectively a shorthand for:
    *
-   *     new LinkedHashSet(equals: identical,
-   *                       hashCode: identityHashCode)
+   *     new LinkedHashSet<E>(equals: identical,
+   *                          hashCode: identityHashCode)
    */
   external factory LinkedHashSet.identity();
 
   /**
    * Create a linked hash set containing all [elements].
    *
    * Creates a linked hash set as by `new LinkedHashSet<E>()` and adds each
    * element of`elements` to this set in the order they are iterated.
    *
    * All the [elements] should be assignable to [E].
@@ skipping 18 matching lines @@
    *
    * The elements are iterated in insertion order.
    */
   void forEach(void action(E element));
 
   /**
    * Provides an iterator that iterates over the elements in insertion order.
    */
   Iterator<E> get iterator;
 }