anchor.diff:      ///
       /// <returns>The set containing <c>elements</c>.</returns>
       /// 
  -    /// <example-tbd></example-tbd>
  +    /// <example id="set-ofseq">
  +    /// <code lang="fsharp">
  +    /// let set = Set.ofSeq [1, 2, 3]
  +    /// printfn $"The set is {set} and type is {set.GetType().Name}"
  +    /// </code>
  +    /// The sample evaluates to the following output: <c>The set is set [(1, 2, 3)] and type is "FSharpSet`1"</c>
  +    /// </example>
       [<CompiledName("OfSeq")>]
       val ofSeq: elements:seq<'T> -> Set<'T>
   
  
positive.code:     ///
      /// <returns>True if <c>set1</c> is a proper superset of <c>set2</c>.</returns>
      /// 
      /// <example-tbd></example-tbd>
      [<CompiledName("IsProperSuperset")>]
      val isProperSuperset: set1: Set<'T> -> set2:Set<'T> -> bool
  
  
negative.code:     ///
      /// <returns>A set containing the elements form the input list.</returns>
      /// 
      /// <example id="set-oflist">
      /// <code lang="fsharp">
      /// let set = Set.ofList [1, 2, 3]
      /// printfn $"The set is {set} and type is {set.GetType().Name}"
      /// </code>
      /// The sample evaluates to the following output: <c>The set is set [(1, 2, 3)] and type is "FSharpSet`1"</c>
      /// </example>
      [<CompiledName("OfList")>]
      val ofList: elements:'T list -> Set<'T>
  
  