Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/iterator/indirect unary predicate"

From cppreference.com
< cpp‎ | iterator
m (fmt)
(Applied P2997R1 (Removing the common reference requirement from the indirectly invocable concepts).)
Line 3: Line 3:
 
{{dcl begin}}
 
{{dcl begin}}
 
{{dcl header|iterator}}
 
{{dcl header|iterator}}
{{dcl|since=c++20|1=
+
{{dcl rev begin}}
 +
{{dcl|since=c++20|until=c++26|1=
 
template< class F, class I >
 
template< class F, class I >
 
concept indirect_unary_predicate =
 
concept indirect_unary_predicate =
Line 12: Line 13:
 
     std::predicate<F&, std::iter_common_reference_t<I>>;
 
     std::predicate<F&, std::iter_common_reference_t<I>>;
 
}}
 
}}
 +
{{dcl|since=c++26|1=
 +
template< class F, class I >
 +
concept indirect_unary_predicate =
 +
    std::indirectly_readable<I> &&
 +
    std::copy_constructible<F> &&
 +
    std::predicate<F&, std::iter_value_t<I>&> &&
 +
    std::predicate<F&, std::iter_reference_t<I>>;
 +
}}
 +
{{dcl rev end}}
 
{{dcl end}}
 
{{dcl end}}
  
 
The concept {{tt|indirect_unary_predicate}} specifies requirements for algorithms that call unary predicates as their arguments. The key difference between this concept and {{lc|std::predicate}} is that it is applied to the type that {{tt|I}} references, rather than {{tt|I}} itself.
 
The concept {{tt|indirect_unary_predicate}} specifies requirements for algorithms that call unary predicates as their arguments. The key difference between this concept and {{lc|std::predicate}} is that it is applied to the type that {{tt|I}} references, rather than {{tt|I}} itself.
 
===Semantic requirements===
 
{{tt|F}} and {{tt|I}} model {{tt|indirect_unary_predicate}} only if all concepts it subsumes are modeled.
 
  
 
{{langlinks|es|ja|zh}}
 
{{langlinks|es|ja|zh}}

Revision as of 22:42, 23 July 2024

 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
indirect_unary_predicate
(C++20)
Common algorithm requirements
(C++20)
(C++20)
(C++20)
Utilities
(C++20)
Iterator adaptors
Range access
(C++11)(C++14)
(C++14)(C++14)  
(C++11)(C++14)
(C++14)(C++14)  
(C++17)(C++20)
(C++17)
(C++17)
 
Defined in header <iterator>
template< class F, class I >

concept indirect_unary_predicate =
    std::indirectly_readable<I> &&
    std::copy_constructible<F> &&
    std::predicate<F&, std::iter_value_t<I>&> &&
    std::predicate<F&, std::iter_reference_t<I>> &&

    std::predicate<F&, std::iter_common_reference_t<I>>;
(since C++20)
(until C++26)
template< class F, class I >

concept indirect_unary_predicate =
    std::indirectly_readable<I> &&
    std::copy_constructible<F> &&
    std::predicate<F&, std::iter_value_t<I>&> &&

    std::predicate<F&, std::iter_reference_t<I>>;
(since C++26)

The concept indirect_unary_predicate specifies requirements for algorithms that call unary predicates as their arguments. The key difference between this concept and std::predicate is that it is applied to the type that I references, rather than I itself.