Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/numeric/random/random device"

From cppreference.com
< cpp‎ | numeric‎ | random
m (Example: emphasized the spread of "uniform distribution")
m (Undo revision 124835 by Space Mission (talk) misleading)
Line 37: Line 37:
 
  | p=true
 
  | p=true
 
  | code=
 
  | code=
#include <algorithm>
 
 
#include <iostream>
 
#include <iostream>
 
#include <string>
 
#include <string>
Line 49: Line 48:
 
     std::uniform_int_distribution<int> dist(0, 9);
 
     std::uniform_int_distribution<int> dist(0, 9);
 
     for (int n = 0; n < 20000; ++n) {
 
     for (int n = 0; n < 20000; ++n) {
         ++hist[dist(rd)]; // note: demo only: the performance of many
+
         ++hist[dist(rd)]; // note: demo only: the performance of many  
 
                           // implementations of random_device degrades sharply
 
                           // implementations of random_device degrades sharply
 
                           // once the entropy pool is exhausted. For practical use
 
                           // once the entropy pool is exhausted. For practical use
                           // random_device is generally only used to seed
+
                           // random_device is generally only used to seed  
 
                           // a PRNG such as mt19937
 
                           // a PRNG such as mt19937
 
     }
 
     }
    auto mm {std::ranges::minmax_element(hist, {}, &std::pair<const int, int>::second)};
 
    const auto [min, max] = std::pair{mm.min->second, mm.max->second};
 
    std::cout << "Spread: min = " << min << ", max = " << max << '\n';
 
 
 
     for (auto p : hist) {
 
     for (auto p : hist) {
         std::cout << p.first << " : " << std::string(1+(p.second - min)/4, '*') << '\n';
+
         std::cout << p.first << " : " << std::string(p.second/100, '*') << '\n';
 
     }
 
     }
 
}
 
}
 
  | output=
 
  | output=
Spread: min = 1918, max = 2081
+
0 : ********************
0 : ******
+
1 : *******************
1 : ************************
+
2 : ********************
2 : *
+
3 : ********************
3 : ****************************
+
4 : ********************
4 : *****************
+
5 : *******************
5 : *****************************************
+
6 : ********************
6 : *************
+
7 : ********************
7 : *********************************
+
8 : *******************
8 : ********************
+
9 : ********************
9 : *****************************
+
 
}}
 
}}
  
 
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}
 
{{langlinks|de|es|fr|it|ja|pt|ru|zh}}

Revision as of 20:49, 7 December 2020

 
 
 
 
 
Defined in header <random>
class random_device;
(since C++11)

std::random_device is a uniformly-distributed integer random number generator that produces non-deterministic random numbers.

std::random_device may be implemented in terms of an implementation-defined pseudo-random number engine if a non-deterministic source (e.g. a hardware device) is not available to the implementation. In this case each std::random_device object may generate the same number sequence.

Contents

Member types

Member type Definition
result_type unsigned int

Member functions

Construction
constructs the engine
(public member function) [edit]
operator=
(deleted)
the assignment operator is deleted
(public member function)
Generation
advances the engine's state and returns the generated value
(public member function) [edit]
Characteristics
(C++11)
obtains the entropy estimate for the non-deterministic random number generator
(public member function) [edit]
[static]
gets the smallest possible value in the output range
(public static member function) [edit]
[static]
gets the largest possible value in the output range
(public static member function) [edit]

Notes

A notable implementation where std::random_device is deterministic is old versions of MinGW (bug 338, fixed since GCC 9.2). The latest MinGW Versions can be downloaded from GCC with the MCF thread model.

Example

#include <iostream>
#include <string>
#include <map>
#include <random>
 
int main()
{
    std::random_device rd;
    std::map<int, int> hist;
    std::uniform_int_distribution<int> dist(0, 9);
    for (int n = 0; n < 20000; ++n) {
        ++hist[dist(rd)]; // note: demo only: the performance of many 
                          // implementations of random_device degrades sharply
                          // once the entropy pool is exhausted. For practical use
                          // random_device is generally only used to seed 
                          // a PRNG such as mt19937
    }
    for (auto p : hist) {
        std::cout << p.first << " : " << std::string(p.second/100, '*') << '\n';
    }
}

Possible output:

0 : ********************
1 : *******************
2 : ********************
3 : ********************
4 : ********************
5 : *******************
6 : ********************
7 : ********************
8 : *******************
9 : ********************