Namespaces
Variants
Views
Actions

std::indirect_strict_weak_order

From cppreference.com
< cpp‎ | iterator
Revision as of 22:11, 30 September 2023 by Andreas Krug (Talk | contribs)

 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
indirect_strict_weak_order
(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>
(since C++20)

The concept indirect_strict_weak_order specifies requirements for algorithms that call strict weak orders as their arguments. The key difference between this concept and std::strict_weak_order is that it is applied to the types that I1 and I2 references, rather than I1 and I2 themselves.

Semantic requirements

F, I1, and I2 model indirect_strict_weak_order only if all concepts it subsumes are modeled.