Don't use [operator==] to refer to [==] in DartDoc. It doesn't work.

sdk/lib/collection/linked_hash_map.dart

Index: sdk/lib/collection/linked_hash_map.dart
diff --git a/sdk/lib/collection/linked_hash_map.dart b/sdk/lib/collection/linked_hash_map.dart
index d4ce4ca6837453d06c9b2039953ba036a55c1601..fe21eeabaed04314ecfbd11f766db6000a050749 100644
--- a/sdk/lib/collection/linked_hash_map.dart
+++ b/sdk/lib/collection/linked_hash_map.dart
@@ -15,7 +15,7 @@ part of dart.collection;
  * but removing the key and adding it again
  * will make it be last in the iteration order.
  *
- * The keys of a `LinkedHashMap` must have consistent [Object.operator==]
+ * The keys of a `LinkedHashMap` must have consistent [Object.==]
  * and [Object.hashCode] implementations. This means that the `==` operator
  * must define a stable equivalence relation on the keys (reflexive,
  * symmetric, transitive, and consistent over time), and that `hashCode`
@@ -28,14 +28,14 @@ abstract class LinkedHashMap<K, V> implements HashMap<K, V> {
    * Creates an insertion-ordered hash-table based [Map].
    *
    * If [equals] is provided, it is used to compare the keys in the table with
-   * new keys. If [equals] is omitted, the key's own [Object.operator==] is used
+   * new keys. If [equals] is omitted, the key's own [Object.==] is used
    * instead.
    *
    * Similar, if [hashCode] is provided, it is used to produce a hash value
    * for keys in order to place them in the hash table. If it is omitted, the
    * key's own [Object.hashCode] is used.
    *
-   * If using methods like [operator[]], [remove] and [containsKey] together
+   * If using methods like [[]], [remove] and [containsKey] together
    * with a custom equality and hashcode, an extra `isValidKey` function
    * can be supplied. This function is called before calling [equals] or
    * [hashCode] with an argument that may not be a [K] instance, and if the