| 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 // G4ProcessVector class implementation 26 // G4ProcessVector class implementation
27 // 27 //
28 // Authors: G.Cosmo, H.Kurashige - 1998 28 // Authors: G.Cosmo, H.Kurashige - 1998
29 // ------------------------------------------- 29 // --------------------------------------------------------------------
30 30
31 #include "G4VProcess.hh" 31 #include "G4VProcess.hh"
32 #include "G4ProcessVector.hh" 32 #include "G4ProcessVector.hh"
33 33
34 // ------------------------------------------- 34 // --------------------------------------------------------------------
35 /////// Constructors 35 /////// Constructors
36 // 36 //
37 G4ProcessVector::G4ProcessVector() 37 G4ProcessVector::G4ProcessVector()
38 { 38 {
39 pProcVector = new G4ProcVector(); 39 pProcVector = new G4ProcVector();
40 } 40 }
41 41
42 G4ProcessVector::G4ProcessVector(std::size_t s 42 G4ProcessVector::G4ProcessVector(std::size_t siz)
43 { 43 {
44 pProcVector = new G4ProcVector(siz); 44 pProcVector = new G4ProcVector(siz);
45 } 45 }
46 46
47 G4ProcessVector::G4ProcessVector(const G4Proce 47 G4ProcessVector::G4ProcessVector(const G4ProcessVector& right)
48 : pProcVector(nullptr) 48 : pProcVector(nullptr)
49 { 49 {
50 pProcVector = new G4ProcVector(); 50 pProcVector = new G4ProcVector();
51 51
52 // copy all contents in pProcVector 52 // copy all contents in pProcVector
53 // 53 //
54 for (auto i=right.pProcVector->cbegin(); i!= 54 for (auto i=right.pProcVector->cbegin(); i!=right.pProcVector->cend(); ++i)
55 { 55 {
56 pProcVector->push_back(*i); 56 pProcVector->push_back(*i);
57 } 57 }
58 } 58 }
59 59
60 // ------------------------------------------- 60 // --------------------------------------------------------------------
61 /////// destructor 61 /////// destructor
62 // 62 //
63 G4ProcessVector::~G4ProcessVector() 63 G4ProcessVector::~G4ProcessVector()
64 { 64 {
65 // delete pProcVector 65 // delete pProcVector
66 // 66 //
67 if (pProcVector != nullptr ) 67 if (pProcVector != nullptr )
68 { 68 {
69 pProcVector->clear(); 69 pProcVector->clear();
70 delete pProcVector; 70 delete pProcVector;
71 } 71 }
72 } 72 }
73 73
74 // ------------------------------------------- 74 // --------------------------------------------------------------------
75 ////// assignment operator 75 ////// assignment operator
76 // 76 //
77 G4ProcessVector& G4ProcessVector::operator=(co 77 G4ProcessVector& G4ProcessVector::operator=(const G4ProcessVector& right)
78 { 78 {
79 if (this != &right) 79 if (this != &right)
80 { 80 {
81 // delete pProcVector 81 // delete pProcVector
82 if (pProcVector != nullptr ) 82 if (pProcVector != nullptr )
83 { 83 {
84 pProcVector->clear(); 84 pProcVector->clear();
85 delete pProcVector; 85 delete pProcVector;
86 } 86 }
87 87
88 pProcVector = new G4ProcVector(); 88 pProcVector = new G4ProcVector();
89 89
90 // copy all contents in pProcVector 90 // copy all contents in pProcVector
91 // 91 //
92 for (auto i=right.pProcVector->cbegin(); i 92 for (auto i=right.pProcVector->cbegin(); i!=right.pProcVector->cend(); ++i)
93 { 93 {
94 pProcVector->push_back(*i); 94 pProcVector->push_back(*i);
95 } 95 }
96 } 96 }
97 return *this; 97 return *this;
98 } 98 }
99 99
100 // ------------------------------------------- 100 // --------------------------------------------------------------------
101 // 101 //
102 std::size_t G4ProcessVector::index(G4VProcess* 102 std::size_t G4ProcessVector::index(G4VProcess* aProcess) const
103 { 103 {
104 std::size_t j=0; 104 std::size_t j=0;
105 for (auto it=pProcVector->cbegin();it!=pProc 105 for (auto it=pProcVector->cbegin();it!=pProcVector->cend(); ++j, ++it)
106 { 106 {
107 if (*(*it)==*aProcess) return j; 107 if (*(*it)==*aProcess) return j;
108 } 108 }
109 return -1; 109 return -1;
110 } 110 }
111 111
112 // ------------------------------------------- 112 // --------------------------------------------------------------------
113 // 113 //
114 G4bool G4ProcessVector::contains(G4VProcess* a 114 G4bool G4ProcessVector::contains(G4VProcess* aProcess) const
115 { 115 {
116 for (auto it=pProcVector->cbegin();it!=pProc 116 for (auto it=pProcVector->cbegin();it!=pProcVector->cend(); ++it)
117 { 117 {
118 if (*(*it)==*aProcess) return true; 118 if (*(*it)==*aProcess) return true;
119 } 119 }
120 return false; 120 return false;
121 } 121 }
122 122
123 // ------------------------------------------- 123 // --------------------------------------------------------------------
124 // 124 //
125 G4bool G4ProcessVector::insertAt(G4int i, G4VP 125 G4bool G4ProcessVector::insertAt(G4int i, G4VProcess* aProcess)
126 { 126 {
127 if ( (i<0) || (i>G4int(pProcVector->size())) 127 if ( (i<0) || (i>G4int(pProcVector->size())) ) return false;
128 if (i==G4int(pProcVector->size())) 128 if (i==G4int(pProcVector->size()))
129 { 129 {
130 pProcVector->push_back(aProcess); 130 pProcVector->push_back(aProcess);
131 } 131 }
132 else 132 else
133 { 133 {
134 auto it=pProcVector->cbegin(); 134 auto it=pProcVector->cbegin();
135 for(G4int j=0; j!=i; ++j) ++it; 135 for(G4int j=0; j!=i; ++j) ++it;
136 pProcVector->insert(it, aProcess); 136 pProcVector->insert(it, aProcess);
137 } 137 }
138 return true; 138 return true;
139 } 139 }
140 140
141 // ------------------------------------------- 141 // --------------------------------------------------------------------
142 // 142 //
143 G4VProcess* G4ProcessVector::removeAt(G4int i) 143 G4VProcess* G4ProcessVector::removeAt(G4int i)
144 { 144 {
145 auto it=pProcVector->cbegin(); 145 auto it=pProcVector->cbegin();
146 for(std::size_t j=0; j<pProcVector->size() & 146 for(std::size_t j=0; j<pProcVector->size() && G4int(j)<i; ++j) ++it;
147 G4VProcess* rValue = *it; 147 G4VProcess* rValue = *it;
148 pProcVector->erase(it); 148 pProcVector->erase(it);
149 return rValue; 149 return rValue;
150 } 150 }
151 151