Container-based version of the <algorithm> std::search_n() function to search a container for the first sequence of N elements.
Declared in <absl/algorithm/container.h>
template<
typename Sequence,
typename Size,
typename T>
constexpr
/* implementation-defined */
c_search_n(
Sequence& sequence,
Size count,
T&& value);
An iterator to the beginning of the found run, or the end iterator if none is found.
| Name | Description |
|---|---|
| sequence | The container to search. |
| count | The number of consecutive matching elements to search for. |
| value | The value each of the consecutive elements must equal. |