anchor.diff:      let set = Set.remove minElement set
       minElement, set
   
  -/// Extracts the maximum element from a set, returning the element
  -/// along with the updated set.
  +/// <summary>Extracts the maximum element from a set, returning the element along with the updated set.</summary>
  +/// <param name="set"></param>
  +/// <returns></returns>
   [<CompiledName("ExtractMaximum")>]
   let extractMax (set : Set<'T>) : 'T * Set<'T> =
       // Preconditions
  
positive.code: 
      /// <summary>
      /// Applies the given function to each element in the Cartesian product of two sets. 
      /// Returns the set comprised of the results <c>x</c> for each element where the
      /// function returns <c>Some(x)</c>.
      /// </summary>
      [<CompiledName("Choose")>]
      let choose (chooser : 'T1 -> 'T2 -> 'U option) set1 set2 : Set<'U> =
          // Preconditions
  
negative.code:         |> Seq.tryFind predicate
  
  /// <summary>
  /// Returns the first (least) element for which the given predicate returns <c>true</c>.
  /// Raises <see cref="KeyNotFoundException"/> if no such element exists.
  /// </summary>
  /// <param name="predicate"></param>
  /// <param name="set"></param>
  /// <returns></returns>
  [<CompiledName("Find")>]
  let find (predicate : 'T -> bool) (set : Set<'T>) : 'T =
      // Preconditions
  