Header file range/v3/algorithm/unique.hpp

#include <range/v3/range_fwd.hpp>

#include <range/v3/begin_end.hpp>

#include <range/v3/range_concepts.hpp>

#include <range/v3/range_traits.hpp>

#include <range/v3/algorithm/adjacent_find.hpp>

#include <range/v3/utility/static_const.hpp>

namespace ranges
{
    inline namespace v3
    {
        struct unique_fn;
        
        inline namespace 
        {
            constexpr auto& unique = static_const<with_braced_init_args<unique_fn>>::value;
        }
    }
}

Class ranges::v3::unique_fn

struct unique_fn
{
    template <typename I, typename S, typename C = equal_to, typename P = ident, int _concept_requires_45 = 42, typename std::enable_if<(_concept_requires_45==43)||(Sortable<I, C, P>()&&Sentinel<S, I>()), int>::type=0>
    I operator()(I begin, S end, C pred_ = C{}, P proj_ = P{}) const;
    
    template <typename Rng, typename C = equal_to, typename P = ident, typename I = range_iterator_t<Rng>, int _concept_requires_65 = 42, typename std::enable_if<(_concept_requires_65==43)||(Sortable<I, C, P>()&&Range<Rng>()), int>::type=0>
    range_safe_iterator_t<Rng> operator()(Rng&& rng, C pred = C{}, P proj = P{}) const;
};

@{

Function template ranges::v3::unique_fn::operator()<I, S, C, P, _concept_requires_45>

template <typename I, typename S, typename C = equal_to, typename P = ident, int _concept_requires_45 = 42, typename std::enable_if<(_concept_requires_45==43)||(Sortable<I, C, P>()&&Sentinel<S, I>()), int>::type=0>
I operator()(I begin, S end, C pred_ = C{}, P proj_ = P{}) const;

template function \c unique_fn::operator()

range-based version of the \c unique std algorithm

Rng is a model of the ForwardView concept I is a model of the ForwardIterator concept S is a model of the Sentinel concept C is a model of the CallableRelation concept



Variable ranges::v3::unique

constexpr auto& unique = static_const<with_braced_init_args<unique_fn>>::value;

unique_fn