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