20 General utilities library [utilities]

20.14 Function objects [function.objects]

20.14.1 General [function.objects.general]

A function object type is an object type that can be the type of the postfix-expression in a function call ([expr.call], [over.match.call]).225

A function object is an object of a function object type.

In the places where one would expect to pass a pointer to a function to an algorithmic template, the interface is specified to accept a function object.

This not only makes algorithmic templates work with pointers to functions, but also enables them to work with arbitrary function objects.

225)

Such a type is a function pointer or a class type which has a member operator() or a class type which has a conversion to a pointer to function.

⮥

20.14.2 Header <functional> synopsis [functional.syn]

namespace std { // [func.invoke], invoke template<class F, class... Args> constexpr invoke_result_t<F, Args...> invoke(F&& f, Args&&... args) noexcept(is_nothrow_invocable_v<F, Args...>); // [refwrap], reference_wrapper template<class T> class reference_wrapper; template<class T> constexpr reference_wrapper<T> ref(T&) noexcept; template<class T> constexpr reference_wrapper<const T> cref(const T&) noexcept; template<class T> void ref(const T&&) = delete; template<class T> void cref(const T&&) = delete; template<class T> constexpr reference_wrapper<T> ref(reference_wrapper<T>) noexcept; template<class T> constexpr reference_wrapper<const T> cref(reference_wrapper<T>) noexcept; // [arithmetic.operations], arithmetic operations template<class T = void> struct plus; template<class T = void> struct minus; template<class T = void> struct multiplies; template<class T = void> struct divides; template<class T = void> struct modulus; template<class T = void> struct negate; template<> struct plus<void>; template<> struct minus<void>; template<> struct multiplies<void>; template<> struct divides<void>; template<> struct modulus<void>; template<> struct negate<void>; // [comparisons], comparisons template<class T = void> struct equal_to; template<class T = void> struct not_equal_to; template<class T = void> struct greater; template<class T = void> struct less; template<class T = void> struct greater_equal; template<class T = void> struct less_equal; template<> struct equal_to<void>; template<> struct not_equal_to<void>; template<> struct greater<void>; template<> struct less<void>; template<> struct greater_equal<void>; template<> struct less_equal<void>; // [comparisons.three.way], class compare_three_way struct compare_three_way; // [logical.operations], logical operations template<class T = void> struct logical_and; template<class T = void> struct logical_or; template<class T = void> struct logical_not; template<> struct logical_and<void>; template<> struct logical_or<void>; template<> struct logical_not<void>; // [bitwise.operations], bitwise operations template<class T = void> struct bit_and; template<class T = void> struct bit_or; template<class T = void> struct bit_xor; template<class T = void> struct bit_not; template<> struct bit_and<void>; template<> struct bit_or<void>; template<> struct bit_xor<void>; template<> struct bit_not<void>; // [func.identity], identity struct identity; // [func.not.fn], function template not_fn template<class F> constexpr unspecified not_fn(F&& f); // [func.bind.front], function template bind_front template<class F, class... Args> constexpr unspecified bind_front(F&&, Args&&...); // [func.bind], bind template<class T> struct is_bind_expression; template<class T> inline constexpr bool is_bind_expression_v = is_bind_expression<T>::value; template<class T> struct is_placeholder; template<class T> inline constexpr int is_placeholder_v = is_placeholder<T>::value; template<class F, class... BoundArgs> constexpr unspecified bind(F&&, BoundArgs&&...); template<class R, class F, class... BoundArgs> constexpr unspecified bind(F&&, BoundArgs&&...); namespace placeholders { // M is the implementation-defined number of placeholders see below _1; see below _2; . . . see below _M; } // [func.memfn], member function adaptors template<class R, class T> constexpr unspecified mem_fn(R T::*) noexcept; // [func.wrap], polymorphic function wrappers class bad_function_call; template<class> class function; // not defined template<class R, class... ArgTypes> class function<R(ArgTypes...)>; template<class R, class... ArgTypes> void swap(function<R(ArgTypes...)>&, function<R(ArgTypes...)>&) noexcept; template<class R, class... ArgTypes> bool operator==(const function<R(ArgTypes...)>&, nullptr_t) noexcept; // [func.search], searchers template<class ForwardIterator, class BinaryPredicate = equal_to<>> class default_searcher; template<class RandomAccessIterator, class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, class BinaryPredicate = equal_to<>> class boyer_moore_searcher; template<class RandomAccessIterator, class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, class BinaryPredicate = equal_to<>> class boyer_moore_horspool_searcher; // [unord.hash], class template hash template<class T> struct hash; namespace ranges { // [range.cmp], concept-constrained comparisons struct equal_to; struct not_equal_to; struct greater; struct less; struct greater_equal; struct less_equal; } }

[Example 1:

If a C++ program wants to have a by-element addition of two vectors a and b containing double and put the result into a, it can do: transform(a.begin(), a.end(), b.begin(), a.begin(), plus<double>());

— end example]

[Example 2:

To negate every element of a: transform(a.begin(), a.end(), a.begin(), negate<double>());

— end example]

20.14.3 Definitions [func.def]

The following definitions apply to this Clause:

A call signature is the name of a return type followed by a parenthesized comma-separated list of zero or more argument types.

A callable type is a function object type or a pointer to member.

A callable object is an object of a callable type.

A call wrapper type is a type that holds a callable object and supports a call operation that forwards to that object.

A call wrapper is an object of a call wrapper type.

A target object is the callable object held by a call wrapper.

A call wrapper type may additionally hold a sequence of objects and references that may be passed as arguments to the target object.

These entities are collectively referred to as bound argument entities.

The target object and bound argument entities of the call wrapper are collectively referred to as state entities.

20.14.4 Requirements [func.require]

Define INVOKE(f, t

_{1}

, t

_{2}

, …, t

_{N}

) as follows:

(1.1)
(t $_{1}$ .*f)(t $_{2}$ , …, t $_{N}$ ) when f is a pointer to a member function of a class T and is_base_of_v<T, remove_reference_t<decltype(t $_{1}$ )>> is true;
(1.2)
(t $_{1}$ .get().*f)(t $_{2}$ , …, t $_{N}$ ) when f is a pointer to a member function of a class T and remove_cvref_t<decltype(t $_{1}$ )> is a specialization of reference_wrapper;
(1.3)
((*t $_{1}$ ).*f)(t $_{2}$ , …, t $_{N}$ ) when f is a pointer to a member function of a class T and t $_{1}$ does not satisfy the previous two items;
(1.4)
t $_{1}$ .*f when N == 1 and f is a pointer to data member of a class T and is_base_of_v<T, remove_reference_t<decltype(t $_{1}$ )>> is true;
(1.5)
t $_{1}$ .get().*f when N == 1 and f is a pointer to data member of a class T and remove_cvref_t<decltype(t $_{1}$ )> is a specialization of reference_wrapper;
(1.6)
(*t $_{1}$ ).*f when N == 1 and f is a pointer to data member of a class T and t $_{1}$ does not satisfy the previous two items;
(1.7)
f(t $_{1}$ , t $_{2}$ , …, t $_{N}$ ) in all other cases.

Define INVOKE<R>(f, t

_{1}

, t

_{2}

, …, t

_{N}

) as static_cast<void>(INVOKE(f, t

_{1}

, t

_{2}

, …, t

_{N}

)) if R is cv void, otherwise INVOKE(f, t

_{1}

, t

_{2}

, …, t

_{N}

) implicitly converted to R.

Every call wrapper ([func.def]) meets the Cpp17MoveConstructible and Cpp17Destructible requirements.

An argument forwarding call wrapper is a call wrapper that can be called with an arbitrary argument list and delivers the arguments to the wrapped callable object as references.

This forwarding step delivers rvalue arguments as rvalue references and lvalue arguments as lvalue references.

[Note 1:

In a typical implementation, argument forwarding call wrappers have an overloaded function call operator of the form template<class... UnBoundArgs> constexpr R operator()(UnBoundArgs&&... unbound_args) cv-qual;

— end note]

A perfect forwarding call wrapper is an argument forwarding call wrapper that forwards its state entities to the underlying call expression.

This forwarding step delivers a state entity of type T as cv T& when the call is performed on an lvalue of the call wrapper type and as cv T&& otherwise, where cv represents the cv-qualifiers of the call wrapper and where cv shall be neither volatile nor const volatile.

A call pattern defines the semantics of invoking a perfect forwarding call wrapper.

A postfix call performed on a perfect forwarding call wrapper is expression-equivalent ([defns.expression-equivalent]) to an expression e determined from its call pattern cp by replacing all occurrences of the arguments of the call wrapper and its state entities with references as described in the corresponding forwarding steps.

A simple call wrapper is a perfect forwarding call wrapper that meets the Cpp17CopyConstructible and Cpp17CopyAssignable requirements and whose copy constructor, move constructor, and assignment operators are constexpr functions that do not throw exceptions.

The copy/move constructor of an argument forwarding call wrapper has the same apparent semantics as if memberwise copy/move of its state entities were performed ([class.copy.ctor]).

[Note 2:

This implies that each of the copy/move constructors has the same exception-specification as the corresponding implicit definition and is declared as constexpr if the corresponding implicit definition would be considered to be constexpr.

— end note]

Argument forwarding call wrappers returned by a given standard library function template have the same type if the types of their corresponding state entities are the same.

20.14.5 Function template invoke [func.invoke]

🔗

template<class F, class... Args>
  constexpr invoke_result_t<F, Args...> invoke(F&& f, Args&&... args)
    noexcept(is_nothrow_invocable_v<F, Args...>);

Returns: INVOKE(std::forward<F>(f), std::forward<Args>(args)...).

20.14.6 Class template reference_wrapper [refwrap]

20.14.6.1 General [refwrap.general]

namespace std { template<class T> class reference_wrapper { public: // types using type = T; // construct/copy/destroy template<class U> constexpr reference_wrapper(U&&) noexcept(see below); constexpr reference_wrapper(const reference_wrapper& x) noexcept; // assignment constexpr reference_wrapper& operator=(const reference_wrapper& x) noexcept; // access constexpr operator T& () const noexcept; constexpr T& get() const noexcept; // invocation template<class... ArgTypes> constexpr invoke_result_t<T&, ArgTypes...> operator()(ArgTypes&&...) const; }; template<class T> reference_wrapper(T&) -> reference_wrapper<T>; }

reference_wrapper<T> is a Cpp17CopyConstructible and Cpp17CopyAssignable wrapper around a reference to an object or function of type T.

reference_wrapper<T> is a trivially copyable type .

The template parameter T of reference_wrapper may be an incomplete type.

20.14.6.2 Constructors and destructor [refwrap.const]

🔗

template<class U>
  constexpr reference_wrapper(U&& u) noexcept(see below);

Let FUN denote the exposition-only functions void FUN(T&) noexcept; void FUN(T&&) = delete;

Constraints: The expression FUN(declval()) is well-formed and is_same_v<remove_cvref_t, reference_wrapper> is false.

Effects: Creates a variable r as if by T& r = std::forward(u), then constructs a reference_wrapper object that stores a reference to r.

Remarks: The expression inside noexcept is equivalent to noexcept(FUN(declval())).

🔗

constexpr reference_wrapper(const reference_wrapper& x) noexcept;

Effects: Constructs a reference_wrapper object that stores a reference to x.get().

20.14.6.3 Assignment [refwrap.assign]

🔗

constexpr reference_wrapper& operator=(const reference_wrapper& x) noexcept;

Postconditions: *this stores a reference to x.get().

20.14.6.4 Access [refwrap.access]

🔗

constexpr operator T& () const noexcept;

Returns: The stored reference.

🔗

constexpr T& get() const noexcept;

Returns: The stored reference.

20.14.6.5 Invocation [refwrap.invoke]

🔗

template<class... ArgTypes>
  constexpr invoke_result_t<T&, ArgTypes...>
    operator()(ArgTypes&&... args) const;

Mandates: T is a complete type.

Returns: INVOKE(get(), std::forward<ArgTypes>(args)...).

([func.require])

20.14.6.6 Helper functions [refwrap.helpers]

The template parameter T of the following ref and cref function templates may be an incomplete type.

🔗

template<class T> constexpr reference_wrapper<T> ref(T& t) noexcept;

Returns: reference_wrapper<T>(t).

🔗

template<class T> constexpr reference_wrapper<T> ref(reference_wrapper<T> t) noexcept;

Returns: ref(t.get()).

🔗

template<class T> constexpr reference_wrapper<const T> cref(const T& t) noexcept;

Returns: reference_wrapper <const T>(t).

🔗

template<class T> constexpr reference_wrapper<const T> cref(reference_wrapper<T> t) noexcept;

Returns: cref(t.get()).

20.14.7 Arithmetic operations [arithmetic.operations]

20.14.7.1 General [arithmetic.operations.general]

The library provides basic function object classes for all of the arithmetic operators in the language ([expr.mul], [expr.add]).

20.14.7.2 Class template plus [arithmetic.operations.plus]

🔗

template<class T = void> struct plus {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x + y.

🔗

template<> struct plus<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) + std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) + std::forward<U>(u));

Returns: std::forward<T>(t) + std::forward(u).

20.14.7.3 Class template minus [arithmetic.operations.minus]

🔗

template<class T = void> struct minus {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x - y.

🔗

template<> struct minus<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) - std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) - std::forward<U>(u));

Returns: std::forward<T>(t) - std::forward(u).

20.14.7.4 Class template multiplies [arithmetic.operations.multiplies]

🔗

template<class T = void> struct multiplies {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x * y.

🔗

template<> struct multiplies<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) * std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) * std::forward<U>(u));

Returns: std::forward<T>(t) * std::forward(u).

20.14.7.5 Class template divides [arithmetic.operations.divides]

🔗

template<class T = void> struct divides {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x / y.

🔗

template<> struct divides<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) / std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) / std::forward<U>(u));

Returns: std::forward<T>(t) / std::forward(u).

20.14.7.6 Class template modulus [arithmetic.operations.modulus]

🔗

template<class T = void> struct modulus {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x % y.

🔗

template<> struct modulus<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) % std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) % std::forward<U>(u));

Returns: std::forward<T>(t) % std::forward(u).

20.14.7.7 Class template negate [arithmetic.operations.negate]

🔗

template<class T = void> struct negate {
  constexpr T operator()(const T& x) const;
};

🔗

constexpr T operator()(const T& x) const;

Returns: -x.

🔗

template<> struct negate<void> {
  template<class T> constexpr auto operator()(T&& t) const
    -> decltype(-std::forward<T>(t));

  using is_transparent = unspecified;
};

🔗

template<class T> constexpr auto operator()(T&& t) const
    -> decltype(-std::forward<T>(t));

Returns: -std::forward<T>(t).

20.14.8 Comparisons [comparisons]

20.14.8.1 General [comparisons.general]

The library provides basic function object classes for all of the comparison operators in the language ([expr.rel], [expr.eq]).

For templates less, greater, less_equal, and greater_equal, the specializations for any pointer type yield a result consistent with the implementation-defined strict total order over pointers ([defns.order.ptr]).

[Note 1:

If a ()(a, b), (a > b) == greater()(a, b), and so forth.

— end note]

For template specializations less<void>, greater<void>, less_equal<void>, and greater_equal<void>, if the call operator calls a built-in operator comparing pointers, the call operator yields a result consistent with the implementation-defined strict total order over pointers.

20.14.8.2 Class template equal_to [comparisons.equal.to]

🔗

template<class T = void> struct equal_to {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x == y.

🔗

template<> struct equal_to<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) == std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) == std::forward<U>(u));

Returns: std::forward<T>(t) == std::forward(u).

20.14.8.3 Class template not_equal_to [comparisons.not.equal.to]

🔗

template<class T = void> struct not_equal_to {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x != y.

🔗

template<> struct not_equal_to<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) != std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) != std::forward<U>(u));

Returns: std::forward<T>(t) != std::forward(u).

20.14.8.4 Class template greater [comparisons.greater]

🔗

template<class T = void> struct greater {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x > y.

🔗

template<> struct greater<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) > std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) > std::forward<U>(u));

Returns: std::forward<T>(t) > std::forward(u).

20.14.8.5 Class template less [comparisons.less]

🔗

template<class T = void> struct less {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x < y.

🔗

template<> struct less<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) < std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) < std::forward<U>(u));

Returns: std::forward<T>(t) < std::forward(u).

20.14.8.6 Class template greater_equal [comparisons.greater.equal]

🔗

template<class T = void> struct greater_equal {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x >= y.

🔗

template<> struct greater_equal<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) >= std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) >= std::forward<U>(u));

Returns: std::forward<T>(t) >= std::forward(u).

20.14.8.7 Class template less_equal [comparisons.less.equal]

🔗

template<class T = void> struct less_equal {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x <= y.

🔗

template<> struct less_equal<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) <= std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) <= std::forward<U>(u));

Returns: std::forward<T>(t) <= std::forward(u).

20.14.8.8 Class compare_three_way [comparisons.three.way]

In this subclause, BUILTIN-PTR-THREE-WAY(T, U) for types T and U is a boolean constant expression.

BUILTIN-PTR-THREE-WAY(T, U) is true if and only if <=> in the expression declval<T>() <=> declval() resolves to a built-in operator comparing pointers.

struct compare_three_way { template<class T, class U> requires three_way_comparable_with<T, U> || BUILTIN-PTR-THREE-WAY(T, U) constexpr auto operator()(T&& t, U&& u) const; using is_transparent = unspecified; };

🔗

template<class T, class U>
  requires three_way_comparable_with<T, U> || BUILTIN-PTR-THREE-WAY(T, U)
constexpr auto operator()(T&& t, U&& u) const;

Preconditions: If the expression std::forward<T>(t) <=> std::forward(u) results in a call to a built-in operator <=> comparing pointers of type P, the conversion sequences from both T and U to P are equality-preserving ([concepts.equality]).

Effects:

(3.1)
If the expression std::forward<T>(t) <=> std::forward(u) results in a call to a built-in operator <=> comparing pointers of type P, returns strong_ordering::less if (the converted value of) t precedes u in the implementation-defined strict total order over pointers ([defns.order.ptr]), strong_ordering::greater if u precedes t, and otherwise strong_ordering::equal.
(3.2)
Otherwise, equivalent to: return std::forward<T>(t) <=> std::forward(u);

20.14.9 Concept-constrained comparisons [range.cmp]

In this subclause, BUILTIN-PTR-CMP(T, op, U) for types T and U and where op is an equality ([expr.eq]) or relational operator ([expr.rel]) is a boolean constant expression.

BUILTIN-PTR-CMP(T, op, U) is true if and only if op in the expression declval<T>() op declval() resolves to a built-in operator comparing pointers.

🔗

struct ranges::equal_to {
  template<class T, class U>
    requires equality_comparable_with<T, U> || BUILTIN-PTR-CMP(T, ==, U)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

Preconditions: If the expression std::forward<T>(t) == std::forward(u) results in a call to a built-in operator == comparing pointers of type P, the conversion sequences from both T and U to P are equality-preserving ([concepts.equality]).

Effects:

(3.1)
If the expression std::forward<T>(t) == std::forward(u) results in a call to a built-in operator == comparing pointers: returns false if either (the converted value of) t precedes u or u precedes t in the implementation-defined strict total order over pointers ([defns.order.ptr]) and otherwise true.
(3.2)
Otherwise, equivalent to: return std::forward<T>(t) == std::forward(u);

🔗

struct ranges::not_equal_to {
  template<class T, class U>
    requires equality_comparable_with<T, U> || BUILTIN-PTR-CMP(T, ==, U)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

operator() has effects equivalent to: return !ranges::equal_to{}(std::forward<T>(t), std::forward(u));

🔗

struct ranges::greater {
  template<class T, class U>
    requires totally_ordered_with<T, U> || BUILTIN-PTR-CMP(U, <, T)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

operator() has effects equivalent to: return ranges::less{}(std::forward(u), std::forward<T>(t));

🔗

struct ranges::less {
  template<class T, class U>
    requires totally_ordered_with<T, U> || BUILTIN-PTR-CMP(T, <, U)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

Preconditions: If the expression std::forward<T>(t) < std::forward(u) results in a call to a built-in operator < comparing pointers of type P, the conversion sequences from both T and U to P are equality-preserving ([concepts.equality]).

For any expressions ET and EU such that decltype((ET)) is T and decltype((EU)) is U, exactly one of ranges::less{}(ET, EU), ranges::less{}(EU, ET), or ranges::equal_to{}(ET, EU) is true.

Effects:

(7.1)
If the expression std::forward<T>(t) < std::forward(u) results in a call to a built-in operator < comparing pointers: returns true if (the converted value of) t precedes u in the implementation-defined strict total order over pointers ([defns.order.ptr]) and otherwise false.
(7.2)
Otherwise, equivalent to: return std::forward<T>(t) < std::forward(u);

🔗

struct ranges::greater_equal {
  template<class T, class U>
    requires totally_ordered_with<T, U> || BUILTIN-PTR-CMP(T, <, U)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

operator() has effects equivalent to: return !ranges::less{}(std::forward<T>(t), std::forward(u));

🔗

struct ranges::less_equal {
  template<class T, class U>
    requires totally_ordered_with<T, U> || BUILTIN-PTR-CMP(U, <, T)
  constexpr bool operator()(T&& t, U&& u) const;

  using is_transparent = unspecified;
};

operator() has effects equivalent to: return !ranges::less{}(std::forward(u), std::forward<T>(t));

20.14.10 Logical operations [logical.operations]

20.14.10.1 General [logical.operations.general]

The library provides basic function object classes for all of the logical operators in the language ([expr.log.and], [expr.log.or], [expr.unary.op]).

20.14.10.2 Class template logical_and [logical.operations.and]

🔗

template<class T = void> struct logical_and {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x && y.

🔗

template<> struct logical_and<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) && std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) && std::forward<U>(u));

Returns: std::forward<T>(t) && std::forward(u).

20.14.10.3 Class template logical_or [logical.operations.or]

🔗

template<class T = void> struct logical_or {
  constexpr bool operator()(const T& x, const T& y) const;
};

🔗

constexpr bool operator()(const T& x, const T& y) const;

Returns: x || y.

🔗

template<> struct logical_or<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) || std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) || std::forward<U>(u));

Returns: std::forward<T>(t) || std::forward(u).

20.14.10.4 Class template logical_not [logical.operations.not]

🔗

template<class T = void> struct logical_not {
  constexpr bool operator()(const T& x) const;
};

🔗

constexpr bool operator()(const T& x) const;

Returns: !x.

🔗

template<> struct logical_not<void> {
  template<class T> constexpr auto operator()(T&& t) const
    -> decltype(!std::forward<T>(t));

  using is_transparent = unspecified;
};

🔗

template<class T> constexpr auto operator()(T&& t) const
    -> decltype(!std::forward<T>(t));

Returns: !std::forward<T>(t).

20.14.11 Bitwise operations [bitwise.operations]

20.14.11.1 General [bitwise.operations.general]

The library provides basic function object classes for all of the bitwise operators in the language ([expr.bit.and], [expr.or], [expr.xor], [expr.unary.op]).

20.14.11.2 Class template bit_and [bitwise.operations.and]

🔗

template<class T = void> struct bit_and {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x & y.

🔗

template<> struct bit_and<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) & std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) & std::forward<U>(u));

Returns: std::forward<T>(t) & std::forward(u).

20.14.11.3 Class template bit_or [bitwise.operations.or]

🔗

template<class T = void> struct bit_or {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x | y.

🔗

template<> struct bit_or<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) | std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) | std::forward<U>(u));

Returns: std::forward<T>(t) | std::forward(u).

20.14.11.4 Class template bit_xor [bitwise.operations.xor]

🔗

template<class T = void> struct bit_xor {
  constexpr T operator()(const T& x, const T& y) const;
};

🔗

constexpr T operator()(const T& x, const T& y) const;

Returns: x ^ y.

🔗

template<> struct bit_xor<void> {
  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));

  using is_transparent = unspecified;
};

🔗

template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));

Returns: std::forward<T>(t) ^ std::forward(u).

20.14.11.5 Class template bit_not [bitwise.operations.not]

🔗

template<class T = void> struct bit_not {
  constexpr T operator()(const T& x) const;
};

🔗

constexpr T operator()(const T& x) const;

Returns: ~x.

🔗

template<> struct bit_not<void> {
  template<class T> constexpr auto operator()(T&& t) const
    -> decltype(~std::forward<T>(t));

  using is_transparent = unspecified;
};

🔗

template<class T> constexpr auto operator()(T&&) const
    -> decltype(~std::forward<T>(t));

Returns: ~std::forward<T>(t).

20.14.12 Class identity [func.identity]

🔗

struct identity {
  template<class T>
    constexpr T&& operator()(T&& t) const noexcept;

  using is_transparent = unspecified;
};

template<class T>
  constexpr T&& operator()(T&& t) const noexcept;

Effects: Equivalent to: return std::forward<T>(t);

20.14.13 Function template not_fn [func.not.fn]

🔗

template<class F> constexpr unspecified not_fn(F&& f);

In the text that follows:

(1.1)
g is a value of the result of a not_fn invocation,
(1.2)
FD is the type decay_t<F>,
(1.3)
fd is the target object of g ([func.def]) of type FD, direct-non-list-initialized with std::forward<F>(f),
(1.4)
call_args is an argument pack used in a function call expression ([expr.call]) of g.

Mandates: is_constructible_v<FD, F> && is_move_constructible_v<FD> is true.

Preconditions: FD meets the Cpp17MoveConstructible requirements.

Returns: A perfect forwarding call wrapper g with call pattern !invoke(fd, call_args...).

Throws: Any exception thrown by the initialization of fd.

20.14.14 Function template bind_front [func.bind.front]

🔗

template<class F, class... Args>
  constexpr unspecified bind_front(F&& f, Args&&... args);

In the text that follows:

(1.1)
g is a value of the result of a bind_front invocation,
(1.2)
FD is the type decay_t<F>,
(1.3)
fd is the target object of g ([func.def]) of type FD, direct-non-list-initialized with std::forward<F>(f),
(1.4)
BoundArgs is a pack that denotes decay_t<Args>...,
(1.5)
bound_args is a pack of bound argument entities of g ([func.def]) of types BoundArgs..., direct-non-list-initialized with std::forward<Args>(args)..., respectively, and
(1.6)
call_args is an argument pack used in a function call expression ([expr.call]) of g.

Mandates: is_constructible_v<FD, F> && is_move_constructible_v<FD> && (is_constructible_v<BoundArgs, Args> && ...) && (is_move_constructible_v<BoundArgs> && ...) is true.

Preconditions: FD meets the Cpp17MoveConstructible requirements.

For each

T_{i}

in BoundArgs, if

T_{i}

is an object type,

T_{i}

meets the Cpp17MoveConstructible requirements.

Returns: A perfect forwarding call wrapper g with call pattern invoke(fd, bound_args..., call_args...).

Throws: Any exception thrown by the initialization of the state entities of g ([func.def]).

20.14.15 Function object binders [func.bind]

20.14.15.1 General [func.bind.general]

Subclause [func.bind] describes a uniform mechanism for binding arguments of callable objects.

20.14.15.2 Class template is_bind_expression [func.bind.isbind]

namespace std { template<class T> struct is_bind_expression; // see below }

The class template is_bind_expression can be used to detect function objects generated by bind.

The function template bind uses is_bind_expression to detect subexpressions.

Specializations of the is_bind_expression template shall meet the Cpp17UnaryTypeTrait requirements ([meta.rqmts]).

The implementation provides a definition that has a base characteristic of true_type if T is a type returned from bind, otherwise it has a base characteristic of false_type.

A program may specialize this template for a program-defined type T to have a base characteristic of true_type to indicate that T should be treated as a subexpression in a bind call.

20.14.15.3 Class template is_placeholder [func.bind.isplace]

namespace std { template<class T> struct is_placeholder; // see below }

The class template is_placeholder can be used to detect the standard placeholders _1, _2, and so on.

The function template bind uses is_placeholder to detect placeholders.

Specializations of the is_placeholder template shall meet the Cpp17UnaryTypeTrait requirements ([meta.rqmts]).

The implementation provides a definition that has the base characteristic of integral_constant<int, J> if T is the type of std::placeholders::_J, otherwise it has a base characteristic of integral_constant<int, 0>.

A program may specialize this template for a program-defined type T to have a base characteristic of integral_constant<int, N> with N > 0 to indicate that T should be treated as a placeholder type.

20.14.15.4 Function template bind [func.bind.bind]

In the text that follows:

(1.1)
g is a value of the result of a bind invocation,
(1.2)
FD is the type decay_t<F>,
(1.3)
fd is an lvalue that is a target object of g ([func.def]) of type FD direct-non-list-initialized with std::forward<F>(f),
(1.4)
$T_{i}$ is the $i^{th}$ type in the template parameter pack BoundArgs,
(1.5)
${TD}_{i}$ is the type decay_t< $T_{i}$ >,
(1.6)
$t_{i}$ is the $i^{th}$ argument in the function parameter pack bound_args,
(1.7)
${td}_{i}$ is a bound argument entity of g ([func.def]) of type ${TD}_{i}$ direct-non-list-initialized with std::forward< $T_{i}$ >( $t_{i}$ ),
(1.8)
$U_{j}$ is the $j^{th}$ deduced type of the UnBoundArgs&&... parameter of the argument forwarding call wrapper, and
(1.9)
$u_{j}$ is the $j^{th}$ argument associated with $U_{j}$ .

🔗

template<class F, class... BoundArgs>
  constexpr unspecified bind(F&& f, BoundArgs&&... bound_args);
template<class R, class F, class... BoundArgs>
  constexpr unspecified bind(F&& f, BoundArgs&&... bound_args);

Mandates: is_constructible_v<FD, F> is true.

For each

T_{i}

in BoundArgs, is_constructible_v<

{TD}_{i}

T_{i}

> is true.

Preconditions: FD and each

{TD}_{i}

meet the Cpp17MoveConstructible and Cpp17Destructible requirements.

INVOKE(fd,

w_{1}

w_{2}

, …,

w_{N}

) ([func.require]) is a valid expression for some values

w_{1}

w_{2}

, …,

w_{N}

, where N has the value sizeof...(bound_args).

Returns: An argument forwarding call wrapper g ([func.require]).

A program that attempts to invoke a volatile-qualified g is ill-formed.

When g is not volatile-qualified, invocation of g(

u_{1}

u_{2}

, …,

u_{M}

) is expression-equivalent ([defns.expression-equivalent]) to INVOKE(static_cast<

V_{fd}

v_{fd}

), static_cast<

V_{1}

v_{1}

), static_cast<

V_{2}

v_{2}

), …, static_cast<

V_{N}

v_{N}

)) for the first overload, and INVOKE<R>(static_cast<

V_{fd}

v_{fd}

), static_cast<

V_{1}

v_{1}

), static_cast<

V_{2}

v_{2}

), …, static_cast<

V_{N}

v_{N}

)) for the second overload, where the values and types of the target argument

v_{fd}

and of the bound arguments

v_{1}

v_{2}

, …,

v_{N}

are determined as specified below.

Throws: Any exception thrown by the initialization of the state entities of g.

[Note 1:

If all of FD and

{TD}_{i}

meet the requirements of Cpp17CopyConstructible, then the return type meets the requirements of Cpp17CopyConstructible.

— end note]

The values of the bound arguments

v_{1}

v_{2}

, …,

v_{N}

and their corresponding types

V_{1}

V_{2}

, …,

V_{N}

depend on the types

{TD}_{i}

derived from the call to bind and the cv-qualifiers cv of the call wrapper g as follows:

(7.1)
if ${TD}_{i}$ is reference_wrapper<T>, the argument is ${td}_{i}$ .get() and its type $V_{i}$ is T&;
(7.2)
if the value of is_bind_expression_v< ${TD}_{i}$ > is true, the argument is static_cast<cv ${TD}_{i}$ &>( ${td}_{i}$ )(std::forward< $U_{j}$ >( $u_{j}$ )...) and its type $V_{i}$ is invoke_result_t<cv ${TD}_{i}$ &, $U_{j}$ ...>&&;
(7.3)
if the value j of is_placeholder_v< ${TD}_{i}$ > is not zero, the argument is std::forward< $U_{j}$ >( $u_{j}$ ) and its type $V_{i}$ is $U_{j}$ &&;
(7.4)
otherwise, the value is ${td}_{i}$ and its type $V_{i}$ is cv ${TD}_{i}$ &.

The value of the target argument

v_{fd}

is fd and its corresponding type

V_{fd}

is cv FD&.

20.14.15.5 Placeholders [func.bind.place]

namespace std::placeholders { // M is the implementation-defined number of placeholders see below _1; see below _2; . . . see below _M; }

All placeholder types meet the Cpp17DefaultConstructible and Cpp17CopyConstructible requirements, and their default constructors and copy/move constructors are constexpr functions that do not throw exceptions.

It is implementation-defined whether placeholder types meet the Cpp17CopyAssignable requirements, but if so, their copy assignment operators are constexpr functions that do not throw exceptions.

Placeholders should be defined as: inline constexpr unspecified _1{};

If they are not, they are declared as: extern unspecified _1;

20.14.16 Function template mem_fn [func.memfn]

🔗

template<class R, class T> constexpr unspecified mem_fn(R T::* pm) noexcept;

Returns: A simple call wrapper ([func.def]) fn with call pattern invoke(pmd, call_args...), where pmd is the target object of fn of type R T::* direct-non-list-initialized with pm, and call_args is an argument pack used in a function call expression ([expr.call]) of pm.

20.14.17 Polymorphic function wrappers [func.wrap]

20.14.17.1 General [func.wrap.general]

Subclause [func.wrap] describes a polymorphic wrapper class that encapsulates arbitrary callable objects.

20.14.17.2 Class bad_function_call [func.wrap.badcall]

An exception of type bad_function_call is thrown by function::operator() ([func.wrap.func.inv]) when the function wrapper object has no target.

namespace std { class bad_function_call : public exception { public: // see [exception] for the specification of the special member functions const char* what() const noexcept override; }; }

🔗

const char* what() const noexcept override;

Returns: An implementation-defined ntbs.

20.14.17.3 Class template function [func.wrap.func]

20.14.17.3.1 General [func.wrap.func.general]

namespace std { template<class> class function; // not defined template<class R, class... ArgTypes> class function<R(ArgTypes...)> { public: using result_type = R; // [func.wrap.func.con], construct/copy/destroy function() noexcept; function(nullptr_t) noexcept; function(const function&); function(function&&) noexcept; template<class F> function(F); function& operator=(const function&); function& operator=(function&&); function& operator=(nullptr_t) noexcept; template<class F> function& operator=(F&&); template<class F> function& operator=(reference_wrapper<F>) noexcept; ~function(); // [func.wrap.func.mod], function modifiers void swap(function&) noexcept; // [func.wrap.func.cap], function capacity explicit operator bool() const noexcept; // [func.wrap.func.inv], function invocation R operator()(ArgTypes...) const; // [func.wrap.func.targ], function target access const type_info& target_type() const noexcept; template<class T> T* target() noexcept; template<class T> const T* target() const noexcept; }; template<class R, class... ArgTypes> function(R(*)(ArgTypes...)) -> function<R(ArgTypes...)>; template<class F> function(F) -> function<see below>; // [func.wrap.func.nullptr], null pointer comparison operator functions template<class R, class... ArgTypes> bool operator==(const function<R(ArgTypes...)>&, nullptr_t) noexcept; // [func.wrap.func.alg], specialized algorithms template<class R, class... ArgTypes> void swap(function<R(ArgTypes...)>&, function<R(ArgTypes...)>&) noexcept; }

The function class template provides polymorphic wrappers that generalize the notion of a function pointer.

Wrappers can store, copy, and call arbitrary callable objects, given a call signature, allowing functions to be first-class objects.

A callable type F is Lvalue-Callable for argument types ArgTypes and return type R if the expression INVOKE<R>(declval<F&>(), declval<ArgTypes>()...), considered as an unevaluated operand, is well-formed ([func.require]).

The function class template is a call wrapper whose call signature is R(ArgTypes...).

[Note 1:

The types deduced by the deduction guides for function might change in future revisions of C++.

— end note]

20.14.17.3.2 Constructors and destructor [func.wrap.func.con]

🔗

function() noexcept;

Postconditions: !*this.

🔗

function(nullptr_t) noexcept;

Postconditions: !*this.

🔗

function(const function& f);

Postconditions: !*this if !f; otherwise, *this targets a copy of f.target().

Throws: Nothing if f's target is a specialization of reference_wrapper or a function pointer.

Otherwise, may throw bad_alloc or any exception thrown by the copy constructor of the stored callable object.

Recommended practice: Implementations should avoid the use of dynamically allocated memory for small callable objects, for example, where f's target is an object holding only a pointer or reference to an object and a member function pointer.

🔗

function(function&& f) noexcept;

Postconditions: If !f, *this has no target; otherwise, the target of *this is equivalent to the target of f before the construction, and f is in a valid state with an unspecified value.

🔗

template<class F> function(F f);

Constraints: F is Lvalue-Callable ([func.wrap.func]) for argument types ArgTypes... and return type R.

Preconditions: F meets the Cpp17CopyConstructible requirements.

Postconditions: !*this if any of the following hold:

(10.1)
f is a null function pointer value.
(10.2)
f is a null member pointer value.
(10.3)
F is an instance of the function class template, and !f.

Otherwise, *this targets a copy of f initialized with std::move(f).

Throws: Nothing if f is a specialization of reference_wrapper or a function pointer.

Otherwise, may throw bad_alloc or any exception thrown by F's copy or move constructor.

Recommended practice: Implementations should avoid the use of dynamically allocated memory for small callable objects, for example, where f is an object holding only a pointer or reference to an object and a member function pointer.

🔗

template<class F> function(F) -> function<see below>;

Constraints: &F::operator() is well-formed when treated as an unevaluated operand and decltype(&F::operator()) is of the form R(G::*)(A...) cv &

_{o p t}

noexcept

_{o p t}

for a class type G.

Remarks: The deduced type is function<R(A...)>.

[Example 1: void f() { int i{5}; function g = [&](double) { return i; }; // deduces function<int(double)> } — end example]

🔗

function& operator=(const function& f);

Effects: As if by function(f).swap(*this);

Returns: *this.

🔗

function& operator=(function&& f);

Effects: Replaces the target of *this with the target of f.

Returns: *this.

🔗

function& operator=(nullptr_t) noexcept;

Effects: If *this != nullptr, destroys the target of this.

Postconditions: !(*this).

Returns: *this.

🔗

template<class F> function& operator=(F&& f);

Constraints: decay_t<F> is Lvalue-Callable ([func.wrap.func]) for argument types ArgTypes... and return type R.

Effects: As if by: function(std::forward<F>(f)).swap(*this);

Returns: *this.

🔗

template<class F> function& operator=(reference_wrapper<F> f) noexcept;

Effects: As if by: function(f).swap(*this);

Returns: *this.

🔗

~function();

Effects: If *this != nullptr, destroys the target of this.

20.14.17.3.3 Modifiers [func.wrap.func.mod]

🔗

void swap(function& other) noexcept;

Effects: Interchanges the targets of *this and other.

20.14.17.3.4 Capacity [func.wrap.func.cap]

🔗

explicit operator bool() const noexcept;

Returns: true if *this has a target, otherwise false.

20.14.17.3.5 Invocation [func.wrap.func.inv]

🔗

R operator()(ArgTypes... args) const;

Returns: INVOKE<R>(f, std::forward<ArgTypes>(args)...) ([func.require]), where f is the target object of *this.

Throws: bad_function_call if !*this; otherwise, any exception thrown by the wrapped callable object.

20.14.17.3.6 Target access [func.wrap.func.targ]

🔗

const type_info& target_type() const noexcept;

Returns: If *this has a target of type T, typeid(T); otherwise, typeid(void).

🔗

template<class T>       T* target() noexcept;
template<class T> const T* target() const noexcept;

Returns: If target_type() == typeid(T) a pointer to the stored function target; otherwise a null pointer.

20.14.17.3.7 Null pointer comparison operator functions [func.wrap.func.nullptr]

🔗

template<class R, class... ArgTypes>
  bool operator==(const function<R(ArgTypes...)>& f, nullptr_t) noexcept;

Returns: !f.

20.14.17.3.8 Specialized algorithms [func.wrap.func.alg]

🔗

template<class R, class... ArgTypes>
  void swap(function<R(ArgTypes...)>& f1, function<R(ArgTypes...)>& f2) noexcept;

Effects: As if by: f1.swap(f2);

20.14.18 Searchers [func.search]

20.14.18.1 General [func.search.general]

Subclause [func.search] provides function object types ([function.objects]) for operations that search for a sequence [pat_first, pat_last) in another sequence [first, last) that is provided to the object's function call operator.

The first sequence (the pattern to be searched for) is provided to the object's constructor, and the second (the sequence to be searched) is provided to the function call operator.

Each specialization of a class template specified in [func.search] shall meet the Cpp17CopyConstructible and Cpp17CopyAssignable requirements.

Template parameters named

(2.1)
ForwardIterator,
(2.2)
ForwardIterator1,
(2.3)
ForwardIterator2,
(2.4)
RandomAccessIterator,
(2.5)
RandomAccessIterator1,
(2.6)
RandomAccessIterator2, and
(2.7)
BinaryPredicate

of templates specified in [func.search] shall meet the same requirements and semantics as specified in [algorithms.general].

Template parameters named Hash shall meet the Cpp17Hash requirements (Table 34).

The Boyer-Moore searcher implements the Boyer-Moore search algorithm.

The Boyer-Moore-Horspool searcher implements the Boyer-Moore-Horspool search algorithm.

In general, the Boyer-Moore searcher will use more memory and give better runtime performance than Boyer-Moore-Horspool.

20.14.18.2 Class template default_searcher [func.search.default]

template<class ForwardIterator1, class BinaryPredicate = equal_to<>> class default_searcher { public: constexpr default_searcher(ForwardIterator1 pat_first, ForwardIterator1 pat_last, BinaryPredicate pred = BinaryPredicate()); template<class ForwardIterator2> constexpr pair<ForwardIterator2, ForwardIterator2> operator()(ForwardIterator2 first, ForwardIterator2 last) const; private: ForwardIterator1 pat_first_; // exposition only ForwardIterator1 pat_last_; // exposition only BinaryPredicate pred_; // exposition only };

🔗

constexpr default_searcher(ForwardIterator pat_first, ForwardIterator pat_last,
                           BinaryPredicate pred = BinaryPredicate());

Effects: Constructs a default_searcher object, initializing pat_first_ with pat_first, pat_last_ with pat_last, and pred_ with pred.

Throws: Any exception thrown by the copy constructor of BinaryPredicate or ForwardIterator1.

🔗

template<class ForwardIterator2>
  constexpr pair<ForwardIterator2, ForwardIterator2>
    operator()(ForwardIterator2 first, ForwardIterator2 last) const;

Effects: Returns a pair of iterators i and j such that

(3.1)
i == search(first, last, pat_first_, pat_last_, pred_), and
(3.2)
if i == last, then j == last, otherwise j == next(i, distance(pat_first_, pat_last_)).

20.14.18.3 Class template boyer_moore_searcher [func.search.bm]

template<class RandomAccessIterator1, class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>, class BinaryPredicate = equal_to<>> class boyer_moore_searcher { public: boyer_moore_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last, Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate()); template<class RandomAccessIterator2> pair<RandomAccessIterator2, RandomAccessIterator2> operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const; private: RandomAccessIterator1 pat_first_; // exposition only RandomAccessIterator1 pat_last_; // exposition only Hash hash_; // exposition only BinaryPredicate pred_; // exposition only };

🔗

boyer_moore_searcher(RandomAccessIterator1 pat_first,
                     RandomAccessIterator1 pat_last,
                     Hash hf = Hash(),
                     BinaryPredicate pred = BinaryPredicate());

Preconditions: The value type of RandomAccessIterator1 meets the Cpp17DefaultConstructible requirements, the Cpp17CopyConstructible requirements, and the Cpp17CopyAssignable requirements.

Let V be iterator_traits<RandomAccessIterator1>::value_type.

For any two values A and B of type V, if pred(A, B) == true, then hf(A) == hf(B) is true.

Effects: Initializes pat_first_ with pat_first, pat_last_ with pat_last, hash_ with hf, and pred_ with pred.

Throws: Any exception thrown by the copy constructor of RandomAccessIterator1, or by the default constructor, copy constructor, or the copy assignment operator of the value type of RandomAccessIterator1, or the copy constructor or operator() of BinaryPredicate or Hash.

May throw bad_alloc if additional memory needed for internal data structures cannot be allocated.

🔗

template<class RandomAccessIterator2>
  pair<RandomAccessIterator2, RandomAccessIterator2>
    operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;

Mandates: RandomAccessIterator1 and RandomAccessIterator2 have the same value type.

Effects: Finds a subsequence of equal values in a sequence.

Returns: A pair of iterators i and j such that

(7.1)
i is the first iterator in the range [first, last - (pat_last_ - pat_first_)) such that for every non-negative integer n less than pat_last_ - pat_first_ the following condition holds: pred(*(i + n), *(pat_first_ + n)) != false, and
(7.2)
j == next(i, distance(pat_first_, pat_last_)).

Returns make_pair(first, first) if [pat_first_, pat_last_) is empty, otherwise returns make_pair(last, last) if no such iterator is found.

Complexity: At most (last - first) * (pat_last_ - pat_first_) applications of the predicate.

20.14.18.4 Class template boyer_moore_horspool_searcher [func.search.bmh]

template<class RandomAccessIterator1, class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>, class BinaryPredicate = equal_to<>> class boyer_moore_horspool_searcher { public: boyer_moore_horspool_searcher(RandomAccessIterator1 pat_first, RandomAccessIterator1 pat_last, Hash hf = Hash(), BinaryPredicate pred = BinaryPredicate()); template<class RandomAccessIterator2> pair<RandomAccessIterator2, RandomAccessIterator2> operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const; private: RandomAccessIterator1 pat_first_; // exposition only RandomAccessIterator1 pat_last_; // exposition only Hash hash_; // exposition only BinaryPredicate pred_; // exposition only };

🔗

boyer_moore_horspool_searcher(RandomAccessIterator1 pat_first,
                              RandomAccessIterator1 pat_last,
                              Hash hf = Hash(),
                              BinaryPredicate pred = BinaryPredicate());

Preconditions: The value type of RandomAccessIterator1 meets the Cpp17DefaultConstructible, Cpp17CopyConstructible, and Cpp17CopyAssignable requirements.

Let V be iterator_traits<RandomAccessIterator1>::value_type.

For any two values A and B of type V, if pred(A, B) == true, then hf(A) == hf(B) is true.

Effects: Initializes pat_first_ with pat_first, pat_last_ with pat_last, hash_ with hf, and pred_ with pred.

Throws: Any exception thrown by the copy constructor of RandomAccessIterator1, or by the default constructor, copy constructor, or the copy assignment operator of the value type of RandomAccessIterator1 or the copy constructor or operator() of BinaryPredicate or Hash.

May throw bad_alloc if additional memory needed for internal data structures cannot be allocated.

🔗

template<class RandomAccessIterator2>
  pair<RandomAccessIterator2, RandomAccessIterator2>
    operator()(RandomAccessIterator2 first, RandomAccessIterator2 last) const;

Mandates: RandomAccessIterator1 and RandomAccessIterator2 have the same value type.

Effects: Finds a subsequence of equal values in a sequence.

Returns: A pair of iterators i and j such that

(7.1)
i is the first iterator i in the range [first, last - (pat_last_ - pat_first_)) such that for every non-negative integer n less than pat_last_ - pat_first_ the following condition holds: pred(*(i + n), *(pat_first_ + n)) != false, and
(7.2)
j == next(i, distance(pat_first_, pat_last_)).

Returns make_pair(first, first) if [pat_first_, pat_last_) is empty, otherwise returns make_pair(last, last) if no such iterator is found.

Complexity: At most (last - first) * (pat_last_ - pat_first_) applications of the predicate.

20.14.19 Class template hash [unord.hash]

The unordered associative containers defined in [unord] use specializations of the class template hash ([functional.syn]) as the default hash function.

Each specialization of hash is either enabled or disabled, as described below.

[Note 1:

Enabled specializations meet the Cpp17Hash requirements, and disabled specializations do not.

— end note]

Each header that declares the template hash provides enabled specializations of hash for nullptr_t and all cv-unqualified arithmetic, enumeration, and pointer types.

For any type Key for which neither the library nor the user provides an explicit or partial specialization of the class template hash, hash<Key> is disabled.

If the library provides an explicit or partial specialization of hash<Key>, that specialization is enabled except as noted otherwise, and its member functions are noexcept except as noted otherwise.

If H is a disabled specialization of hash, these values are false: is_default_constructible_v<H>, is_copy_constructible_v<H>, is_move_constructible_v<H>, is_copy_assignable_v<H>, and is_move_assignable_v<H>.

Disabled specializations of hash are not function object types .

[Note 2:

This means that the specialization of hash exists, but any attempts to use it as a Cpp17Hash will be ill-formed.

— end note]

An enabled specialization hash<Key> will:

(5.1)
meet the Cpp17Hash requirements (Table 34), with Key as the function call argument type, the Cpp17DefaultConstructible requirements (Table 27), the Cpp17CopyAssignable requirements (Table 31),
(5.2)
be swappable ([swappable.requirements]) for lvalues,
(5.3)
meet the requirement that if k1 == k2 is true, h(k1) == h(k2) is also true, where h is an object of type hash<Key> and k1 and k2 are objects of type Key;
(5.4)
meet the requirement that the expression h(k), where h is an object of type hash<Key> and k is an object of type Key, shall not throw an exception unless hash<Key> is a program-defined specialization that depends on at least one program-defined type.

20 General utilities library [utilities]

20.14 Function objects [function.objects]

20.14.1 General [function.objects.general]

20.14.2 Header <functional> synopsis [functional.syn]

20.14.3 Definitions [func.def]

20.14.4 Requirements [func.require]

20.14.5 Function template invoke [func.invoke]

20.14.6 Class template reference_­wrapper [refwrap]

20.14.6.1 General [refwrap.general]

20.14.6.2 Constructors and destructor [refwrap.const]

20.14.6.3 Assignment [refwrap.assign]

20.14.6.4 Access [refwrap.access]

20.14.6.5 Invocation [refwrap.invoke]

20.14.6.6 Helper functions [refwrap.helpers]

20.14.7 Arithmetic operations [arithmetic.operations]

20.14.7.1 General [arithmetic.operations.general]

20.14.7.2 Class template plus [arithmetic.operations.plus]

20.14.7.3 Class template minus [arithmetic.operations.minus]

20.14.7.4 Class template multiplies [arithmetic.operations.multiplies]

20.14.7.5 Class template divides [arithmetic.operations.divides]

20.14.7.6 Class template modulus [arithmetic.operations.modulus]

20.14.7.7 Class template negate [arithmetic.operations.negate]

20.14.8 Comparisons [comparisons]

20.14.8.1 General [comparisons.general]

20.14.8.2 Class template equal_­to [comparisons.equal.to]

20.14.8.3 Class template not_­equal_­to [comparisons.not.equal.to]

20.14.8.4 Class template greater [comparisons.greater]

20.14.8.5 Class template less [comparisons.less]

20.14.8.6 Class template greater_­equal [comparisons.greater.equal]

20.14.8.7 Class template less_­equal [comparisons.less.equal]

20.14.8.8 Class compare_­three_­way [comparisons.three.way]

20.14.9 Concept-constrained comparisons [range.cmp]

20.14.10 Logical operations [logical.operations]

20.14.10.1 General [logical.operations.general]

20.14.10.2 Class template logical_­and [logical.operations.and]

20.14.10.3 Class template logical_­or [logical.operations.or]

20.14.10.4 Class template logical_­not [logical.operations.not]

20.14.11 Bitwise operations [bitwise.operations]

20.14.11.1 General [bitwise.operations.general]

20.14.11.2 Class template bit_­and [bitwise.operations.and]

20.14.11.3 Class template bit_­or [bitwise.operations.or]

20.14.11.4 Class template bit_­xor [bitwise.operations.xor]

20.14.11.5 Class template bit_­not [bitwise.operations.not]

20.14.12 Class identity [func.identity]

20.14.13 Function template not_­fn [func.not.fn]

20.14.14 Function template bind_­front [func.bind.front]

20.14.15 Function object binders [func.bind]

20.14.15.1 General [func.bind.general]

20.14.15.2 Class template is_­bind_­expression [func.bind.isbind]

20.14.15.3 Class template is_­placeholder [func.bind.isplace]

20.14.15.4 Function template bind [func.bind.bind]

20.14.15.5 Placeholders [func.bind.place]

20.14.16 Function template mem_­fn [func.memfn]

20.14.17 Polymorphic function wrappers [func.wrap]

20.14.17.1 General [func.wrap.general]

20.14.17.2 Class bad_­function_­call [func.wrap.badcall]

20.14.17.3 Class template function [func.wrap.func]

20.14.17.3.1 General [func.wrap.func.general]

20.14.17.3.2 Constructors and destructor [func.wrap.func.con]

20.14.17.3.3 Modifiers [func.wrap.func.mod]

20.14.17.3.4 Capacity [func.wrap.func.cap]

20.14.17.3.5 Invocation [func.wrap.func.inv]

20.14.17.3.6 Target access [func.wrap.func.targ]

20.14.17.3.7 Null pointer comparison operator functions [func.wrap.func.nullptr]

20.14.17.3.8 Specialized algorithms [func.wrap.func.alg]

20.14.18 Searchers [func.search]

20.14.18.1 General [func.search.general]

20.14.18.2 Class template default_­searcher [func.search.default]

20.14.18.3 Class template boyer_­moore_­searcher [func.search.bm]

20.14.18.4 Class template boyer_­moore_­horspool_­searcher [func.search.bmh]

20.14.19 Class template hash [unord.hash]

20.14.6 Class template reference_wrapper [refwrap]

20.14.8.2 Class template equal_to [comparisons.equal.to]

20.14.8.3 Class template not_equal_to [comparisons.not.equal.to]

20.14.8.6 Class template greater_equal [comparisons.greater.equal]

20.14.8.7 Class template less_equal [comparisons.less.equal]

20.14.8.8 Class compare_three_way [comparisons.three.way]

20.14.10.2 Class template logical_and [logical.operations.and]

20.14.10.3 Class template logical_or [logical.operations.or]

20.14.10.4 Class template logical_not [logical.operations.not]

20.14.11.2 Class template bit_and [bitwise.operations.and]

20.14.11.3 Class template bit_or [bitwise.operations.or]

20.14.11.4 Class template bit_xor [bitwise.operations.xor]

20.14.11.5 Class template bit_not [bitwise.operations.not]

20.14.13 Function template not_fn [func.not.fn]

20.14.14 Function template bind_front [func.bind.front]

20.14.15.2 Class template is_bind_expression [func.bind.isbind]

20.14.15.3 Class template is_placeholder [func.bind.isplace]

20.14.16 Function template mem_fn [func.memfn]

20.14.17.2 Class bad_function_call [func.wrap.badcall]

20.14.18.2 Class template default_searcher [func.search.default]

20.14.18.3 Class template boyer_moore_searcher [func.search.bm]

20.14.18.4 Class template boyer_moore_horspool_searcher [func.search.bmh]