29 Numerics library [numerics]

29.6 Random number generation [rand]

29.6.7 Utilities [rand.util]

29.6.7.1 Class seed_­seq [rand.util.seedseq]

class seed_seq {
public:
  // types
  using result_type = uint_least32_t;

  // constructors
  seed_seq();
  template<class T>
    seed_seq(initializer_list<T> il);
  template<class InputIterator>
    seed_seq(InputIterator begin, InputIterator end);

  // generating functions
  template<class RandomAccessIterator>
    void generate(RandomAccessIterator begin, RandomAccessIterator end);

  // property functions
  size_t size() const noexcept;
  template<class OutputIterator>
    void param(OutputIterator dest) const;

  // no copy functions
  seed_seq(const seed_seq& ) = delete;
  void operator=(const seed_seq& ) = delete;

private:
  vector<result_type> v;   // exposition only
};

seed_seq();

1
#

Effects: Constructs a seed_­seq object as if by default-constructing its member v.

2
#

Throws: Nothing.

template<class T> seed_seq(initializer_list<T> il);

3
#

Requires: T shall be an integer type.

4
#

Effects: Same as seed_­seq(il.begin(), il.end()).

template<class InputIterator> seed_seq(InputIterator begin, InputIterator end);

5
#

Requires: InputIterator shall satisfy the requirements of an input iterator type. Moreover, iterator_­traits<InputIterator>​::​value_­type shall denote an integer type.

6
#

Effects: Constructs a seed_­seq object by the following algorithm: 

for( InputIterator s = begin; s != end; ++s)
 v.push_back((*s)mod232);

template<class RandomAccessIterator> void generate(RandomAccessIterator begin, RandomAccessIterator end);

7
#

Requires: RandomAccessIterator shall meet the requirements of a mutable random access iterator. Moreover, iterator_­traits<RandomAccessIterator>​::​value_­type shall denote an unsigned integer type capable of accommodating 32-bit quantities.

8
#

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 232, each indexing operator applied to begin is to be taken modulo n, and T(x) is defined as xxor(xrshift27):

  1. a)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≥623) ? 11 : (n≥68) ? 7 : (n≥39) ? 5 : (n≥7) ? 3 : (n−1)/2;

  2. b)With m as the larger of s+1 and n, transform the elements of the range: iteratively for k=0,…,m−1, calculate values

    r1=1664525⋅T(begin[k]xorbegin[k+p]xorbegin[k−1])r2=r1+⎧⎪⎨⎪⎩s, k=0kmodn+v[k−1], 0<k≤skmodn, s<k

    and, in order, increment begin[k+p] by r1, increment begin[k+q] by r2, and set begin[k] to r2.

  3. c)Transform the elements of the range again, beginning where the previous step ended: iteratively for k=m,…,m+n−1, calculate values

    r3=1566083941⋅T(begin[k]+begin[k+p]+begin[k−1])r4=r3−(kmodn)

    and, in order, update begin[k+p] by xoring it with r3, update begin[k+q] by xoring it with r4, and set begin[k] to r4.

9
#

Throws: What and when RandomAccessIterator operations of begin and end throw.

size_t size() const noexcept;

10
#

Returns: The number of 32-bit units that would be returned by a call to param().

11
#

Complexity: Constant time.

template<class OutputIterator> void param(OutputIterator dest) const;

12
#

Requires: OutputIterator shall satisfy the requirements of an output iterator. Moreover, the expression *dest = rt shall be valid for a value rt of type result_­type.

13
#

Effects: Copies the sequence of prepared 32-bit units to the given destination, as if by executing the following statement: 

copy(v.begin(), v.end(), dest);
14
#

Throws: What and when OutputIterator operations of dest throw.