tmp/tmpiiu9fdsu/{from.md → to.md}
RENAMED
|
@@ -1,10 +1,7 @@
|
|
| 1 |
#### Class `seed_seq` <a id="rand.util.seedseq">[[rand.util.seedseq]]</a>
|
| 2 |
|
| 3 |
-
No function described in this section [[rand.util.seedseq]] throws an
|
| 4 |
-
exception.
|
| 5 |
-
|
| 6 |
``` cpp
|
| 7 |
class seed_seq
|
| 8 |
{
|
| 9 |
public:
|
| 10 |
// types
|
|
@@ -40,10 +37,12 @@ seed_seq();
|
|
| 40 |
```
|
| 41 |
|
| 42 |
*Effects:* Constructs a `seed_seq` object as if by default-constructing
|
| 43 |
its member `v`.
|
| 44 |
|
|
|
|
|
|
|
| 45 |
``` cpp
|
| 46 |
template<class T>
|
| 47 |
seed_seq(initializer_list<T> il);
|
| 48 |
```
|
| 49 |
|
|
@@ -84,18 +83,23 @@ s = `v.size()` and n = `end` - `begin`, fills the supplied range
|
|
| 84 |
[`begin`,`end`) according to the following algorithm in which each
|
| 85 |
operation is to be carried out modulo 2³², each indexing operator
|
| 86 |
applied to `begin` is to be taken modulo n, and T(x) is defined as
|
| 87 |
$x \, \xor \, (x \, \rightshift \, 27)$:
|
| 88 |
|
|
|
|
|
|
|
|
|
|
| 89 |
``` cpp
|
| 90 |
size_t size() const;
|
| 91 |
```
|
| 92 |
|
| 93 |
*Returns:* The number of 32-bit units that would be returned by a call
|
| 94 |
to `param()`.
|
| 95 |
|
| 96 |
-
*
|
|
|
|
|
|
|
| 97 |
|
| 98 |
``` cpp
|
| 99 |
template<class OutputIterator>
|
| 100 |
void param(OutputIterator dest) const;
|
| 101 |
```
|
|
@@ -110,5 +114,7 @@ destination, as if by executing the following statement:
|
|
| 110 |
|
| 111 |
``` cpp
|
| 112 |
copy(v.begin(), v.end(), dest);
|
| 113 |
```
|
| 114 |
|
|
|
|
|
|
|
|
|
| 1 |
#### Class `seed_seq` <a id="rand.util.seedseq">[[rand.util.seedseq]]</a>
|
| 2 |
|
|
|
|
|
|
|
|
|
|
| 3 |
``` cpp
|
| 4 |
class seed_seq
|
| 5 |
{
|
| 6 |
public:
|
| 7 |
// types
|
|
|
|
| 37 |
```
|
| 38 |
|
| 39 |
*Effects:* Constructs a `seed_seq` object as if by default-constructing
|
| 40 |
its member `v`.
|
| 41 |
|
| 42 |
+
*Throws:* Nothing.
|
| 43 |
+
|
| 44 |
``` cpp
|
| 45 |
template<class T>
|
| 46 |
seed_seq(initializer_list<T> il);
|
| 47 |
```
|
| 48 |
|
|
|
|
| 83 |
[`begin`,`end`) according to the following algorithm in which each
|
| 84 |
operation is to be carried out modulo 2³², each indexing operator
|
| 85 |
applied to `begin` is to be taken modulo n, and T(x) is defined as
|
| 86 |
$x \, \xor \, (x \, \rightshift \, 27)$:
|
| 87 |
|
| 88 |
+
*Throws:* What and when `RandomAccessIterator` operations of `begin` and
|
| 89 |
+
`end` throw.
|
| 90 |
+
|
| 91 |
``` cpp
|
| 92 |
size_t size() const;
|
| 93 |
```
|
| 94 |
|
| 95 |
*Returns:* The number of 32-bit units that would be returned by a call
|
| 96 |
to `param()`.
|
| 97 |
|
| 98 |
+
*Throws:* Nothing.
|
| 99 |
+
|
| 100 |
+
*Complexity:* Constant time.
|
| 101 |
|
| 102 |
``` cpp
|
| 103 |
template<class OutputIterator>
|
| 104 |
void param(OutputIterator dest) const;
|
| 105 |
```
|
|
|
|
| 114 |
|
| 115 |
``` cpp
|
| 116 |
copy(v.begin(), v.end(), dest);
|
| 117 |
```
|
| 118 |
|
| 119 |
+
*Throws:* What and when `OutputIterator` operations of `dest` throw.
|
| 120 |
+
|