summaryrefslogtreecommitdiff
path: root/absl/container/BUILD.bazel
diff options
context:
space:
mode:
authorGravatar Evan Brown <ezb@google.com>2022-10-17 12:56:53 -0700
committerGravatar Copybara-Service <copybara-worker@google.com>2022-10-17 12:58:14 -0700
commitbbf2ed7890615a587f0209c6d7e9b2c08781ee09 (patch)
tree3ae3ec73b24f430ff747dd3af7f0c0a5717f4d6d /absl/container/BUILD.bazel
parent7ab917ec21efb6cdb3c3946fbecb9522ff2af100 (diff)
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/container/BUILD.bazel')
-rw-r--r--absl/container/BUILD.bazel4
1 files changed, 4 insertions, 0 deletions
diff --git a/absl/container/BUILD.bazel b/absl/container/BUILD.bazel
index d8dad8e8..70febdda 100644
--- a/absl/container/BUILD.bazel
+++ b/absl/container/BUILD.bazel
@@ -984,11 +984,13 @@ cc_test(
":btree_test_common",
":counting_allocator",
":test_instance_tracker",
+ "//absl/algorithm:container",
"//absl/base:core_headers",
"//absl/base:raw_logging_internal",
"//absl/flags:flag",
"//absl/hash:hash_testing",
"//absl/memory",
+ "//absl/random",
"//absl/strings",
"//absl/types:compare",
"@com_google_googletest//:gtest_main",
@@ -1011,10 +1013,12 @@ cc_binary(
":flat_hash_map",
":flat_hash_set",
":hashtable_debug",
+ "//absl/algorithm:container",
"//absl/base:raw_logging_internal",
"//absl/hash",
"//absl/log",
"//absl/memory",
+ "//absl/random",
"//absl/strings:cord",
"//absl/strings:str_format",
"//absl/time",