anchor.diff:                          // Check the right subtree
                           forallImpl predicate right cont
   
  -    //
  +    /// Tests if all elements of the collection satisfy the given predicate.
  +    /// If the input function is <c>p</c> and the elements are <c>i0...iN</c>,
  +    /// then this function computes <c>p i0 && ... && p iN</c>.
       [<CompiledName("Forall")>]
       let forall (predicate : char -> bool) tree =
           forallImpl predicate tree id
   
  -    //
  +    /// Creates a list that contains the elements of the set in order.
       [<CompiledName("ToList")>]
       let toList tree =
           // Fold backwards so we don't need to reverse the list.
  
positive.code:             else
                  cont t (* value in [x, y] *)
  
      //
      [<CompiledName("Add")>]
      let add value tree =
          addImpl value tree id
  
negative.code:         ||> foldBack (fun i lst ->
              i :: lst)
  
      /// Creates a set that contains the same elements as the given list.
      [<CompiledName("OfList")>]
      let ofList list =
          (empty, list)
  