Namespaces
Variants
Views
Actions

std::indirectly_comparable

From cppreference.com
< cpp‎ | iterator
 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
Common algorithm requirements
indirectly_comparable
(C++20)
(C++20)
(C++20)
(C++20)
Utilities
Iterator adaptors
Stream iterators
Iterator customization points
Iterator operations
(C++11)
(C++11)
Range access
(C++11)(C++14)
(C++11)(C++14)
(C++17)(C++20)
(C++14)(C++14)
(C++14)(C++14)
(C++17)
(C++17)
 
Defined in header <iterator>
template< class I1, class I2, class R,

          class P1 = std::identity, class P2 = std::identity >
concept indirectly_comparable =

    std::indirect_binary_predicate<R, std::projected<I1, P1>, std::projected<I2, P2>>;
(since C++20)

The concept indirectly_comparable specifies the fundamental algorithm requirement for comparing values across two independent ranges.

[edit] Semantic requirements

indirectly_comparable is modeled only if all concepts it subsumes are modeled.

[edit] See also

specifies that a callable type, when invoked with the result of dereferencing two indirectly_readable types, satisfies predicate
(concept) [edit]