anchor.diff:      ///
       /// <returns>True if the predicate returns true for one of the key/value pairs.</returns>
       /// 
  -    /// <example-tbd></example-tbd>
  +    /// <example id="exists-1">
  +    /// <code lang="fsharp">
  +    /// let sample = Map [ (1, "a"); (2, "b") ]
  +    /// 
  +    /// sample |> Map.exists (fun n s -> n = s.Length) // evaluates to true
  +    /// sample |> Map.exists (fun n s -> n &lt; s.Length) // evaluates to false
  +    /// </code>
  +    /// </example>
       [<CompiledName("Exists")>]
       val exists: predicate:('Key -> 'T -> bool) -> table:Map<'Key, 'T> -> bool
   
  
positive.code:     ///
      /// <returns>True if the map is empty.</returns>
      /// 
      /// <example-tbd></example-tbd>
      [<CompiledName("IsEmpty")>]
      val isEmpty: table:Map<'Key,'T> -> bool
  
      /// <summary>The empty map.</summary>
      /// 
      /// <example-tbd></example-tbd>
      [<GeneralizableValueAttribute>]
      [<CompiledName("Empty")>]
      val empty<'Key,'T> : Map<'Key,'T> when 'Key : comparison
  
negative.code:     ///
      /// <returns>True if the predicate evaluates to true for all of the bindings in the map.</returns>
      /// 
      /// <example id="forall-1">
      /// <code lang="fsharp">
      /// let sample = Map [ (1, "a"); (2, "b") ]
      /// 
      /// sample |> Map.forall (fun n s -> n >= s.Length) // evaluates to true
      /// sample |> Map.forall (fun n s -> n = s.Length)  // evaluates to false
      /// </code>
      /// </example>
      [<CompiledName("ForAll")>]
      val forall: predicate:('Key -> 'T -> bool) -> table:Map<'Key, 'T> -> bool
  
  