anchor.diff:  
     /// Creates a [SplayTreeSet] that contains all [elements].
     ///
  -  /// The set works as if created by `new SplayTreeSet<E>(compare, isValidKey)`.
  +  /// The set works as if created by `SplayTreeSet<E>(compare, isValidKey)`.
     ///
     /// All the [elements] should be instances of [E] and valid arguments to
     /// [compare].
  
positive.code:   }
  
    /// Creates a [SplayTreeMap] that contains all key/value pairs of [other].
    factory SplayTreeMap.of(Map<K, V> other,
            [int Function(K key1, K key2)? compare,
            bool Function(dynamic potentialKey)? isValidKey]) =>
  
negative.code:   /// The keys of the key/value pairs do not need to be unique. The last
    /// occurrence of a key will simply overwrite any previous value.
    ///
    /// If no functions are specified for [key] and [value], the default is to
    /// use the iterable value itself.
    /// Example:
    /// ```dart
    /// final numbers = [12, 11, 14, 13];
    /// final mapFromIterable =
    ///     SplayTreeMap<int, int>.fromIterable(numbers,
    ///         key: (i) => i, value: (i) => i * i);
    /// print(mapFromIterable); // {11: 121, 12: 144, 13: 169, 14: 196}
    /// ```
    factory SplayTreeMap.fromIterable(Iterable iterable,
        {K Function(dynamic element)? key,
        V Function(dynamic element)? value,
  