| 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 //
>> 27 // $Id: G4LogicalBorderSurface.cc 80067 2014-03-31 13:48:09Z gcosmo $
>> 28 //
>> 29 // --------------------------------------------------------------------
26 // G4LogicalBorderSurface Implementation 30 // G4LogicalBorderSurface Implementation
>> 31 // --------------------------------------------------------------------
27 // 32 //
28 // A Logical Surface class for surfaces define 33 // A Logical Surface class for surfaces defined by the boundary
29 // of two physical volumes. 34 // of two physical volumes.
30 // 35 //
31 // Author: John Apostolakis, CERN - 26-06-1997 << 36 // Created: 1997-06-26
32 // ------------------------------------------- << 37 // Author: John Apostolakis (John.Apostolakis@cern.ch)
>> 38 //
>> 39 // ----------------------------------------------------------------------
33 40
34 #include "G4LogicalBorderSurface.hh" 41 #include "G4LogicalBorderSurface.hh"
35 #include "G4VPhysicalVolume.hh" 42 #include "G4VPhysicalVolume.hh"
36 43
37 G4LogicalBorderSurfaceTable* << 44 G4LogicalBorderSurfaceTable *G4LogicalBorderSurface::theBorderSurfaceTable = 0;
38 G4LogicalBorderSurface::theBorderSurfaceTable <<
39 45
40 // ------------------------------------------- <<
41 // Constructor <<
42 // 46 //
>> 47 // Constructor & destructor
>> 48 //
>> 49
43 G4LogicalBorderSurface:: 50 G4LogicalBorderSurface::
44 G4LogicalBorderSurface(const G4String& name, 51 G4LogicalBorderSurface(const G4String& name,
45 G4VPhysicalVolume 52 G4VPhysicalVolume* vol1,
46 G4VPhysicalVolume 53 G4VPhysicalVolume* vol2,
47 G4SurfaceProperty 54 G4SurfaceProperty* surfaceProperty)
48 : G4LogicalSurface(name, surfaceProperty), 55 : G4LogicalSurface(name, surfaceProperty),
49 Volume1(vol1), Volume2(vol2), << 56 Volume1(vol1), Volume2(vol2)
50 Index(theBorderSurfaceTable != nullptr ? t <<
51 { 57 {
52 if (theBorderSurfaceTable == nullptr) << 58 if (!theBorderSurfaceTable)
53 { 59 {
54 theBorderSurfaceTable = new G4LogicalBorde 60 theBorderSurfaceTable = new G4LogicalBorderSurfaceTable;
55 } 61 }
56 62
57 // Store in the table of Surfaces 63 // Store in the table of Surfaces
58 // 64 //
59 theBorderSurfaceTable->insert(std::make_pair << 65 theBorderSurfaceTable->push_back(this);
>> 66 }
>> 67
>> 68 G4LogicalBorderSurface::
>> 69 G4LogicalBorderSurface(const G4LogicalBorderSurface& right)
>> 70 : G4LogicalSurface(right.GetName(), right.GetSurfaceProperty())
>> 71 {
>> 72 if (!theBorderSurfaceTable)
>> 73 {
>> 74 theBorderSurfaceTable = new G4LogicalBorderSurfaceTable;
>> 75 }
>> 76 SetTransitionRadiationSurface(right.GetTransitionRadiationSurface());
>> 77 Volume1 = right.Volume1;
>> 78 Volume2 = right.Volume2;
>> 79 (*theBorderSurfaceTable) = (*right.theBorderSurfaceTable);
>> 80 }
>> 81
>> 82 G4LogicalBorderSurface::~G4LogicalBorderSurface()
>> 83 {
>> 84 // delete theBorderSurfaceTable; theBorderSurfaceTable=0;
60 } 85 }
61 86
62 // ------------------------------------------- <<
63 // Default destructor <<
64 // 87 //
65 G4LogicalBorderSurface::~G4LogicalBorderSurfac << 88 // Operators
>> 89 //
66 90
67 // ------------------------------------------- << 91 G4LogicalBorderSurface&
68 G4bool << 92 G4LogicalBorderSurface::operator=(const G4LogicalBorderSurface &right)
>> 93 {
>> 94 if (&right == this) return *this;
>> 95 if (&right)
>> 96 {
>> 97 SetSurfaceProperty(right.GetSurfaceProperty());
>> 98 SetName(right.GetName());
>> 99 SetTransitionRadiationSurface(right.GetTransitionRadiationSurface());
>> 100 Volume1 = right.Volume1;
>> 101 Volume2 = right.Volume2;
>> 102 (*theBorderSurfaceTable) = (*right.theBorderSurfaceTable);
>> 103 }
>> 104 return *this;
>> 105 }
>> 106
>> 107 G4int
69 G4LogicalBorderSurface::operator==(const G4Log 108 G4LogicalBorderSurface::operator==(const G4LogicalBorderSurface &right) const
70 { 109 {
71 return (this == (G4LogicalBorderSurface *) & 110 return (this == (G4LogicalBorderSurface *) &right);
72 } 111 }
73 112
74 // ------------------------------------------- << 113 G4int
75 G4bool <<
76 G4LogicalBorderSurface::operator!=(const G4Log 114 G4LogicalBorderSurface::operator!=(const G4LogicalBorderSurface &right) const
77 { 115 {
78 return (this != (G4LogicalBorderSurface *) & 116 return (this != (G4LogicalBorderSurface *) &right);
79 } 117 }
80 118
81 // ------------------------------------------- << 119 //
>> 120 // Methods
>> 121 //
>> 122
82 const G4LogicalBorderSurfaceTable* G4LogicalBo 123 const G4LogicalBorderSurfaceTable* G4LogicalBorderSurface::GetSurfaceTable()
83 { 124 {
84 if (theBorderSurfaceTable == nullptr) << 125 if (!theBorderSurfaceTable)
85 { 126 {
86 theBorderSurfaceTable = new G4LogicalBorde 127 theBorderSurfaceTable = new G4LogicalBorderSurfaceTable;
87 } 128 }
88 return theBorderSurfaceTable; 129 return theBorderSurfaceTable;
89 } 130 }
90 131
91 // ------------------------------------------- << 132 size_t G4LogicalBorderSurface::GetNumberOfBorderSurfaces()
92 std::size_t G4LogicalBorderSurface::GetNumberO <<
93 { 133 {
94 if (theBorderSurfaceTable != nullptr) << 134 if (theBorderSurfaceTable)
95 { 135 {
96 return theBorderSurfaceTable->size(); 136 return theBorderSurfaceTable->size();
97 } 137 }
98 return 0; 138 return 0;
99 } 139 }
100 140
101 // ------------------------------------------- <<
102 G4LogicalBorderSurface* 141 G4LogicalBorderSurface*
103 G4LogicalBorderSurface::GetSurface(const G4VPh 142 G4LogicalBorderSurface::GetSurface(const G4VPhysicalVolume* vol1,
104 const G4VPh 143 const G4VPhysicalVolume* vol2)
105 { 144 {
106 if (theBorderSurfaceTable != nullptr) << 145 if (theBorderSurfaceTable)
107 { 146 {
108 auto pos = theBorderSurfaceTable->find(std << 147 for (size_t i=0; i<theBorderSurfaceTable->size(); i++)
109 if(pos != theBorderSurfaceTable->cend()) r << 148 {
>> 149 if( ((*theBorderSurfaceTable)[i]->GetVolume1() == vol1) &&
>> 150 ((*theBorderSurfaceTable)[i]->GetVolume2() == vol2) )
>> 151 return (*theBorderSurfaceTable)[i];
>> 152 }
110 } 153 }
111 return nullptr; << 154 return 0;
112 } 155 }
113 156
114 // ------------------------------------------- <<
115 // Dump info for known surfaces 157 // Dump info for known surfaces
116 // 158 //
117 void G4LogicalBorderSurface::DumpInfo() 159 void G4LogicalBorderSurface::DumpInfo()
118 { 160 {
119 G4cout << "***** Surface Table : Nb of Surfa 161 G4cout << "***** Surface Table : Nb of Surfaces = "
120 << GetNumberOfBorderSurfaces() << " * 162 << GetNumberOfBorderSurfaces() << " *****" << G4endl;
121 163
122 if (theBorderSurfaceTable != nullptr) << 164 if (theBorderSurfaceTable)
123 { 165 {
124 for(const auto & pos : *theBorderSurfaceTa << 166 for (size_t i=0; i<theBorderSurfaceTable->size(); i++)
125 { 167 {
126 G4LogicalBorderSurface* pSurf = pos.seco << 168 G4LogicalBorderSurface* pBorderSurface = (*theBorderSurfaceTable)[i];
127 G4cout << pSurf->GetName() << " : " << G << 169 G4cout << pBorderSurface->GetName() << " : " << G4endl
128 << " Border of volumes " 170 << " Border of volumes "
129 << pSurf->GetVolume1()->GetName() << 171 << pBorderSurface->GetVolume1()->GetName() << " and "
130 << pSurf->GetVolume2()->GetName() << 172 << pBorderSurface->GetVolume2()->GetName()
>> 173 << G4endl;
131 } 174 }
132 } 175 }
133 G4cout << G4endl; 176 G4cout << G4endl;
134 } 177 }
135 178
136 // ------------------------------------------- <<
137 void G4LogicalBorderSurface::CleanSurfaceTable 179 void G4LogicalBorderSurface::CleanSurfaceTable()
138 { 180 {
139 if (theBorderSurfaceTable != nullptr) << 181 if (theBorderSurfaceTable)
140 { 182 {
141 for(const auto & pos : *theBorderSurfaceTa << 183 G4LogicalBorderSurfaceTable::iterator pos;
>> 184 for(pos=theBorderSurfaceTable->begin();
>> 185 pos!=theBorderSurfaceTable->end(); pos++)
142 { 186 {
143 delete pos.second; << 187 if (*pos) { delete *pos; }
144 } 188 }
145 theBorderSurfaceTable->clear(); 189 theBorderSurfaceTable->clear();
146 } 190 }
147 return; 191 return;
148 } 192 }
149 193