tmp/tmpcac9f1hr/{from.md → to.md}
RENAMED
|
@@ -9,10 +9,15 @@ additional sequence V of k values also of the type delivered by `e`. The
|
|
| 9 |
size of the state is the size of e’s state plus k + 1.
|
| 10 |
|
| 11 |
The transition algorithm permutes the values produced by e. The state
|
| 12 |
transition is performed as follows:
|
| 13 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 14 |
The generation algorithm yields the last value of `Y` produced while
|
| 15 |
advancing `e`’s state as described above.
|
| 16 |
|
| 17 |
``` cpp
|
| 18 |
template<class Engine, size_t k>
|
|
@@ -53,10 +58,10 @@ template<class Engine, size_t k>
|
|
| 53 |
The following relation shall hold: `0 < k`.
|
| 54 |
|
| 55 |
The textual representation consists of the textual representation of
|
| 56 |
`e`, followed by the `k` values of V, followed by the value of Y.
|
| 57 |
|
| 58 |
-
In addition to its behavior pursuant to
|
| 59 |
each constructor that is not a copy constructor initializes
|
| 60 |
`V[0]`, …, `V[k-1]` and Y, in that order, with values returned by
|
| 61 |
successive invocations of `e()`.
|
| 62 |
|
|
|
|
| 9 |
size of the state is the size of e’s state plus k + 1.
|
| 10 |
|
| 11 |
The transition algorithm permutes the values produced by e. The state
|
| 12 |
transition is performed as follows:
|
| 13 |
|
| 14 |
+
- Calculate an integer $j = \left\lfloor \frac{k \cdot (Y - e_{\min})}
|
| 15 |
+
{e_{\max} - e_{\min} +1}
|
| 16 |
+
\right\rfloor$ .
|
| 17 |
+
- Set Y to Vⱼ and then set Vⱼ to `e()`.
|
| 18 |
+
|
| 19 |
The generation algorithm yields the last value of `Y` produced while
|
| 20 |
advancing `e`’s state as described above.
|
| 21 |
|
| 22 |
``` cpp
|
| 23 |
template<class Engine, size_t k>
|
|
|
|
| 58 |
The following relation shall hold: `0 < k`.
|
| 59 |
|
| 60 |
The textual representation consists of the textual representation of
|
| 61 |
`e`, followed by the `k` values of V, followed by the value of Y.
|
| 62 |
|
| 63 |
+
In addition to its behavior pursuant to subclause [[rand.req.adapt]],
|
| 64 |
each constructor that is not a copy constructor initializes
|
| 65 |
`V[0]`, …, `V[k-1]` and Y, in that order, with values returned by
|
| 66 |
successive invocations of `e()`.
|
| 67 |
|