anchor.diff:  //                pEntry.Key <-- key
   //                pEntry.HashCode <-- hashCode
   //
  -//                let index = (pEntry.ptr - x.Entries.ptr) / nativeint sizeof<Entry> |> int
  -//                let pBucket = x.Buckets ++ hashCode % x.Capacity
  +//                let index = (pEntry.ptr - entries.ptr) / nativeint sizeof<Entry> |> int
  +//                let pBucket = buckets ++ hashCode % x.Capacity
   //                let ei = !!pBucket - 1
   //
   //                if ei < 0 then
  
positive.code:         sw.Stop()
          Log.line "free:  %A (random order)" (sw.MicroTime / float cnt)
  
          let s = Store()
          for i in 0 .. cnt-1 do
              blocks.[i] <- s.Alloc sizes.[i]
          sw.Restart()
  
negative.code: //                                id
  //                            else
  //                                let n = !!pEntry.Next
  //                                search n (entries + n)
  //
  //                        let n = !!pEntry.Next
  //                        search n (entries + n)
  //
  //            member x.Delete(key : Guid) =
  //                let hashCode = key.GetHashCode() &&& 0x7FFFFFFF
  