anchor.diff:  [<RequireQualifiedAccess; CompilationRepresentation (CompilationRepresentationFlags.ModuleSuffix)>]
   module internal Vnode =
   
  -    /// OPTIMIZATION: Array.Clone () is not user since it's been profiled to be slower
  +    /// OPTIMIZATION: Array.Clone () is not used since it's been profiled to be slower
       let inline cloneArray (arr : Vnode<'k, 'v> array) : Vnode<'k, 'v> array =
           let arr' = Array.zeroCreate 32 // there's an unecessary check against the size here, but that's the only inefficiency
  -        Array.Copy (arr, 0, arr', 0, 32) // param checkss are inefficient, but hopefully there's at least a memcpy underneath...
  +        Array.Copy (arr, 0, arr', 0, 32) // param checks are inefficient, but hopefully there's at least a memcpy underneath...
           arr'
   
       let inline private hashToIndex h dep =
  
positive.code:     let makeEmpty mdep =
          if mdep > 7 then failwith "Vmap max depth should not be greater than 7."
          elif mdep < 0 then failwith "Vmap max depth should not be less than 0."
          else { Vnode = Vnode.empty; EmptyArray = Array.create 32 Vnode.empty; MaxDepth = mdep }
  
      let add (k : 'k) (v : 'v) map =
          { map with Vnode = Vnode.add (Hkv (k, v)) map.EmptyArray map.MaxDepth 0 map.Vnode }
negative.code: /// Variant map.
  type Vmap<'k, 'v when 'k : comparison> =
      private
          { Node : Vnode<'k, 'v>
            EmptyArray : Vnode<'k, 'v> array
            MaxDepth : int }
  
  