This page is a snapshot from the LWG issues list, see the Library Active Issues List for more information and the meaning of New status.

4111. LWG 270 and ranges version of binary search algorithms

Section: 26.8.4 [alg.binary.search], 26.8.1 [alg.sorting.general] Status: New Submitter: Jiang An Opened: 2024-06-18 Last modified: 2024-06-24

Priority: 3

View all other issues in [alg.binary.search].

View all issues with New status.

Discussion:

LWG 270⁽ⁱ⁾ relaxed the requirements for comp of binary search algorithms (26.8.4 [alg.binary.search]). However, the relaxation doesn't seem automatically applied to ranges versions, because ranges versions of these algorithms constrain the Comp types with indirect_strict_weak_order.

Perhaps we should additionally say some semantic requirements of indirect_strict_weak_order aren't imposed for these algorithms or change the constraints.

[St. Louis 2024-06-24; set priority to P3]

Proposed resolution: