A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../numeric/random/negative_binomial_distribution.html below:

std::negative_binomial_distribution - cppreference.com

std::negative_binomial_distribution

template< class IntType = int >
class negative_binomial_distribution;

(since C++11)

Produces random non-negative integer values i, distributed according to discrete probability function:

\(P(i|k, p) = \binom{k + i - 1}{i} \cdot p^k \cdot (1 - p)^i\)P(i|k,p) =⎛
⎜
⎝
k + i − 1
i
⎞
⎟
⎠
· pk
· (1 − p)i

The value represents the number of failures in a series of independent yes/no trials (each succeeds with probability p), before exactly k successes occur.

std::negative_binomial_distribution satisfies RandomNumberDistribution.

[edit] Template parameters IntType - The result type generated by the generator. The effect is undefined if this is not one of short, int, long, long long, unsigned short, unsigned int, unsigned long, or unsigned long long. [edit] Member types Member type Definition result_type (C++11) IntType param_type (C++11) the type of the parameter set, see RandomNumberDistribution. [edit] Member functions constructs new distribution
(public member function) [edit] resets the internal state of the distribution
(public member function) [edit] Generation generates the next random number in the distribution
(public member function) [edit] Characteristics returns the distribution parameters
(public member function) [edit] gets or sets the distribution parameter object
(public member function) [edit] returns the minimum potentially generated value
(public member function) [edit] returns the maximum potentially generated value
(public member function) [edit] [edit] Non-member functions [edit] Example
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
 
int main()
{
    std::random_device rd;
    std::mt19937 gen(rd());
    // Pat goes door-to-door selling cookies
    // At each house, there's a 75% chance that she sells one box
    // how many times will she be turned away before selling 5 boxes?
    std::negative_binomial_distribution<> d(5, 0.75);
 
    std::map<int, int> hist;
    for (int n = 0; n != 10000; ++n)
        ++hist[d(gen)];
 
    for (auto [x, y] : hist)
        std::cout << std::hex << x << ' ' << std::string(y / 100, '*') << '\n';
}

Possible output:

0 ***********************
1 *****************************
2 **********************
3 *************
4 ******
5 ***
6 *
7
8
9
a
b
[edit] External links

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4