A seed sequence is an object that consumes a sequence of integer-valued data and produces a requested number of unsigned integer values i, 0 ≤ i < 232 , based on the consumed data. [ Note: Such an object provides a mechanism to avoid replication of streams of random variates. This can be useful, for example, in applications requiring large numbers of random number engines. — end note ]
A class S satisfies the requirements of a seed sequence if the expressions shown in Table [tab:SeedSequence] are valid and have the indicated semantics, and if S also satisfies all other requirements of this section [rand.req.seedseq]. In that Table and throughout this section:
T is the type named by S's associated result_type;
q is a value of S and r is a possibly const value of S;
ib and ie are input iterators with an unsigned integer value_type of at least 32 bits;
rb and re are mutable random access iterators with an unsigned integer value_type of at least 32 bits;
ob is an output iterator; and
il is a value of initializer_list<T>.
Table
115— Seed sequence requirements
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