# | Line 1 | Line 1 | |
---|---|---|
1 | < | /* |
1 | > | /* |
2 | * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. | |
3 | * | |
4 | * The University of Notre Dame grants you ("Licensee") a | |
# | Line 43 | Line 43 | |
43 | #define MATH_PARALLELRANDNUMGEN_HPP | |
44 | ||
45 | #include <vector> | |
46 | – | #include "MersenneTwister.hpp" |
47 | – | #include "utils/simError.h" |
46 | ||
47 | + | #include "utils/simError.h" |
48 | + | #include "math/RandNumGen.hpp" |
49 | #ifdef IS_MPI | |
50 | ||
51 | namespace oopse { | |
52 | ||
53 | ||
54 | ||
55 | < | /** |
56 | < | * @class ParallelRandNumGen a parallel random number generator |
57 | < | * @note use MTRand if you want a non-parallel random number generator in MPI enviroment |
58 | < | */ |
59 | < | class ParallelRandNumGen{ |
60 | < | public: |
61 | < | typedef unsigned long uint32; |
55 | > | /** |
56 | > | * @class ParallelRandNumGen a parallel random number generator |
57 | > | * @note use SeqRandNumGen if you want a non-parallel random number generator. |
58 | > | */ |
59 | > | class ParallelRandNumGen : public RandNumGen{ |
60 | > | public: |
61 | > | typedef unsigned long uint32; |
62 | ||
63 | < | ParallelRandNumGen( const uint32& oneSeed); |
64 | < | ParallelRandNumGen(); |
63 | > | ParallelRandNumGen( const uint32& oneSeed); |
64 | ||
65 | < | ~ParallelRandNumGen() { |
67 | < | delete mtRand_; |
68 | < | } |
69 | < | |
70 | < | /** Returns a real number in [0,1] */ |
71 | < | double rand() { |
72 | < | return mtRand_->rand(); |
73 | < | } |
74 | < | |
75 | < | /** Returns a real number in [0, n] */ |
76 | < | double rand( const double& n ) { |
77 | < | return mtRand_->rand(n); |
78 | < | } |
79 | < | |
80 | < | /** Returns a real number in [0, 1) */ |
81 | < | double randExc() { |
82 | < | return mtRand_->randExc(); |
83 | < | } |
84 | < | |
85 | < | /** Returns a real number in [0, n) */ |
86 | < | double randExc( const double& n ) { |
87 | < | return mtRand_->randExc(n); |
88 | < | } |
89 | < | |
90 | < | /** Returns a real number in (0, 1) */ |
91 | < | double randDblExc() { |
92 | < | return mtRand_->randDblExc(); |
93 | < | } |
94 | < | |
95 | < | /** Returns a real number in (0, n) */ |
96 | < | double randDblExc( const double& n ) { |
97 | < | return mtRand_->randDblExc(n); |
98 | < | } |
99 | < | |
100 | < | /** Returns aninteger in [0,2^32-1] */ |
101 | < | uint32 randInt() { |
102 | < | return mtRand_->randInt(); |
103 | < | } |
104 | < | |
105 | < | /** Returns aninteger in [0, n] for n < 2^32 */ |
106 | < | uint32 randInt( const uint32& n ) { |
107 | < | return mtRand_->randInt(n); |
108 | < | } |
65 | > | ParallelRandNumGen(); |
66 | ||
67 | < | /** Returns a 53-bitreal number in [0,1) (capacity of IEEE double precision) */ |
111 | < | double rand53() { |
112 | < | return mtRand_->rand53(); |
113 | < | } |
67 | > | virtual void seed( const uint32 oneSeed ); |
68 | ||
69 | < | /** Access to nonuniform random number distributions */ |
116 | < | double randNorm( const double& mean, const double& variance) { |
117 | < | return mtRand_->randNorm(mean, variance); |
118 | < | } |
119 | < | |
120 | < | // Re-seeding functions with same behavior as initializers |
121 | < | void seed( const uint32 oneSeed ); |
122 | < | |
123 | < | void seed(); |
69 | > | virtual void seed(); |
70 | ||
71 | < | private: |
71 | > | private: |
72 | > | |
73 | > | ParallelRandNumGen(const ParallelRandNumGen&); |
74 | > | ParallelRandNumGen& operator =(const ParallelRandNumGen&); |
75 | ||
76 | < | MTRand* mtRand_; |
76 | > | static int nCreatedRNG_; /**< number of created random number of generator*/ |
77 | > | int myRank_; /**@todo Fixed Me */ |
78 | > | }; |
79 | ||
129 | – | static int nCreatedRNG_; /**< number of created random number of generator*/ |
130 | – | |
131 | – | }; |
132 | – | |
80 | } | |
81 | #endif | |
82 |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |