88 lines
5.0 KiB
Markdown
88 lines
5.0 KiB
Markdown
[alg.adjacent.find]
|
||
|
||
# 26 Algorithms library [[algorithms]](./#algorithms)
|
||
|
||
## 26.6 Non-modifying sequence operations [[alg.nonmodifying]](alg.nonmodifying#alg.adjacent.find)
|
||
|
||
### 26.6.10 Adjacent find [alg.adjacent.find]
|
||
|
||
[ð](#lib:adjacent_find)
|
||
|
||
`template<class ForwardIterator>
|
||
constexpr ForwardIterator
|
||
adjacent_find(ForwardIterator first, ForwardIterator last);
|
||
template<class ExecutionPolicy, class ForwardIterator>
|
||
ForwardIterator
|
||
adjacent_find(ExecutionPolicy&& exec,
|
||
ForwardIterator first, ForwardIterator last);
|
||
|
||
template<class ForwardIterator, class BinaryPredicate>
|
||
constexpr ForwardIterator
|
||
adjacent_find(ForwardIterator first, ForwardIterator last,
|
||
BinaryPredicate pred);
|
||
template<class ExecutionPolicy, class ForwardIterator, class BinaryPredicate>
|
||
ForwardIterator
|
||
adjacent_find(ExecutionPolicy&& exec,
|
||
ForwardIterator first, ForwardIterator last,
|
||
BinaryPredicate pred);
|
||
|
||
template<[forward_iterator](iterator.concept.forward#concept:forward_iterator "24.3.4.11 Concept forward_iterator [iterator.concept.forward]") I, [sentinel_for](iterator.concept.sentinel#concept:sentinel_for "24.3.4.7 Concept sentinel_for [iterator.concept.sentinel]")<I> S, class Proj = identity,
|
||
[indirect_binary_predicate](indirectcallable.indirectinvocable#concept:indirect_binary_predicate "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>,
|
||
projected<I, Proj>> Pred = ranges::equal_to>
|
||
constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {});
|
||
template<[forward_range](range.refinements#concept:forward_range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
|
||
[indirect_binary_predicate](indirectcallable.indirectinvocable#concept:indirect_binary_predicate "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>,
|
||
projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
|
||
constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {});
|
||
|
||
template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [random_access_iterator](iterator.concept.random.access#concept:random_access_iterator "24.3.4.13 Concept random_access_iterator [iterator.concept.random.access]") I, [sized_sentinel_for](iterator.concept.sizedsentinel#concept:sized_sentinel_for "24.3.4.8 Concept sized_sentinel_for [iterator.concept.sizedsentinel]")<I> S,
|
||
class Proj = identity,
|
||
[indirect_binary_predicate](indirectcallable.indirectinvocable#concept:indirect_binary_predicate "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<I, Proj>,
|
||
projected<I, Proj>> Pred = ranges::equal_to>
|
||
I ranges::adjacent_find(Ep&& exec, I first, S last, Pred pred = {}, Proj proj = {});
|
||
template<[execution-policy](algorithms.parallel.defns#concept:execution-policy "26.3.1 Preamble [algorithms.parallel.defns]") Ep, [sized-random-access-range](range.refinements#concept:sized-random-access-range "25.4.6 Other range refinements [range.refinements]") R, class Proj = identity,
|
||
[indirect_binary_predicate](indirectcallable.indirectinvocable#concept:indirect_binary_predicate "24.3.6.3 Indirect callables [indirectcallable.indirectinvocable]")<projected<iterator_t<R>, Proj>,
|
||
projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
|
||
borrowed_iterator_t<R>
|
||
ranges::adjacent_find(Ep&& exec, R&& r, Pred pred = {}, Proj proj = {});
|
||
`
|
||
|
||
[1](#1)
|
||
|
||
[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L5346)
|
||
|
||
Let E be:
|
||
|
||
- [(1.1)](#1.1)
|
||
|
||
*i == *(i + 1) for the overloads with no parameter pred;
|
||
|
||
- [(1.2)](#1.2)
|
||
|
||
pred(*i, *(i + 1)) != false for the overloads with a parameter pred and no parameter proj;
|
||
|
||
- [(1.3)](#1.3)
|
||
|
||
bool(invoke(pred, invoke(proj, *i), invoke(proj, *(i + 1)))) for the overloads with both parameters pred and proj[.](#1.sentence-1)
|
||
|
||
[2](#2)
|
||
|
||
[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L5355)
|
||
|
||
*Returns*: The first iterator i such that both i and i + 1 are in the range [first, last)
|
||
for which E holds[.](#2.sentence-1)
|
||
|
||
Returns last if no such iterator is found[.](#2.sentence-2)
|
||
|
||
[3](#3)
|
||
|
||
[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/algorithms.tex#L5362)
|
||
|
||
*Complexity*: For the non-parallel algorithm overloads,
|
||
exactly min((i - first) + 1, (last - first) - 1) applications of the corresponding predicate,
|
||
where i is adjacent_find's return value[.](#3.sentence-1)
|
||
|
||
For the parallel algorithm overloads,O(last - first) applications of the corresponding predicate[.](#3.sentence-2)
|
||
|
||
No more than twice as many applications of any projection[.](#3.sentence-3)
|