| 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 // Implementation of G4PolyhedraHistorical, po 26 // Implementation of G4PolyhedraHistorical, polyhedra data
27 // 27 //
28 // Author: David C. Williams (davidw@scipp.ucs 28 // Author: David C. Williams (davidw@scipp.ucsc.edu)
29 // ------------------------------------------- 29 // --------------------------------------------------------------------
30 30
31 #include "G4PolyhedraHistorical.hh" 31 #include "G4PolyhedraHistorical.hh"
32 32
33 G4PolyhedraHistorical::G4PolyhedraHistorical() << 33 G4PolyhedraHistorical::G4PolyhedraHistorical()
>> 34 {
>> 35 }
34 36
35 G4PolyhedraHistorical::G4PolyhedraHistorical( 37 G4PolyhedraHistorical::G4PolyhedraHistorical( G4int z_planes )
36 : Num_z_planes(z_planes) 38 : Num_z_planes(z_planes)
37 { 39 {
38 Z_values = new G4double[z_planes]; 40 Z_values = new G4double[z_planes];
39 Rmin = new G4double[z_planes]; 41 Rmin = new G4double[z_planes];
40 Rmax = new G4double[z_planes]; 42 Rmax = new G4double[z_planes];
41 43
42 for( G4int i = 0; i < z_planes; ++i) 44 for( G4int i = 0; i < z_planes; ++i)
43 { 45 {
44 Z_values[i] = 0.0; 46 Z_values[i] = 0.0;
45 Rmin[i] = 0.0; 47 Rmin[i] = 0.0;
46 Rmax[i] = 0.0; 48 Rmax[i] = 0.0;
47 } 49 }
48 } 50 }
49 51
50 G4PolyhedraHistorical::~G4PolyhedraHistorical( 52 G4PolyhedraHistorical::~G4PolyhedraHistorical()
51 { 53 {
52 delete [] Z_values; 54 delete [] Z_values;
53 delete [] Rmin; 55 delete [] Rmin;
54 delete [] Rmax; 56 delete [] Rmax;
55 } 57 }
56 58
57 G4PolyhedraHistorical:: 59 G4PolyhedraHistorical::
58 G4PolyhedraHistorical( const G4PolyhedraHistor 60 G4PolyhedraHistorical( const G4PolyhedraHistorical& source )
59 { 61 {
60 Start_angle = source.Start_angle; 62 Start_angle = source.Start_angle;
61 Opening_angle = source.Opening_angle; 63 Opening_angle = source.Opening_angle;
62 numSide = source.numSide; 64 numSide = source.numSide;
63 Num_z_planes = source.Num_z_planes; 65 Num_z_planes = source.Num_z_planes;
64 66
65 Z_values = new G4double[Num_z_planes]; 67 Z_values = new G4double[Num_z_planes];
66 Rmin = new G4double[Num_z_planes]; 68 Rmin = new G4double[Num_z_planes];
67 Rmax = new G4double[Num_z_planes]; 69 Rmax = new G4double[Num_z_planes];
68 70
69 for( G4int i = 0; i < Num_z_planes; ++i) 71 for( G4int i = 0; i < Num_z_planes; ++i)
70 { 72 {
71 Z_values[i] = source.Z_values[i]; 73 Z_values[i] = source.Z_values[i];
72 Rmin[i] = source.Rmin[i]; 74 Rmin[i] = source.Rmin[i];
73 Rmax[i] = source.Rmax[i]; 75 Rmax[i] = source.Rmax[i];
74 } 76 }
75 } 77 }
76 78
77 G4PolyhedraHistorical& 79 G4PolyhedraHistorical&
78 G4PolyhedraHistorical::operator=( const G4Poly 80 G4PolyhedraHistorical::operator=( const G4PolyhedraHistorical& right )
79 { 81 {
80 if ( &right == this ) return *this; 82 if ( &right == this ) return *this;
81 83
82 Start_angle = right.Start_angle; 84 Start_angle = right.Start_angle;
83 Opening_angle = right.Opening_angle; 85 Opening_angle = right.Opening_angle;
84 numSide = right.numSide; 86 numSide = right.numSide;
85 Num_z_planes = right.Num_z_planes; 87 Num_z_planes = right.Num_z_planes;
86 88
87 delete [] Z_values; 89 delete [] Z_values;
88 delete [] Rmin; 90 delete [] Rmin;
89 delete [] Rmax; 91 delete [] Rmax;
90 Z_values = new G4double[Num_z_planes]; 92 Z_values = new G4double[Num_z_planes];
91 Rmin = new G4double[Num_z_planes]; 93 Rmin = new G4double[Num_z_planes];
92 Rmax = new G4double[Num_z_planes]; 94 Rmax = new G4double[Num_z_planes];
93 95
94 for( G4int i = 0; i < Num_z_planes; ++i) 96 for( G4int i = 0; i < Num_z_planes; ++i)
95 { 97 {
96 Z_values[i] = right.Z_values[i]; 98 Z_values[i] = right.Z_values[i];
97 Rmin[i] = right.Rmin[i]; 99 Rmin[i] = right.Rmin[i];
98 Rmax[i] = right.Rmax[i]; 100 Rmax[i] = right.Rmax[i];
99 } 101 }
100 102
101 return *this; 103 return *this;
102 } 104 }
103 105