Namespaces
Variants

std::indirect_strict_weak_order

From cppreference.com
Revision as of 06:40, 2 July 2020 by Cjdb (talk | contribs) (Created page with "{{cpp/title|indirect_strict_weak_order}} {{cpp/iterator/navbar}} {{dcl begin}} {{dcl header | iterator}} {{dcl | since=c++20 | 1= template<class F, class I1, class I2 = I1> co...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
 
 
Iterator library
Iterator concepts
Iterator primitives
Algorithm concepts and utilities
Indirect callable concepts
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 I1, class I2 = I1>
concept indirect_strict_weak_order =
  std::indirectly_readable<I1> &&
  std::indirectly_readable<I2> &&
  std::copy_constructible<F> &&
  std::strict_weak_order<F&, std::iter_value_t<I1>&, std::iter_value_t<I2>&> &&
  std::strict_weak_order<F&, std::iter_value_t<I1>&, std::iter_reference_t<I2>> &&
  std::strict_weak_order<F&, std::iter_reference_t<I1>, std::iter_value_t<I2>&> &&
  std::strict_weak_order<F&, std::iter_reference_t<I1>, std::iter_reference_t<I2>> &&
  std::strict_weak_order<F&, std::iter_common_reference_t<I1>, std::iter_common_reference_t<I2>>;
(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.

Equality preservation

Expressions declared in requires expressions of the standard library concepts are required to be equality-preserving (except where stated otherwise).