| Geant4 Cross Reference |
1 //
2 // ********************************************************************
3 // * License and Disclaimer *
4 // * *
5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. *
10 // * *
11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitation of liability. *
17 // * *
18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Software license. *
24 // ********************************************************************
25 //
26 //
27 //
28 //
29 // ------------------------------------------------------------
30 // GEANT 4 class header file
31 // ------------------------------------------------------------
32 // Class description:
33 //
34 // Class implementing a pool of random numbers filled according
35 // to specified fixed size (default 1024).
36
37 // Author: A.Dotti (SLAC)
38 // ------------------------------------------------------------
39 #ifndef G4UNIFORMRANDPOOL_HH
40 #define G4UNIFORMRANDPOOL_HH
41
42 #include "G4Types.hh"
43 #include "Randomize.hh"
44
45 #include <algorithm>
46 #include <cassert>
47
48 #define G4UNIFORMRANDPOOL_DEFAULT_POOLSIZE 1024
49 #define G4UNIFORMRANDPOOL_TINY_POOLSIZE 128
50 #define G4UNIFORMRANDPOOL_SMALL_POOLSIZE 256
51 #define G4UNIFORMRANDPOOL_MEDIUM_POOLSIZE 512
52 #define G4UNIFORMRANDPOOL_LARGE_POOLSIZE 2048
53 #define G4UNIFORMRANDPOOL_HUGE_POOLSIZE 8192
54
55 class G4UniformRandPool
56 {
57 public:
58 G4UniformRandPool();
59 explicit G4UniformRandPool(G4int ps);
60 ~G4UniformRandPool();
61
62 void Resize(G4int newSize);
63 void GetMany(G4double* rnds, G4int howMany);
64 inline G4double GetOne();
65 inline G4int GetPoolSize() const;
66
67 // These two static methods are used to
68 // simulate the calls of CLHEP::HepRandom
69 //
70 static G4double flat();
71 static void flatArray(G4int howmany, G4double* rnds);
72
73 private:
74 void Fill(G4int howmany);
75
76 private:
77 G4int size{G4UNIFORMRANDPOOL_DEFAULT_POOLSIZE};
78 G4double* buffer{nullptr};
79 G4int currentIdx{0};
80 };
81
82 inline G4double G4UniformRandPool::GetOne()
83 {
84 // No more available numbers, re-fill
85 //
86 if(currentIdx >= /*(unsigned int)*/ size)
87 {
88 Fill(/*(unsigned int)*/ size);
89 }
90
91 return buffer[currentIdx++];
92 }
93
94 inline G4int G4UniformRandPool::GetPoolSize() const
95 {
96 return size;
97 }
98
99 #endif
100