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:                 thisCount + leftCount + rightCount
                  |> cont
  
      //
      [<CompiledName("Count")>]
      let count tree =
          countImpl tree id
  
negative.code:                 Node (x, (char (int value - 1)), l, Node (value + (char 1), y, Empty, r))
                  |> cont
  
      /// Returns a new set with the given element removed.
      /// No exception is raised if the set doesn't contain the given element.
      [<CompiledName("Remove")>]
      let remove value tree =
          removeImpl value tree id
  
      /// Evaluates to 'true' if the given element is in the given set.
      [<CompiledName("Contains")>]
      let rec contains value tree =
          match tree with
  