tmp/tmpnjf7dlz7/{from.md → to.md}
RENAMED
|
@@ -30,11 +30,11 @@ overload in namespace `std`:
|
|
| 30 |
requirements [[input.iterators]].
|
| 31 |
- `SampleIterator` meets the *Cpp17OutputIterator*
|
| 32 |
requirements [[output.iterators]].
|
| 33 |
- `SampleIterator` meets the *Cpp17RandomAccessIterator*
|
| 34 |
requirements [[random.access.iterators]] unless `PopulationIterator`
|
| 35 |
-
|
| 36 |
- `remove_reference_t<UniformRandomBitGenerator>` meets the requirements
|
| 37 |
of a uniform random bit generator type [[rand.req.urng]].
|
| 38 |
|
| 39 |
*Effects:* Copies min(`last - first`, `n`) elements (the *sample*) from
|
| 40 |
\[`first`, `last`) (the *population*) to `out` such that each possible
|
|
@@ -48,12 +48,12 @@ sampling* and *reservoir sampling*. — *end note*]
|
|
| 48 |
*Complexity:* 𝑂(`last - first`).
|
| 49 |
|
| 50 |
*Remarks:*
|
| 51 |
|
| 52 |
- For the overload in namespace `std`, stable if and only if
|
| 53 |
-
`PopulationIterator`
|
| 54 |
-
|
| 55 |
-
`
|
| 56 |
- To the extent that the implementation of this function makes use of
|
| 57 |
random numbers, the object `g` serves as the implementation’s source
|
| 58 |
of randomness.
|
| 59 |
|
|
|
|
| 30 |
requirements [[input.iterators]].
|
| 31 |
- `SampleIterator` meets the *Cpp17OutputIterator*
|
| 32 |
requirements [[output.iterators]].
|
| 33 |
- `SampleIterator` meets the *Cpp17RandomAccessIterator*
|
| 34 |
requirements [[random.access.iterators]] unless `PopulationIterator`
|
| 35 |
+
models `forward_iterator` [[iterator.concept.forward]].
|
| 36 |
- `remove_reference_t<UniformRandomBitGenerator>` meets the requirements
|
| 37 |
of a uniform random bit generator type [[rand.req.urng]].
|
| 38 |
|
| 39 |
*Effects:* Copies min(`last - first`, `n`) elements (the *sample*) from
|
| 40 |
\[`first`, `last`) (the *population*) to `out` such that each possible
|
|
|
|
| 48 |
*Complexity:* 𝑂(`last - first`).
|
| 49 |
|
| 50 |
*Remarks:*
|
| 51 |
|
| 52 |
- For the overload in namespace `std`, stable if and only if
|
| 53 |
+
`PopulationIterator` models `forward_iterator`. For the first overload
|
| 54 |
+
in namespace `ranges`, stable if and only if `I` models
|
| 55 |
+
`forward_iterator`.
|
| 56 |
- To the extent that the implementation of this function makes use of
|
| 57 |
random numbers, the object `g` serves as the implementation’s source
|
| 58 |
of randomness.
|
| 59 |
|