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

2832. §[fpos.operations] strange requirement for P(i)

Section: 29.5.4.2 [fpos.operations] Status: Tentatively Resolved Submitter: Jens Maurer Opened: 2016-11-24 Last modified: 2019-03-22

Priority: 3

View other active issues in [fpos.operations].

View all other issues in [fpos.operations].

View all issues with Tentatively Resolved status.

Discussion:

This is from editorial issue #1031.

The first row in Table 112 "Position type requirements" talks about the expression P(i) and then has an assertion p == P(i). However, there are no constraints on p other than being of type P, so (on the face of it) this seems to require that operator== on P always returns true, which is non-sensical.

[2017-01-27 Telecon]

Priority 3

[2019-03-17; Daniel comments]

With the acceptance of P0759R1 at the Rapperswil 2018 meeting this issue should be closed as Resolved.

Rationale:

Resolved by P0759R1.

Proposed resolution: