anchor.diff:  
     /// Creates an insertion-ordered identity-based map.
     ///
  -  /// Effectively a shorthand for:
  +  /// Effectively shorthand for:
     /// ```dart template:expression
     /// LinkedHashMap<K, V>(equals: identical,
     ///                     hashCode: identityHashCode)
  
positive.code: /// 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.==]
  /// 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 `==`.
  abstract class LinkedHashMap<K, V> implements Map<K, V> {
    /// Creates an insertion-ordered hash-table based [Map].
    ///
  
negative.code:   ///
    /// 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);
  