aboutsummaryrefslogtreecommitdiff
path: root/absl/algorithm
diff options
context:
space:
mode:
authorBenjamin Barenblat <bbaren@google.com>2023-09-07 13:16:09 -0400
committerBenjamin Barenblat <bbaren@google.com>2023-09-07 13:16:09 -0400
commit6fdbff8bbce2a1debdc060df381f39e3dcfb65af (patch)
tree71f1ef38477a65d5cce472fc042c90087c2bb351 /absl/algorithm
parent8d4a80fe37176b1170d7dce0772dea9584ec3e32 (diff)
parent29bf8085f3bf17b84d30e34b3d7ff8248fda404e (diff)
downloadabseil-6fdbff8bbce2a1debdc060df381f39e3dcfb65af.tar.gz
abseil-6fdbff8bbce2a1debdc060df381f39e3dcfb65af.tar.bz2
abseil-6fdbff8bbce2a1debdc060df381f39e3dcfb65af.zip
Merge new upstream LTS 20230802.0
Diffstat (limited to 'absl/algorithm')
-rw-r--r--absl/algorithm/container.h5
1 files changed, 3 insertions, 2 deletions
diff --git a/absl/algorithm/container.h b/absl/algorithm/container.h
index c7782d4f..679e0267 100644
--- a/absl/algorithm/container.h
+++ b/absl/algorithm/container.h
@@ -1131,7 +1131,7 @@ c_equal_range(Sequence& sequence, const T& value, LessThan&& comp) {
// to test if any element in the sorted container contains a value equivalent to
// 'value'.
template <typename Sequence, typename T>
-bool c_binary_search(Sequence&& sequence, const T& value) {
+bool c_binary_search(const Sequence& sequence, const T& value) {
return std::binary_search(container_algorithm_internal::c_begin(sequence),
container_algorithm_internal::c_end(sequence),
value);
@@ -1140,7 +1140,8 @@ bool c_binary_search(Sequence&& sequence, const T& value) {
// Overload of c_binary_search() for performing a `comp` comparison other than
// the default `operator<`.
template <typename Sequence, typename T, typename LessThan>
-bool c_binary_search(Sequence&& sequence, const T& value, LessThan&& comp) {
+bool c_binary_search(const Sequence& sequence, const T& value,
+ LessThan&& comp) {
return std::binary_search(container_algorithm_internal::c_begin(sequence),
container_algorithm_internal::c_end(sequence),
value, std::forward<LessThan>(comp));