[tab:rand.req.eng] (original) (raw)

Table 125 — Random number engine requirements [tab:rand.req.eng]

🔗Expression	Return type	Pre/post-condition	Complexity
🔗E()	Creates an engine with the same initial state as all other default-constructed engines of type E.
🔗E(x)	Creates an engine that compares equal to x.
🔗E(s)	Creates an engine with initial state determined by s.
🔗E(q)241	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	Postconditions: e == E().	same as E()
🔗e.seed(s)	void	Postconditions: e == E(s).	same as E(s)
🔗e.seed(q)	void	Postconditions: e == E(q).	same as E(q)
🔗e()	T	Advances e's state e toe e) and returnsGA(e).	per [rand.req.urng]
🔗e.discard(z)242	void	Advances e's state e to 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 and as the infinite sequences of values that would be generated by repeated future calls to x() and y(), respectively, returns true if ; else returns false.
🔗x != y	bool	!(x == y).