anchor.diff:      ///
       /// <returns>A set containing the transformed elements.</returns>
       /// 
  -    /// <example-tbd></example-tbd>
  +    /// <example id="set-map">
  +    /// <code lang="fsharp">
  +    /// let set = Set.empty.Add(1).Add(2).Add(3)
  +    /// printfn $"The set with doubled values is {Set.map (fun x -> x * 2) set}" 
  +    /// </code>
  +    /// The sample evaluates to the following output: <c>The set with doubled values is set [2; 4; 6]</c>
  +    /// </example>
       [<CompiledName("Map")>]
       val map: mapping:('T -> 'U) -> set:Set<'T> -> Set<'U>
   
  
positive.code:     ///
      /// <returns>The input set with <c>value</c> removed.</returns>
      /// 
      /// <example-tbd></example-tbd>
      [<CompiledName("Remove")>]
      val remove: value: 'T -> set:Set<'T> -> Set<'T>
  
  
negative.code:     ///
      /// <returns>The intersection of the input sets.</returns>
      /// 
      /// <example id="set-intersectmany">
      /// <code lang="fsharp">
      /// let headersByFile = seq{
      /// yield [ "id"; "name"; "date"; "color" ]
      /// yield [ "id"; "age"; "date" ]
      /// yield [ "id"; "sex"; "date"; "animal" ]
      /// }
      /// headersByFile
      /// |> Seq.map Set.ofList
      /// |> Set.intersectMany
      /// |> printfn "The intersection of %A is %A" headersByFile 
      /// </code>
      /// The sample evaluates to the following output: <c>The intersection of seq
      /// [["id"; "name"; "date"; "color"]; ["id"; "age"; "date"];
      /// ["id"; "sex"; "date"; "animal"]] is set ["date"; "id"]</c>
      /// </example>
      [<CompiledName("IntersectMany")>]
      val intersectMany: sets:seq<Set<'T>> -> Set<'T>
  
  