| 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 // G4ProcTblElement class implementation <<
27 // 26 //
28 // Author: H.Kurashige, 4 August 1998 << 27 //
29 // ------------------------------------------- << 28 //
30 << 29 // ------------------------------------------------------------
>> 30 // GEANT 4 class header file
>> 31 //
>> 32 // History: first implementation, based on object model of
>> 33 // 4th Aug 1998, H.Kurashige
>> 34 // ------------------------------------------------------------
>> 35 // Use STL vector instead of RW vector 1. Mar 00 H.Kurashige
>> 36 //
31 #include "G4ProcTblElement.hh" 37 #include "G4ProcTblElement.hh"
32 38
33 // ------------------------------------------- << 39
34 // Default constructor << 40 // default constructor ////////////////////////
35 // <<
36 G4ProcTblElement::G4ProcTblElement() 41 G4ProcTblElement::G4ProcTblElement()
>> 42 :pProcess(nullptr),pProcMgrVector(nullptr)
37 { 43 {
38 } 44 }
39 45
40 // ------------------------------------------- << 46 //////////////////////////
41 G4ProcTblElement::G4ProcTblElement(G4VProcess* << 47 G4ProcTblElement::G4ProcTblElement(G4VProcess* aProcess):
42 : pProcess(aProcess) << 48 pProcess(aProcess)
43 { 49 {
44 pProcMgrVector = new G4ProcMgrVector(); 50 pProcMgrVector = new G4ProcMgrVector();
45 } 51 }
46 52
47 // ------------------------------------------- << 53 // copy constructor //////////////////////////
48 // Copy constructor << 54 G4ProcTblElement::G4ProcTblElement(const G4ProcTblElement &right)
49 // << 55 :pProcess(nullptr),pProcMgrVector(nullptr)
50 G4ProcTblElement::G4ProcTblElement(const G4Pro <<
51 { 56 {
52 *this = right; 57 *this = right;
53 } 58 }
54 59
55 // ------------------------------------------- << 60
56 // Destructor << 61 // destructor ////////////////////////
57 // <<
58 G4ProcTblElement::~G4ProcTblElement() 62 G4ProcTblElement::~G4ProcTblElement()
59 { 63 {
60 if (pProcMgrVector != nullptr) << 64 if (pProcMgrVector != nullptr) {
61 { <<
62 pProcMgrVector->clear(); 65 pProcMgrVector->clear();
63 delete pProcMgrVector; 66 delete pProcMgrVector;
64 } 67 }
65 } 68 }
66 69
67 // ------------------------------------------- <<
68 G4ProcTblElement& G4ProcTblElement::operator=( <<
69 { <<
70 if (this != &right) <<
71 { <<
72 pProcess = right.pProcess; <<
73 70
>> 71 //////////////////////////
>> 72 G4ProcTblElement & G4ProcTblElement::operator=(const G4ProcTblElement &right)
>> 73 {
>> 74 if (this != &right) {
>> 75 pProcess = right.pProcess;
74 // copy all contents in pProcMgrVector 76 // copy all contents in pProcMgrVector
75 if (pProcMgrVector != nullptr) << 77 if (pProcMgrVector != nullptr) {
76 { <<
77 pProcMgrVector->clear(); 78 pProcMgrVector->clear();
78 delete pProcMgrVector; 79 delete pProcMgrVector;
79 } 80 }
80 pProcMgrVector = new G4ProcMgrVector(); 81 pProcMgrVector = new G4ProcMgrVector();
81 for (auto i = right.pProcMgrVector->cbegin << 82 G4ProcMgrVector::iterator i;
82 i!= right.pProcMgrVector->cend() << 83 for (i = right.pProcMgrVector->begin(); i!= right.pProcMgrVector->end(); ++i) {
83 { <<
84 pProcMgrVector->push_back(*i); 84 pProcMgrVector->push_back(*i);
85 } 85 }
86 } 86 }
87 return *this; 87 return *this;
88 } 88 }
89 89
90 // ------------------------------------------- << 90
91 G4bool G4ProcTblElement::operator==(const G4Pr << 91 //////////////////////////
>> 92 G4bool G4ProcTblElement::operator==(const G4ProcTblElement &right) const
92 { 93 {
93 return (this == &right); 94 return (this == &right);
94 } 95 }
95 96
96 // ------------------------------------------- << 97
97 G4bool G4ProcTblElement::operator!=(const G4Pr << 98 //////////////////////////
>> 99 G4bool G4ProcTblElement::operator!=(const G4ProcTblElement &right) const
98 { 100 {
99 return (this != &right); 101 return (this != &right);
100 } 102 }
>> 103
>> 104
>> 105
>> 106
>> 107
>> 108
>> 109
>> 110
>> 111
>> 112
>> 113
>> 114
>> 115
>> 116
>> 117
>> 118
>> 119
>> 120
>> 121
>> 122
>> 123
>> 124
>> 125
>> 126
101 127