feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

Add range-based overloads of find*_backward().

Browse Source
This commit is contained in:
Zach Laine
2018-05-12 16:03:41 -05:00
parent 6c68cf8624
commit c5c5d24ff3
4 changed files with 163 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
doc/find_not.qbk
View File

@ -43,10 +43,10 @@ our find condition.
InputIter find_not(InputIter first, Sentinel last, T const & x);
template<typename Range, typename T>
typename boost::range_iterator<Range>::type find_not(Range & r, T const & x);
boost::range_iterator<Range> find_not(Range & r, T const & x);
The function `find_not` returns the first value in the sequence `[first,
last)` that is not equal to `x`.
The function `find_not` returns the first value that is not equal to `x` in
the sequence `[first, last)` or `r`, respectively.
[heading Examples]
@ -72,6 +72,10 @@ Linear.
`find_not` takes its parameters by value and do not depend upon any global
state. Therefore, it provides the strong exception guarantee.
[heading Notes]
`constexpr` in C++14 or later.
[endsect]
[/ File equal.qbk