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

sdk/lib/collection/linked_hash_map.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 hash-table based implementation of [Map].
  *
  * The insertion order of keys is remembered,
  * and keys are iterated in the order they were inserted into the map.
  * Values are iterated in their corresponding key's order.
  * Changing a key's value, when the key is already in the map,
  * does not change the iteration order,
  * 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`
  * must be the same for objects that are considered equal by `==`.
  *
  * The map allows `null` as a key.
  */
 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
    * call returns false, the key is assumed to not be in the set.
    * The [isValidKey] function defaults to just testing if the object is a
    * [K] instance.
    *
    * Example:
    *
    *     new LinkedHashMap<int,int>(equals: (int a, int b) => (b - a) % 5 == 0,
@@ skipping 74 matching lines @@
    * overwrites the previous value.
    *
    * It is an error if the two [Iterable]s don't have the same length.
    */
   factory LinkedHashMap.fromIterables(Iterable<K> keys, Iterable<V> values) {
     LinkedHashMap<K, V> map = new LinkedHashMap<K, V>();
     Maps._fillMapWithIterables(map, keys, values);
     return map;
   }
 }