[rand.util.seedseq] - C++17 → C++20

Files changed (1) hide show

tmp/tmpfrsgh9sw/{from.md → to.md} +58 -14

tmp/tmpfrsgh9sw/{from.md → to.md} RENAMED Viewed

@@ -33,35 +33,35 @@ private:
 ``` cpp
 seed_seq();
 ```
-*Effects:* Constructs a `seed_seq` object as if by default-constructing
-its member `v`.
 *Throws:* Nothing.
 ``` cpp
 template<class T>
  seed_seq(initializer_list<T> il);
 ```
-*Requires:* `T` shall be an integer type.
 *Effects:* Same as `seed_seq(il.begin(), il.end())`.
 ``` cpp
 template<class InputIterator>
   seed_seq(InputIterator begin, InputIterator end);
 ```
-*Requires:* `InputIterator` shall satisfy the requirements of an input
-iterator (Table  [[tab:iterator.input.requirements]]) type. Moreover,
-`iterator_traits<InputIterator>::value_type` shall denote an integer
 type.
-*Effects:* Constructs a `seed_seq` object by the following algorithm:
 ``` cpp
 for (InputIterator s = begin; s != end; ++s)
  v.push_back((*s) mod  2³²);
 ```
@@ -69,21 +69,63 @@ for( InputIterator s = begin; s != end; ++s)
 ``` cpp
 template<class RandomAccessIterator>
   void generate(RandomAccessIterator begin, RandomAccessIterator end);
 ```
-*Requires:* `RandomAccessIterator` shall meet the requirements of a
-mutable random access iterator ([[random.access.iterators]]). Moreover,
-`iterator_traits<RandomAccessIterator>::value_type` shall denote an
 unsigned integer type capable of accommodating 32-bit quantities.
 *Effects:* Does nothing if `begin == end`. Otherwise, with
 s = `v.size()` and n = `end` - `begin`, fills the supplied range
 [`begin`,`end`) according to the following algorithm in which each
 operation is to be carried out modulo 2³², each indexing operator
 applied to `begin` is to be taken modulo n, and T(x) is defined as
-$x \, \xor \, (x \, \rightshift \, 27)$:
 *Throws:* What and when `RandomAccessIterator` operations of `begin` and
 `end` throw.
 ``` cpp
@@ -98,13 +140,15 @@ to `param()`.
 ``` cpp
 template<class OutputIterator>
   void param(OutputIterator dest) const;
 ```
-*Requires:* `OutputIterator` shall satisfy the requirements of an output
-iterator ([[output.iterators]]). Moreover, the expression `*dest = rt`
-shall be valid for a value `rt` of type `result_type`.
 *Effects:* Copies the sequence of prepared 32-bit units to the given
 destination, as if by executing the following statement:
 ``` cpp

 ``` cpp
 seed_seq();
 ```
+*Ensures:* `v.empty()` is `true`.
 *Throws:* Nothing.
 ``` cpp
 template<class T>
  seed_seq(initializer_list<T> il);
 ```
+*Mandates:* `T` is an integer type.
 *Effects:* Same as `seed_seq(il.begin(), il.end())`.
 ``` cpp
 template<class InputIterator>
   seed_seq(InputIterator begin, InputIterator end);
 ```
+*Mandates:* `iterator_traits<InputIterator>::value_type` is an integer
 type.
+*Preconditions:* `InputIterator` meets the *Cpp17InputIterator*
+requirements [[input.iterators]].
+*Effects:* Initializes `v` by the following algorithm:
 ``` cpp
 for (InputIterator s = begin; s != end; ++s)
  v.push_back((*s) mod  2³²);
 ```
 ``` cpp
 template<class RandomAccessIterator>
   void generate(RandomAccessIterator begin, RandomAccessIterator end);
 ```
+*Mandates:* `iterator_traits<RandomAccessIterator>::value_type` is an
 unsigned integer type capable of accommodating 32-bit quantities.
+*Preconditions:* `RandomAccessIterator` meets the
+*Cpp17RandomAccessIterator* requirements [[random.access.iterators]] and
+the requirements of a mutable iterator.
 *Effects:* Does nothing if `begin == end`. Otherwise, with
 s = `v.size()` and n = `end` - `begin`, fills the supplied range
 [`begin`,`end`) according to the following algorithm in which each
 operation is to be carried out modulo 2³², each indexing operator
 applied to `begin` is to be taken modulo n, and T(x) is defined as
+$x \xor (x \rightshift 27)$:
+- By way of initialization, set each element of the range to the value
+  `0x8b8b8b8b`. Additionally, for use in subsequent steps, let
+  p = (n - t) / 2 and let q = p + t, where $$%
+       t = (n \ge 623) \mbox{ ? } 11 \mbox{ : } (n \ge 68) \mbox{ ? } 7 \mbox{ : } (n \ge 39) \mbox{ ? } 5 \mbox{ : } (n \ge 7) \mbox{ ? } 3 \mbox{ : } (n - 1)/2;$$
+- With m as the larger of s + 1 and n, transform the elements of the
+  range: iteratively for k = 0, …, m - 1, calculate values
+  $$\begin{aligned}
+       r_1 & = &
+         1664525 \cdot T(    \texttt{begin[}k\texttt{]}
+                        \xor \texttt{begin[}k+p\texttt{]}
+                        \xor \texttt{begin[}k-1 \texttt{]}
+                        )
+       \\
+       r_2 & = & r_1 + \left\{
+         \begin{array}{cl}
+           s                                  & \mbox{,  } k = 0
+           \\
+           k \bmod n + \texttt{v[}k-1\texttt{]} & \mbox{,  } 0 < k \le s
+           \\
+           k \bmod n                          & \mbox{,  } s < k
+         \end{array}
+       \right.
+  \end{aligned}$$ and, in order, increment `begin[`k+p`]` by r₁,
+  increment `begin[`k+q`]` by r₂, and set `begin[`k`]` to r₂.
+- Transform the elements of the range again, beginning where the
+  previous step ended: iteratively for k = m, …, m + n - 1, calculate
+  values $$\begin{aligned}
+       r_3 & = &
+         1566083941 \cdot T( \texttt{begin[}k  \texttt{]}
+                           + \texttt{begin[}k+p\texttt{]}
+                           + \texttt{begin[}k-1\texttt{]}
+                           )
+       \\
+       r_4 & = & r_3 - (k \bmod n)
+  \end{aligned}$$ and, in order, update `begin[`k+p`]` by xoring it with
+  r₃, update `begin[`k+q`]` by xoring it with r₄, and set `begin[`k`]`
+  to r₄.
 *Throws:* What and when `RandomAccessIterator` operations of `begin` and
 `end` throw.
 ``` cpp
 ``` cpp
 template<class OutputIterator>
   void param(OutputIterator dest) const;
 ```
+*Mandates:* Values of type `result_type` are
+writable [[iterator.requirements.general]] to `dest`.
+*Preconditions:* `OutputIterator` meets the *Cpp17OutputIterator*
+requirements [[output.iterators]].
 *Effects:* Copies the sequence of prepared 32-bit units to the given
 destination, as if by executing the following statement:
 ``` cpp

Diff to HTML by rtfpessoa