anchor.diff:    ///
     /// If multiple [entries] have the same key,
     /// later occurrences overwrite the earlier ones.
  +  /// Example:
  +  /// ```dart
  +  /// final numbers = [11, 12, 13, 14];
  +  /// final map = LinkedHashMap.fromEntries(numbers.map((i) => MapEntry(i, i * i)));
  +  /// print(map); // {11: 121, 12: 144, 13: 169, 14: 196}
  +  /// ```
     @Since("2.1")
     factory LinkedHashMap.fromEntries(Iterable<MapEntry<K, V>> entries) =>
         LinkedHashMap<K, V>()..addEntries(entries);
  
positive.code: 
  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.
  
negative.code:   /// of an object, or what it compares equal to, should not change while the
    /// object is in the table. If it does change, the result is unpredictable.
    ///
    /// If you supply one of [equals] or [hashCode],
    /// you should generally also supply the other.
    ///
    /// Some [equals] or [hashCode] functions might not work for all objects.
  