cleanup patch generation to preseve comments and remove @patch

test/generated_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 12 matching lines @@
  * Adding an element that is already in the set
  * does not change its position in the iteration order,
  * but removing an element and adding it again,
  * will make it the last element of an iteration.
  *
  * Most simple operations on `HashSet` are done in (potentially amortized)
  * constant time: [add], [contains], [remove], and [length], provided the hash
  * codes of objects are well distributed..
  */
 abstract class LinkedHashSet<E> implements HashSet<E> {
-  @patch
+  /**
+   * Create an insertion-ordered hash set using the provided
+   * [equals] and [hashCode].
+   *
+   * The provided [equals] must define a stable equivalence relation, and
+   * [hashCode] must be consistent with [equals]. If the [equals] or [hashCode]
+   * methods won't work on all objects, but only to instances of E, the
+   * [isValidKey] predicate can be used to restrict the keys that they are
+   * applied to. Any key for which [isValidKey] returns false is automatically
+   * assumed to not be in the set.
+   *
+   * If [equals] or [hashCode] are omitted, the set uses
+   * the objects' intrinsic [Object.operator==] and [Object.hashCode],
+   *
+   * If [isValidKey] is omitted, it defaults to testing if the object is an
+   * [E] instance.
+   *
+   * If you supply one of [equals] and [hashCode],
+   * you should generally also to supply the other.
+   * An example would be using [identical] and [identityHashCode],
+   * which is equivalent to using the shorthand [LinkedSet.identity]).
+   */
   factory LinkedHashSet({ bool equals(E e1, E e2),
                           int hashCode(E e),
                           bool isValidKey(potentialKey) }) {
     if (isValidKey == null) {
       if (hashCode == null) {
         if (equals == null) {
           return new _LinkedHashSet<E>();
         }
         hashCode = _defaultHashCode;
       } else {
         if (identical(identityHashCode, hashCode) &&
             identical(identical, equals)) {
           return new _LinkedIdentityHashSet<E>();
         }
         if (equals == null) {
           equals = _defaultEquals;
         }
       }
     } else {
       if (hashCode == null) {
         hashCode = _defaultHashCode;
       }
       if (equals == null) {
         equals = _defaultEquals;
       }
     }
     return new _LinkedCustomHashSet<E>(equals, hashCode, isValidKey);
   }
 
-  @patch
+  /**
+   * Creates an insertion-ordered identity-based set.
+   *
+   * Effectively a shorthand for:
+   *
+   *     new LinkedHashSet(equals: identical, hashCode: identityHashCodeOf)
+   */
   factory LinkedHashSet.identity() = _LinkedIdentityHashSet<E>;
 
   /**
    * 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].
    * The `elements` iterable itself may have any element type,
@@ skipping 16 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;
 }