summaryrefslogtreecommitdiff
path: root/absl/strings/str_split_benchmark.cc
diff options
context:
space:
mode:
authorGravatar Abseil Team <absl-team@google.com>2022-05-04 12:04:37 -0700
committerGravatar Copybara-Service <copybara-worker@google.com>2022-05-04 12:05:20 -0700
commit384a25d5e19228ceb7641676aefd58c4ca7a9568 (patch)
treed0757888b1415bd2d3bd3f0ea8c027323fe26b2d /absl/strings/str_split_benchmark.cc
parent02934b492135d7c9c40fecf8e7873380b46c2223 (diff)
Improve analysis of the number of extra `==` operations, which was overly complicated, slightly incorrect.
The old analysis viewed it as birthday attack, which asks how often there are multiple values in the probe same probe sequence with the same H2. In their own words, this analysis "breaks down" at around `n = 12`. Instead we can answer a simpler question, which is, if a probe sequence examines `k` objects that are not what we are looking for, what's the number of calls `==`? The expectation is simply `k/128`. PiperOrigin-RevId: 446518063 Change-Id: Ie879bd4f6c97979822bc9d550b9e2503b1418c78
Diffstat (limited to 'absl/strings/str_split_benchmark.cc')
0 files changed, 0 insertions, 0 deletions