anchor.diff:          idx <- idx + 1
       results
   
  -/// Creates a set given a number of items in the set and a generator function.
  +/// <summary>Creates a set given a number of items in the set and a generator function.</summary>
  +/// <param name="count"></param>
  +/// <param name="initializer"></param>
  +/// <returns></returns>
   [<CompiledName("Init")>]
   let init count (initializer : int -> 'T) : Set<'T> =
       // Preconditions
  
positive.code:     ||> Set.foldBack (fun el () ->
          action el)
  
  /// Applies a function to each element of the set, threading an accumulator argument
  /// through the computation. The integer index passed to the function indicates the
  /// index of the element within the set.
  [<CompiledName("FoldIndexed")>]
  let foldi (folder : 'State -> int -> 'T -> 'State) (state : 'State) (set : Set<'T>) : 'State =
      // Preconditions
  
negative.code:     let set = Set.remove maxElement set
      maxElement, set
  
  /// <summary>Reduces elements in a set in order from the least (minimum) element to the greatest (maximum) element.</summary>
  /// <param name="reduction"></param>
  /// <param name="set"></param>
  /// <returns></returns>
  [<CompiledName("Reduce")>]
  let reduce (reduction : 'T -> 'T -> 'T) (set : Set<'T>) : 'T =
      // Preconditions
  