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

2154. What exactly does compile-time complexity imply?

Section: 26.6.3.3 [rand.req.urng] Status: Resolved Submitter: John Salmon Opened: 2012-04-26 Last modified: 2020-10-06

Priority: 4

View all other issues in [rand.req.urng].

View all issues with Resolved status.

Discussion:

The expressions G::min() and G::max() in Table 116 in 26.6.3.3 [rand.req.urng] are specified as having "compile-time" complexity.

It is not clear what, exactly, this requirement implies. If a URNG has a method:

static int min();

then is the method required to have a constexpr qualifier? I believe the standard would benefit from clarification of this point.

[2018-12-08; Tim Song comments]

This issue was resolved by P0898R3 and the subsequent editorial rewrite of this subclause.

[2020-10-06; Reflector discussions]

Resolved by P0898R3 voted in Rapperswil.

Rationale:

Resolved by P0898R3.

Proposed resolution: