| 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 /* 26 /*
27 * File: G4ENDFYieldDataContainer.cc 27 * File: G4ENDFYieldDataContainer.cc
28 * Author: B. Wendt (wendbryc@isu.edu) 28 * Author: B. Wendt (wendbryc@isu.edu)
29 * 29 *
30 * Created on September 6, 2011, 10:19 AM 30 * Created on September 6, 2011, 10:19 AM
31 */ 31 */
32 << 32
33 #include "G4ENDFYieldDataContainer.hh" << 33 #include "globals.hh"
34 34
35 #include "G4ArrayOps.hh" 35 #include "G4ArrayOps.hh"
>> 36 #include "G4ENDFYieldDataContainer.hh"
36 #include "G4FFGEnumerations.hh" 37 #include "G4FFGEnumerations.hh"
37 #include "globals.hh" <<
38 38
39 G4ENDFYieldDataContainer::G4ENDFYieldDataConta << 39 G4ENDFYieldDataContainer::
>> 40 G4ENDFYieldDataContainer( G4int YieldSlots )
40 { 41 {
41 YieldSlots_ = YieldSlots; << 42 YieldSlots_ = YieldSlots;
42 43
43 Product_ = 0; << 44 Product_ = 0;
44 MetaState_ = G4FFGEnumerations::GROUND_STATE << 45 MetaState_ = G4FFGEnumerations::GROUND_STATE;
45 YieldProbability_ = new G4double[YieldSlots_ << 46 YieldProbability_ = new G4double[YieldSlots_];
46 YieldError_ = new G4double[YieldSlots_]; << 47 YieldError_ = new G4double[YieldSlots_];
47 } 48 }
48 49
49 G4FFGEnumerations::MetaState G4ENDFYieldDataCo << 50 G4FFGEnumerations::MetaState G4ENDFYieldDataContainer::
>> 51 GetMetaState( void )
50 { 52 {
51 return MetaState_; << 53 return MetaState_;
52 } 54 }
53 55
54 G4int G4ENDFYieldDataContainer::GetProduct() << 56 G4int G4ENDFYieldDataContainer::
>> 57 GetProduct( void )
55 { 58 {
56 return Product_; << 59 return Product_;
57 } 60 }
58 61
59 G4double* G4ENDFYieldDataContainer::GetYieldEr << 62 G4double* G4ENDFYieldDataContainer::
>> 63 GetYieldError( void )
60 { 64 {
61 return YieldError_; << 65 return YieldError_;
62 } 66 }
63 67
64 G4double* G4ENDFYieldDataContainer::GetYieldPr << 68 G4double* G4ENDFYieldDataContainer::
>> 69 GetYieldProbability( void )
65 { 70 {
66 return YieldProbability_; << 71 return YieldProbability_;
67 } 72 }
68 73
69 G4int G4ENDFYieldDataContainer::GetYieldSlots( << 74 G4int G4ENDFYieldDataContainer::
>> 75 GetYieldSlots( void )
70 { 76 {
71 return YieldSlots_; << 77 return YieldSlots_;
72 } 78 }
73 79
74 void G4ENDFYieldDataContainer::SetMetaState(G4 << 80 void G4ENDFYieldDataContainer::
>> 81 SetMetaState( G4FFGEnumerations::MetaState MetaState )
75 { 82 {
76 MetaState_ = MetaState; << 83 MetaState_ = MetaState;
77 } 84 }
78 85
79 void G4ENDFYieldDataContainer::SetProduct(G4in << 86 void G4ENDFYieldDataContainer::
>> 87 SetProduct( G4int Product )
80 { 88 {
81 Product_ = Product; << 89 Product_ = Product;
82 } 90 }
83 91
84 void G4ENDFYieldDataContainer::SetYieldError(G << 92 void G4ENDFYieldDataContainer::
>> 93 SetYieldError( G4double* YieldError )
85 { 94 {
86 G4ArrayOps::Copy(YieldSlots_, YieldError_, Y << 95 G4ArrayOps::Copy(YieldSlots_, YieldError_, YieldError);
87 } 96 }
88 97
89 void G4ENDFYieldDataContainer::SetYieldProbabi << 98 void G4ENDFYieldDataContainer::
>> 99 SetYieldProbability( G4double* YieldProbability )
90 { 100 {
91 G4ArrayOps::Copy(YieldSlots_, YieldProbabili << 101 G4ArrayOps::Copy(YieldSlots_, YieldProbability_, YieldProbability);
92 } 102 }
93 103
94 void G4ENDFYieldDataContainer:: 104 void G4ENDFYieldDataContainer::
95 // G4ENDFYieldDataContainer::SetYieldSlots(G << 105 //G4ENDFYieldDataContainer::SetYieldSlots(G4int NumberOfSlots)
96 SetYieldSlots(G4int NumberOfSlots) << 106 SetYieldSlots(G4int NumberOfSlots)
97 { 107 {
98 YieldSlots_ = NumberOfSlots; << 108 YieldSlots_ = NumberOfSlots;
99 } 109 }
100 110
101 G4ENDFYieldDataContainer::~G4ENDFYieldDataCont << 111 G4ENDFYieldDataContainer::
>> 112 ~G4ENDFYieldDataContainer( void )
102 { 113 {
103 delete[] YieldProbability_; << 114 delete[] YieldProbability_;
104 delete[] YieldError_; << 115 delete[] YieldError_;
105 } 116 }
>> 117
106 118