| 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 // G4ProcessAttribute class implementation <<
27 // 26 //
28 // Author: H.Kurashige, 2 December 1997 << 27 // $Id: G4ProcessAttribute.cc,v 1.5 2006/06/29 21:08:08 gunter Exp $
29 // ------------------------------------------- << 28 // GEANT4 tag $Name: geant4-08-03-patch-01 $
>> 29 //
>> 30 //
>> 31 // ------------------------------------------------------------
>> 32 // GEANT 4 class header file
>> 33 //
>> 34 // History: first implementation, based on object model of
>> 35 // 2nd December 1997, H.Kurashige
>> 36 // ---------------- G4ProcessAttribute -----------------
>> 37 // History:
>> 38 // adds copy constructor 27 June 1998 H.Kurashige
>> 39 // ------------------------------------------------------------
30 40
31 #include "G4ProcessAttribute.hh" 41 #include "G4ProcessAttribute.hh"
32 42
33 // ------------------------------------------- << 43 G4ProcessAttribute::G4ProcessAttribute():
34 // Default constructor << 44 isActive(true)
35 // <<
36 G4ProcessAttribute::G4ProcessAttribute() <<
37 { 45 {
38 for (std::size_t idx=0; idx<G4ProcessManager << 46 pProcess = 0;
39 { << 47 idxProcessList = -1;
40 idxProcVector[idx] = -1; <<
41 ordProcVector[idx] = -1; <<
42 } <<
43 } 48 }
44 49
45 // ------------------------------------------- << 50 // copy constructor //////////////////////////
46 G4ProcessAttribute::G4ProcessAttribute(const G << 51 G4ProcessAttribute::G4ProcessAttribute(const G4ProcessAttribute &right)
47 : pProcess((G4VProcess*)aProcess) << 52 :isActive(true)
48 { 53 {
49 for(std::size_t idx=0; idx<G4ProcessManager: << 54 pProcess = right.pProcess;
50 { << 55 idxProcessList = right.idxProcessList;
51 idxProcVector[idx] = -1; << 56 // copy all contents in idxProcVector[] and ordProcVector[]
52 ordProcVector[idx] = 0; << 57 // deep copy
53 } << 58 for (G4int idx=0; idx<G4ProcessManager::SizeOfProcVectorArray; idx++){
54 } <<
55 <<
56 // ------------------------------------------- <<
57 // Copy constructor <<
58 // <<
59 G4ProcessAttribute::G4ProcessAttribute(const G <<
60 : pProcess(right.pProcess), <<
61 isActive(right.isActive), <<
62 idxProcessList(right.idxProcessList) <<
63 { <<
64 // copy all contents in idxProcVector[] and <<
65 // <<
66 for (std::size_t idx=0; idx<G4ProcessManager <<
67 { <<
68 idxProcVector[idx] = right.idxProcVector[i 59 idxProcVector[idx] = right.idxProcVector[idx];
69 ordProcVector[idx] = right.ordProcVector[i 60 ordProcVector[idx] = right.ordProcVector[idx];
70 } 61 }
71 } 62 }
72 63
73 // ------------------------------------------- << 64 G4ProcessAttribute::~G4ProcessAttribute()
74 // Destructor <<
75 // <<
76 G4ProcessAttribute::~G4ProcessAttribute() <<
77 { 65 {
78 // do nothing 66 // do nothing
79 } 67 }
80 68
81 // ------------------------------------------- << 69 G4ProcessAttribute & G4ProcessAttribute::operator=(G4ProcessAttribute &right)
82 // Assignment operator <<
83 // <<
84 G4ProcessAttribute& <<
85 G4ProcessAttribute::operator=(const G4ProcessA <<
86 { 70 {
87 if (this != &right) << 71 if (this != &right) {
88 { <<
89 pProcess = right.pProcess; 72 pProcess = right.pProcess;
90 idxProcessList = right.idxProcessList; 73 idxProcessList = right.idxProcessList;
91 isActive = right.isActive; 74 isActive = right.isActive;
92 << 75 // copy all contents in idxProcVector[] and ordProcVector[]
93 // copy all contents in idxProcVector[] an << 76 // deep copy
94 // << 77 for (G4int idx=0; idx<G4ProcessManager::SizeOfProcVectorArray; idx++){
95 for (std::size_t idx=0; idx<G4ProcessManag <<
96 { <<
97 idxProcVector[idx] = right.idxProcVector 78 idxProcVector[idx] = right.idxProcVector[idx];
98 ordProcVector[idx] = right.ordProcVector 79 ordProcVector[idx] = right.ordProcVector[idx];
99 } 80 }
100 } 81 }
101 return *this; 82 return *this;
102 } 83 }
>> 84
>> 85
>> 86
103 87