aboutsummaryrefslogtreecommitdiff
path: root/absl/algorithm/equal_benchmark.cc
diff options
context:
space:
mode:
authorEvan Brown <ezb@google.com>2022-10-17 12:56:53 -0700
committerCopybara-Service <copybara-worker@google.com>2022-10-17 12:58:14 -0700
commitbbf2ed7890615a587f0209c6d7e9b2c08781ee09 (patch)
tree3ae3ec73b24f430ff747dd3af7f0c0a5717f4d6d /absl/algorithm/equal_benchmark.cc
parent7ab917ec21efb6cdb3c3946fbecb9522ff2af100 (diff)
downloadabseil-bbf2ed7890615a587f0209c6d7e9b2c08781ee09.tar.gz
abseil-bbf2ed7890615a587f0209c6d7e9b2c08781ee09.tar.bz2
abseil-bbf2ed7890615a587f0209c6d7e9b2c08781ee09.zip
Implement btree_iterator::operator-, which is faster than std::distance for btree iterators.
Note: btree_iterator::operator- is still O(N) because in the worst case (end()-begin()), we will have at least one operation per node in the tree, and there are at least N/M nodes, where M (a constant) is the maximum number of values per node. PiperOrigin-RevId: 481716874 Change-Id: Ic0225b7509208ed96b75a2dc626d2aa4a24f4946
Diffstat (limited to 'absl/algorithm/equal_benchmark.cc')
0 files changed, 0 insertions, 0 deletions