![]() |
CYCLUS
|
Binomial distribution requries an integer number of trials and a probability of success for each trial.
Sampling returns the number of successes. When trials is one, this is equivalent to a Bernoulli dist
Definition at line 251 of file random_number_generator.h.
#include <random_number_generator.h>
Public Types | |
typedef boost::shared_ptr< BinomialIntDist > | Ptr |
![]() | |
typedef boost::shared_ptr< IntDistribution > | Ptr |
Public Member Functions | |
BinomialIntDist (int trials, double p_success) | |
virtual int | p () |
virtual int | sample () |
virtual int | trials () |
typedef boost::shared_ptr<BinomialIntDist> cyclus::BinomialIntDist::Ptr |
Definition at line 257 of file random_number_generator.h.
|
inline |
Definition at line 259 of file random_number_generator.h.
|
inlinevirtual |
Definition at line 269 of file random_number_generator.h.
|
inlinevirtual |
Implements cyclus::IntDistribution.
Definition at line 267 of file random_number_generator.h.
|
inlinevirtual |
Definition at line 268 of file random_number_generator.h.