A random number engine (commonly shortened to engine) e of type E is a uniform random number generator that additionally meets the requirements (e.g., for seeding and for input/output) specified in this section.
At any given time, e has a state ei for some integer i ≥ 0. Upon construction, e has an initial state e0. An engine's state may be established via a constructor, a seed function, assignment, or a suitable operator>>.
E's specification shall define:
the size of E's state in multiples of the size of result_type, given as an integral constant expression;
the transition algorithm TA by which e's state ei is advanced to its successor state ei+1; and
the generation algorithm GA by which an engine's state is mapped to a value of type result_type.
A class E that satisfies the requirements of a uniform random number generator ([rand.req.urng]) also satisfies the requirements of a random number engine if the expressions shown in Table [tab:RandomEngine] are valid and have the indicated semantics, and if E also satisfies all other requirements of this section [rand.req.eng]. In that Table and throughout this section:
T is the type named by E's associated result_type;
e is a value of E, v is an lvalue of E, x and y are (possibly const) values of E;
s is a value of T;
q is an lvalue satisfying the requirements of a seed sequence ([rand.req.seedseq]);
z is a value of type unsigned long long;
os is an lvalue of the type of some class template specialization basic_ostream<charT, traits>; and
is is an lvalue of the type of some class template specialization basic_istream<charT, traits>;
|E()||Creates an engine with the same initial state as all other default-constructed engines of type E.||Ο(size of state)|
|E(x)||Creates an engine that compares equal to x.||Ο(size of state)|
|E(s)||Creates an engine with initial state determined by s.||Ο(size of state)|
|E(q)274||Creates an engine with an initial state that depends on a sequence produced by one call to q.generate.||same as complexity of q.generate called on a sequence whose length is size of state|
|e.seed()||void||post: e == E().||same as E()|
|e.seed(s)||void||post: e == E(s).||same as E(s)|
|e.seed(q)||void||post: e == E(q).||same as E(q)|
|e()||T||Advances e's state ei to ei+1 = TA(ei) and returns GA(ei).||per Table [tab:UniformRandomNumberGenerator]|
|e.discard(z) 275||void||Advances e's state ei to ei+z by any means equivalent to z consecutive calls e().||no worse than the complexity of z consecutive calls e()|
|x == y||bool||This operator is an equivalence relation. With Sx and Sy as the infinite sequences of values that would be generated by repeated future calls to x() and y(), respectively, returns true if Sx = Sy ; else returns false.||Ο(size of state)|
|x != y||bool||!(x == y).||Ο(size of state)|
|os << x||reference to the type of os||With os.fmtflags set to ios_base::dec|ios_base::left and the fill character set to the space character, writes to os the textual representation of x's current state. In the output, adjacent numbers are separated by one or more space characters. post: The os.fmtflags and fill character are unchanged.||Ο(size of state)|
|is >> v||reference to the type of is||With is.fmtflags set to ios_base::dec, sets v's state as determined by reading its textual representation from is. If bad input is encountered, ensures that v's state is unchanged by the operation and calls is.setstate(ios::failbit) (which may throw ios::failure [[iostate.flags]]). If a textual representation written via os << x was subsequently read via is >> v, then x == v provided that there have been no intervening invocations of x or of v. pre: is provides a textual representation that was previously written using an output stream whose imbued locale was the same as that of is, and whose type's template specialization arguments charT and traits were respectively the same as those of is. post: The is.fmtflags are unchanged.||Ο(size of state)|
E shall meet the requirements of CopyConstructible (Table [copyconstructible]) and CopyAssignable (Table [copyassignable]) types. These operations shall each be of complexity no worse than Ο(size of state).
This constructor (as well as the subsequent corresponding seed() function) may be particularly useful to applications requiring a large number of independent random sequences.
This operation is common in user code, and can often be implemented in an engine-specific manner so as to provide significant performance improvements over an equivalent naive loop that makes z consecutive calls e().