Created on 2019-07-15.00:00:00, last changed 2019-08-02.17:24:33.
This wording is relative to N4820.
Modify [mem.poly.allocator.mem] as indicated:
Table 78: Cpp17RandomAccessIteratorrequirements (in addition to Cpp17BidirectionalIterator) [tab:randomaccessiterator] Expression Return type Operational semantics Assertion/note
[…] a < b contextually convertible to bool b - a > 0 < is a total ordering relation
[ 2019-07-29; Casey comments and provides wording ]
Change the "Operational Semantics" column of the "a < b" row of [tab:randomaccessiterator] to " b - a > 0It then follows that a < b is required to be well-defined over the domain for which b - a is required to be well-defined, which is the set of pairs (x, y) such that there exists a value n of type difference_type such that x + n == b.
For forward iterators we have very clear wording regarding the restricted domain of operator== in [forward.iterators] p2:
The domain of == for forward iterators is that of iterators over the same underlying sequence. However, value-initialized iterators may be compared and shall compare equal to other value-initialized iterators of the same type. [Note: Value-initialized iterators behave as if they refer past the end of the same empty sequence. — end note]
But for the relational operators of random access iterators specified in [random.access.iterators], Table [tab:randomaccessiterator], no such domain constraints are clearly defined, except that we can infer that they are similarly constrained as the difference of the compared iterators by means of the operational semantics of operator<.
|2019-08-02 17:24:33||admin||set||messages: + msg10528|
|2019-08-02 17:24:33||admin||set||messages: + msg10527|