cpp/iterator/indirect strict weak order

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

Semantic requirements
,, and model  only if all concepts it subsumes are modeled.