Difference between revisions of "cpp/algorithm/ranges/find last"
m (→See also: +ranges::find_end) |
|||
| Line 70: | Line 70: | ||
===Return value=== | ===Return value=== | ||
| − | |||
@1,2,3@ Let {{tt|i}} be the last iterator in the range {{tt|[first,last)}} for which {{tt|E|}} is {{tt|true}}. Returns {{c|ranges::subrange<I>{i, last} }}, or {{c|ranges::subrange<I>{last, last} }} if no such iterator is found. | @1,2,3@ Let {{tt|i}} be the last iterator in the range {{tt|[first,last)}} for which {{tt|E|}} is {{tt|true}}. Returns {{c|ranges::subrange<I>{i, last} }}, or {{c|ranges::subrange<I>{last, last} }} if no such iterator is found. | ||
| Line 77: | Line 76: | ||
===Complexity=== | ===Complexity=== | ||
At most {{tt|last}} - {{tt|first}} applications of the predicate and projection. | At most {{tt|last}} - {{tt|first}} applications of the predicate and projection. | ||
| + | |||
| + | ===Notes=== | ||
| + | {{feature test macro|std=C++23|value=202207L|__cpp_lib_find_last}} | ||
===Example=== | ===Example=== | ||
| Line 86: | Line 88: | ||
{{dsc inc | cpp/algorithm/ranges/dsc find}} | {{dsc inc | cpp/algorithm/ranges/dsc find}} | ||
{{dsc inc | cpp/algorithm/ranges/dsc search}} | {{dsc inc | cpp/algorithm/ranges/dsc search}} | ||
| + | {{dsc inc | cpp/algorithm/ranges/dsc includes}} | ||
{{dsc inc | cpp/algorithm/ranges/dsc binary_search}} | {{dsc inc | cpp/algorithm/ranges/dsc binary_search}} | ||
{{dsc inc | cpp/algorithm/ranges/dsc contains}} | {{dsc inc | cpp/algorithm/ranges/dsc contains}} | ||
Revision as of 02:22, 9 September 2022
| Defined in header <algorithm>
|
||
| Call signature |
||
| template< std::forward_iterator I, std::sentinel_for<I> S, class T, class Proj = std::identity > |
(1) | (since C++23) |
| template< ranges::forward_range R, class T, class Proj = std::identity > requires std::indirect_binary_predicate<ranges::equal_to, |
(2) | (since C++23) |
| template< std::forward_iterator I, std::sentinel_for<I> S, class Proj = std::identity, |
(3) | (since C++23) |
| template< ranges::forward_range R, class Proj = std::identity, std::indirect_unary_predicate<std::projected<ranges::iterator_t<R>, Proj>> |
(4) | (since C++23) |
| template< std::forward_iterator I, std::sentinel_for<I> S, class Proj = std::identity, |
(5) | (since C++23) |
| template< ranges::forward_range R, class Proj = std::identity, std::indirect_unary_predicate<std::projected<ranges::iterator_t<R>, Proj>> |
(6) | (since C++23) |
Returns the last element in the range [first, last) that satisfies specific criteria:
find_last searches for an element equal to valuefind_last_if searches for the last element in the range [first, last) for which predicate pred returns truefind_last_if_not searches for the last element in the range [first, last) for which predicate pred returns falser as the source range, as if using ranges::begin(r) as first and ranges::end(r) as last.The function-like entities described on this page are niebloids, that is:
- Explicit template argument lists cannot be specified when calling any of them.
- None of them are visible to argument-dependent lookup.
- When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup is inhibited.
In practice, they may be implemented as function objects, or with special compiler extensions.
Contents |
Parameters
| first, last | - | the range of elements to examine |
| r | - | the range of the elements to examine |
| value | - | value to compare the elements to |
| pred | - | predicate to apply to the projected elements |
| proj | - | projection to apply to the elements |
Return value
i be the last iterator in the range [first,last) for which E is true. Returns ranges::subrange<I>{i, last}, or ranges::subrange<I>{last, last} if no such iterator is found.Complexity
At most last - first applications of the predicate and projection.
Notes
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_find_last |
202207L | (C++23) |
Example
| This section is incomplete Reason: no example |
See also
| (C++20) |
finds the last sequence of elements in a certain range (niebloid) |
| (C++20)(C++20)(C++20) |
finds the first element satisfying specific criteria (niebloid) |
| (C++20) |
searches for the first occurrence of a range of elements (niebloid) |
| (C++20) |
returns true if one sequence is a subsequence of another (niebloid) |
| (C++20) |
determines if an element exists in a partially-ordered range (niebloid) |
| (C++23)(C++23) |
checks if the range contains the given element or subrange (niebloid) |
