anchor.diff:      ///
       /// <returns>A new set containing <c>value</c>.</returns>
       /// 
  -    /// <example-tbd></example-tbd>
  +    /// <example id="set-add">
  +    /// <code lang="fsharp">
  +    /// let set = Set.empty.Add(1).Add(1).Add(2)
  +    /// printfn $"The new set is: {set}"
  +    /// </code>
  +    /// The sample evaluates to the following output: <c>The new set is: set [1; 2]</c>
  +    /// </example>
       [<CompiledName("Add")>]
       val add: value:'T -> set:Set<'T> -> Set<'T>
   
  
positive.code:     ///
      /// <returns>The union of <c>set1</c> and <c>set2</c>.</returns>
      /// 
      /// <example-tbd></example-tbd>
      [<CompiledName("Union")>]
      val union: set1:Set<'T> -> set2:Set<'T> -> Set<'T>
  
  
negative.code:     ///
      /// <returns>True if <c>set1</c> is a proper subset of <c>set2</c>.</returns>
      /// 
      /// <example id="set-ispropersubset">
      /// <code lang="fsharp">
      /// let set1 = Set.empty.Add(1).Add(2).Add(3)
      /// let set2 = Set.empty.Add(1).Add(2).Add(3).Add(4)
      /// printfn $"Is {set1} a proper subset of {set2}? {Set.isProperSubset set1 set2}"
      /// </code>
      /// The sample evaluates to the following output: <c>Is set [1; 2; 3] a proper subset of set [1; 2; 3; 4]? true</c>
      /// </example>
      [<CompiledName("IsProperSubset")>]
      val isProperSubset: set1: Set<'T> -> set2:Set<'T> -> bool
  
  