| // Copyright 2017 The Abseil Authors. | |
| // | |
| // Licensed under the Apache License, Version 2.0 (the "License"); | |
| // you may not use this file except in compliance with the License. | |
| // You may obtain a copy of the License at | |
| // | |
| // https://www.apache.org/licenses/LICENSE-2.0 | |
| // | |
| // Unless required by applicable law or agreed to in writing, software | |
| // distributed under the License is distributed on an "AS IS" BASIS, | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| // See the License for the specific language governing permissions and | |
| // limitations under the License. | |
| // | |
| // ----------------------------------------------------------------------------- | |
| // File: algorithm.h | |
| // ----------------------------------------------------------------------------- | |
| // | |
| // This header file contains Google extensions to the standard <algorithm> C++ | |
| // header. | |
| namespace absl { | |
| ABSL_NAMESPACE_BEGIN | |
| // equal() | |
| // rotate() | |
| // | |
| // Historical note: Abseil once provided implementations of these algorithms | |
| // prior to their adoption in C++14. New code should prefer to use the std | |
| // variants. | |
| // | |
| // See the documentation for the STL <algorithm> header for more information: | |
| // https://en.cppreference.com/w/cpp/header/algorithm | |
| using std::equal; | |
| using std::rotate; | |
| // linear_search() | |
| // | |
| // Performs a linear search for `value` using the iterator `first` up to | |
| // but not including `last`, returning true if [`first`, `last`) contains an | |
| // element equal to `value`. | |
| // | |
| // A linear search is of O(n) complexity which is guaranteed to make at most | |
| // n = (`last` - `first`) comparisons. A linear search over short containers | |
| // may be faster than a binary search, even when the container is sorted. | |
| template <typename InputIterator, typename EqualityComparable> | |
| ABSL_INTERNAL_CONSTEXPR_SINCE_CXX20 bool linear_search( | |
| InputIterator first, InputIterator last, const EqualityComparable& value) { | |
| return std::find(first, last, value) != last; | |
| } | |
| ABSL_NAMESPACE_END | |
| } // namespace absl | |