Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.cppreference.com/w/cpp/language/../numeric/../named_req/UniformRandomBitGenerator.html below:

C++ named requirements: UniformRandomBitGenerator (since C++11)

A uniform random bit generator is a function object returning unsigned integer values such that each value in the range of possible results has (ideally) equal probability.

Uniform random bit generators are not intended to be used as random number generators: they are used as the source of random bits (generated in bulk, for efficiency). Any uniform random bit generator may be plugged into any random number distribution in order to obtain a random number (formally, a random variate).

The type G satisfies UniformRandomBitGenerator if

Given g, a value of type G, all following conditions are satisfied:

• G::result_type is valid, and denotes an unsigned integer type.
• The following expressions must be valid and have their specified effects:

• Yields the smallest value that G's operator() may return. 
• The result value is strictly less than G::max().
• The expression must be a constant expression.

• Yields the largest value that G's operator() may return.
• The result value is strictly greater than G::min().
• The expression must be a constant expression.

• Returns a value in the closed interval [G::min(), G::max()].
• Has amortized constant complexity.

All RandomNumberEngines satisfy this requirement.

The following standard library facilities expect a UniformRandomBitGenerator type.

The following standard library facilities satisfy UniformRandomBitGenerator without additionally satisfying RandomNumberEngine:

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

1. ↑ The time complexity requirement for these expressions were “compile-time” before C++20. The wording is ambiguous, as “compile-time time complexity” can be interpreted as both “can be evaluated in compile-time” and “the time complexity can be determined in compile-time”.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4