| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer 3 // * License and Disclaimer *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. 9 // * include a list of copyright holders. *
10 // * 10 // * *
11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. *
17 // * 17 // * *
18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. *
24 // ******************************************* 24 // ********************************************************************
25 // 25 //
26 // G4DecayProducts <<
27 // 26 //
28 // Class description: << 27 // $Id: G4DecayProducts.hh,v 1.12 2006/06/29 19:22:45 gunter Exp $
>> 28 // GEANT4 tag $Name: geant4-09-01-patch-03 $
29 // 29 //
30 // Container for decay products of dynamic par << 30 //
>> 31 // ------------------------------------------------------------
>> 32 // GEANT 4 class header file
>> 33 //
>> 34 // History: first implementation, based on object model of
>> 35 // 12 Dec 1997 H.Kurashige
>> 36 // ------------------------------------------------------------
31 37
32 // Author: H.Kurashige, 12 July 1996 << 38 #ifndef G4DecayProducts_h
33 // ------------------------------------------- << 39 #define G4DecayProducts_h 1
34 #ifndef G4DecayProducts_hh <<
35 #define G4DecayProducts_hh 1 <<
36 40
37 #include "G4DynamicParticle.hh" <<
38 #include "G4ios.hh" 41 #include "G4ios.hh"
39 #include "globals.hh" 42 #include "globals.hh"
40 << 43 #include "G4DynamicParticle.hh"
41 #include <vector> << 44 #include "G4Allocator.hh"
42 45
43 class G4DecayProducts 46 class G4DecayProducts
44 { 47 {
45 public: << 48 public: // With Description
46 // Constructors << 49
>> 50 // constructors
47 G4DecayProducts(); 51 G4DecayProducts();
48 G4DecayProducts(const G4DynamicParticle& a << 52 G4DecayProducts(const G4DynamicParticle &aParticle);
49 53
50 // Copy constructor and assignment operato << 54 public:
51 // Deep copy: for G4DynamicParticle pointe << 55 // copy constructor and assignment operator
52 G4DecayProducts(const G4DecayProducts& rig << 56 // Deep copy: for G4DynamicParticle pointer
53 G4DecayProducts& operator=(const G4DecayPr << 57 G4DecayProducts(const G4DecayProducts &right);
>> 58 G4DecayProducts & operator=(const G4DecayProducts &right);
54 59
55 // Destructor << 60 //destructor
56 ~G4DecayProducts(); 61 ~G4DecayProducts();
57 62
58 // Equality operators << 63 // new & delete operators for G4Allocator
59 inline G4bool operator==(const G4DecayProd << 64 inline void *operator new(size_t);
60 inline G4bool operator!=(const G4DecayProd << 65 inline void operator delete(void *G4DecayProducts);
61 << 66
62 // Set-get methods for the parent particle << 67 // (un)equal operator
63 // to get information of parent particle w << 68 G4int operator==(const G4DecayProducts &right) const;
64 // New G4DynamicParticle object is created << 69 G4int operator!=(const G4DecayProducts &right) const;
65 inline const G4DynamicParticle* GetParentP << 70
66 void SetParentParticle(const G4DynamicPart << 71 public: // With Description
>> 72 // set-get methods for the parent particle
>> 73 // theParentPaticle is used to get information of parent particle
>> 74 // when decay products are filled
>> 75 // new G4DynamicParticle object is created in set methods
>> 76 const G4DynamicParticle* GetParentParticle() const {return theParentParticle;};
>> 77 void SetParentParticle(const G4DynamicParticle &aParticle);
67 78
68 // Boost all products << 79 // boost all products
69 void Boost(G4double totalEnergy, const G4T << 80 void Boost(G4double totalEnergy, const G4ThreeVector &momentumDirection);
70 void Boost(G4double betax, G4double betay, 81 void Boost(G4double betax, G4double betay, G4double betaz);
71 << 82
72 // Push/pop methods for decay products poi << 83 // push-pop methods for decay products pointer
73 G4DynamicParticle* PopProducts(); 84 G4DynamicParticle* PopProducts();
74 G4int PushProducts(G4DynamicParticle* aPar << 85 G4int PushProducts(G4DynamicParticle *aParticle);
75 86
76 G4DynamicParticle* operator[](G4int anInde 87 G4DynamicParticle* operator[](G4int anIndex) const;
77 88
78 inline G4int entries() const { return numb << 89 G4int entries() const {return numberOfProducts;};
79 <<
80 // Check energy/momentum of products <<
81 G4bool IsChecked() const; <<
82 90
>> 91 // check energy/momentum of products
>> 92 G4bool IsChecked() const;
>> 93
>> 94 //
83 void DumpInfo() const; 95 void DumpInfo() const;
84 96
85 using G4DecayProductVector = std::vector<G << 97 protected:
>> 98 enum {MaxNumberOfProducts = 64};
>> 99
>> 100 private:
>> 101 G4int numberOfProducts;
>> 102 G4DynamicParticle* theParentParticle;
>> 103 G4DynamicParticle* theProductVector[MaxNumberOfProducts];
86 104
87 private: <<
88 G4int numberOfProducts = 0; <<
89 G4DynamicParticle* theParentParticle = nul <<
90 G4DecayProductVector* theProductVector = n <<
91 }; 105 };
92 106
>> 107 #if defined G4PARTICLES_ALLOC_EXPORT
>> 108 extern G4DLLEXPORT G4Allocator<G4DecayProducts> aDecayProductsAllocator;
>> 109 #else
>> 110 extern G4DLLIMPORT G4Allocator<G4DecayProducts> aDecayProductsAllocator;
>> 111 #endif
>> 112
93 // ------------------------ 113 // ------------------------
94 // Inline methods << 114 // Inlined operators
95 // ------------------------ 115 // ------------------------
96 116
97 inline G4bool G4DecayProducts::operator==(cons << 117 inline void * G4DecayProducts::operator new(size_t)
98 { 118 {
99 return (this == (G4DecayProducts*)&right); << 119 void * aDecayProducts;
>> 120 aDecayProducts = (void *) aDecayProductsAllocator.MallocSingle();
>> 121 return aDecayProducts;
100 } 122 }
101 123
102 inline G4bool G4DecayProducts::operator!=(cons << 124 inline void G4DecayProducts::operator delete(void * aDecayProducts)
103 { 125 {
104 return (this != (G4DecayProducts*)&right); << 126 aDecayProductsAllocator.FreeSingle((G4DecayProducts *) aDecayProducts);
105 } 127 }
106 128
107 inline const G4DynamicParticle* G4DecayProduct << 129 inline
>> 130 G4int G4DecayProducts::operator==(const G4DecayProducts &right) const
108 { 131 {
109 return theParentParticle; << 132 return (this == (G4DecayProducts *) &right);
>> 133 }
>> 134
>> 135 inline
>> 136 G4int G4DecayProducts::operator!=(const G4DecayProducts &right) const
>> 137 {
>> 138 return (this != (G4DecayProducts *) &right);
110 } 139 }
111 140
112 #endif 141 #endif
>> 142
113 143