std::ranges::ends_with

Defined in header `<algorithm>`
Call signature
template< std::input_iterator I1, std::sentinel_for<I1> S1, std::input_iterator I2, std::sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity > requires (std::forward_iterator<I1> \|\| std::sized_sentinel_for<S1, I1>) && (std::forward_iterator<I2> \|\| std::sized_sentinel_for<S2, I2>) && std::indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool ends_with( I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {} );	(1)	(since C++23)
template< ranges::input_range R1, ranges::input_range R2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity > requires (ranges::forward_range<R1> \|\| ranges::sized_range<R1>) && (ranges::forward_range<R2> \|\| ranges::sized_range<R2>) && std::indirectly_comparable<ranges::iterator_t<R1>, ranges::iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool ends_with( R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {} );	(2)	(since C++23)
template< /execution-policy/ Ep, std::random_access_iterator I1, std::sized_sentinel_for<I1> S1, std::random_access_iterator I2, std::sized_sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity > requires std::indirectly_comparable<I1, I2, Pred, Proj1, Proj2> bool ends_with( Ep&& policy, I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {} );	(3)	(since C++26)
template< /execution-policy/ Ep, /sized-random-access-range/ R1, /sized-random-access-range/ R2, class Pred = ranges::equal_to, class Proj1 = std::identity, class Proj2 = std::identity > requires std::indirectly_comparable<ranges::iterator_t<R1>, ranges::iterator_t<R2>, Pred, Proj1, Proj2> bool ends_with( Ep&& policy, R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {} );	(4)	(since C++26)

For the definition of /*execution-policy*/, see this page; for the definition of /*sized-random-access-range*/, see this page.

Checks whether the target range matches the suffix of the source range. The elements (projected by proj1 and proj2 respectively) are compared using the binary predicate pred.

1) The source range is [first1, last1), and the target range is [first2, last2).

2) The source range is r1, and the target range is r2.

3,4) Same as (1,2), but executed according to policy.

The function-like entities described on this page are algorithm function objects (informally known as 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.

Parameters

first1, last1	-	the iterator-sentinel pair defining the source range
first2, last2	-	the iterator-sentinel pair defining the target range
r1	-	the source range
r2	-	the target range
pred	-	the predicate to be applied to the (projected) elements
proj1	-	the projection to be applied to the elements in the source range
proj2	-	the projection to be applied to the elements in the target range
policy	-	the execution policy to use

Return value

true if the target range matches the suffix of the source range, false otherwise.

Complexity

Given

\(\scriptsize N_1\)N₁ as ranges::distance(first1, last1) or ranges::distance(r1), and
\(\scriptsize N_2\)N₂ as ranges::distance(first2, last2) or ranges::distance(r2):

If \(\scriptsize N_1 \lt N_2\)N₁<N₂, no comparison will be made. Otherwise:

1,2) At most \(\scriptsize N_2\)N₂ applications of pred, proj1 and proj2.

3,4) \(\scriptsize \mathcal{O}(N_2)\)𝓞(N₂) applications of pred, proj1 and proj2.

Exceptions

3,4) During the execution process:

If the temporary memory resources required for parallelization are not available, std::bad_alloc is thrown.
If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for standard policies, std::terminate is invoked).

Notes

Feature-test macro	Value	Std	Feature
`__cpp_lib_ranges_starts_ends_with`	`202106L`	(C++23)	`std::ranges::starts_with`, `std::ranges::ends_with`

Possible implementation

struct ends_with_fn
{
    template<std::input_iterator I1, std::sentinel_for<I1> S1,
             std::input_iterator I2, std::sentinel_for<I2> S2,
             class Pred = ranges::equal_to,
             class Proj1 = std::identity, class Proj2 = std::identity>
        requires (std::forward_iterator<I1> || std::sized_sentinel_for<S1, I1>) &&
                 (std::forward_iterator<I2> || std::sized_sentinel_for<S2, I2>) &&
                 std::indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
    constexpr bool operator()(I1 first1, S1 last1, I2 first2, S2 last2,
                              Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const
    {
        const auto n1 = ranges::distance(first1, last1);
        const auto n2 = ranges::distance(first2, last2);
        if (n1 < n2)
            return false;
        ranges::advance(first1, n1 - n2);
        return ranges::equal(std::move(first1), last1,
                             std::move(first2), last2,
                             pred, proj1, proj2);
    }
    
    template<ranges::input_range R1, ranges::input_range R2,
             class Pred = ranges::equal_to,
             class Proj1 = std::identity, class Proj2 = std::identity>
        requires (ranges::forward_range<R1> || ranges::sized_range<R1>) &&
                 (ranges::forward_range<R2> || ranges::sized_range<R2>) &&
                 std::indirectly_comparable<ranges::iterator_t<R1>,
                                            ranges::iterator_t<R2>,
                                            Pred, Proj1, Proj2>
    constexpr bool operator()(R1&& r1, R2&& r2,
                              Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) const
    {
        const auto n1 = ranges::distance(r1);
        const auto n2 = ranges::distance(r2);
        if (n1 < n2)
            return false;
        return ranges::equal(views::drop(ranges::ref_view(r1),
                                         n1 - static_cast<decltype(n1)>(n2)),
                             r2, pred, proj1, proj2);
    }
};

inline constexpr ends_with_fn ends_with{};

Example

#include <algorithm>
#include <array>

static_assert
(
    ! std::ranges::ends_with("for", "cast") &&
    std::ranges::ends_with("dynamic_cast", "cast") &&
    ! std::ranges::ends_with("as_const", "cast") &&
    std::ranges::ends_with("bit_cast", "cast") &&
    ! std::ranges::ends_with("to_underlying", "cast") &&
    std::ranges::ends_with(std::array{1, 2, 3, 4}, std::array{3, 4}) &&
    ! std::ranges::ends_with(std::array{1, 2, 3, 4}, std::array{4, 5})
);

int main() {}

Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR	Applied to	Behavior as published	Correct behavior
LWG 4105	C++23	overload (2) calculated the size difference by `N1 - N2`^[1]	changed to `N1 - static_cast<decltype(N1)>(N2)`

Its result might be of an integer-class type, in this case ranges::drop_view cannot be constructed.

ranges::starts_with (C++23)	checks whether a range starts with another range (algorithm function object)
ends_with (C++20)	checks if the string ends with the given suffix (public member function of `std::basic_string<CharT,Traits,Allocator>`)
ends_with (C++20)	checks if the string view ends with the given suffix (public member function of `std::basic_string_view<CharT,Traits>`)