| 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 and of QinetiQ Ltd, *
20 // * subject to DEFCON 705 IPR conditions. << 20 // * subject DEFCON 705 IPR conditions. *
21 // * By using, copying, modifying or distri 21 // * By using, copying, modifying or distributing the software (or *
22 // * any work based on the software) you ag 22 // * any work based on the software) you agree to acknowledge its *
23 // * use in resulting scientific publicati 23 // * use in resulting scientific publications, and indicate your *
24 // * acceptance of all terms of the Geant4 Sof 24 // * acceptance of all terms of the Geant4 Software license. *
25 // ******************************************* 25 // ********************************************************************
26 // 26 //
27 // G4VFacet implementation. << 27 // $Id: G4VFacet.cc,v 1.4 2007/02/12 09:34:45 gcosmo Exp $
>> 28 // GEANT4 tag $Name: geant4-08-03-patch-01 $
>> 29 //
>> 30 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
>> 31 //
>> 32 // MODULE: G4VFacet.hh
>> 33 //
>> 34 // Date: 15/06/2005
>> 35 // Author: P R Truscott
>> 36 // Organisation: QinetiQ Ltd, UK
>> 37 // Customer: UK Ministry of Defence : RAO CRP TD Electronic Systems
>> 38 // Contract: C/MAT/N03517
>> 39 //
>> 40 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
>> 41 //
>> 42 // CHANGE HISTORY
>> 43 // --------------
28 // 44 //
29 // 31 October 2004, P R Truscott, QinetiQ Ltd, 45 // 31 October 2004, P R Truscott, QinetiQ Ltd, UK - Created.
30 // 12 October 2012, M Gayer, CERN, - Reviewed << 46 //
31 // ------------------------------------------- << 47 // %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
32 48
33 #include "G4VFacet.hh" 49 #include "G4VFacet.hh"
34 #include "globals.hh" 50 #include "globals.hh"
35 #include "geomdefs.hh" <<
36 #include "G4GeometryTolerance.hh" <<
37 <<
38 using namespace std; <<
39 <<
40 const G4double G4VFacet::dirTolerance = 1.0E-1 <<
41 51
42 ////////////////////////////////////////////// 52 ///////////////////////////////////////////////////////////////////////////////
43 // 53 //
44 G4VFacet::G4VFacet() << 54 G4VFacet::G4VFacet ()
45 { 55 {
46 kCarTolerance = G4GeometryTolerance::GetInst << 56 dirTolerance = 1.0E-14;
>> 57
>> 58 P.clear();
>> 59 E.clear();
>> 60
>> 61 centroid = G4ThreeVector(0.0,0.0,0.0);
>> 62 radius = 0.0;
>> 63 radiusSqr = 0.0;
>> 64 area = 0.0;
47 } 65 }
48 66
49 ////////////////////////////////////////////// 67 ///////////////////////////////////////////////////////////////////////////////
50 // 68 //
51 G4VFacet::~G4VFacet() = default; << 69 G4VFacet::~G4VFacet ()
>> 70 {
>> 71 P.clear();
>> 72 E.clear();
>> 73 }
52 74
53 ////////////////////////////////////////////// 75 ///////////////////////////////////////////////////////////////////////////////
54 // 76 //
55 G4bool G4VFacet::operator== (const G4VFacet& r << 77 G4bool G4VFacet::operator== (const G4VFacet &right) const
56 { 78 {
57 G4double tolerance = kCarTolerance*kCarToler 79 G4double tolerance = kCarTolerance*kCarTolerance/4.0;
58 << 80 if (nVertices != right.GetNumberOfVertices())
59 if (GetNumberOfVertices() != right.GetNumber << 81 { return false; }
60 return false; << 82 else if ((centroid-right.GetCentroid()).mag2() > tolerance)
61 else if ((GetCircumcentre()-right.GetCircumc << 83 { return false; }
62 return false; << 84 else if (std::fabs((right.GetSurfaceNormal()).dot(surfaceNormal)) < 0.9999999999)
63 else if (std::fabs((right.GetSurfaceNormal() << 85 { return false; }
64 return false; <<
65 86
66 G4bool coincident = true; 87 G4bool coincident = true;
67 G4int i = 0; << 88 size_t i = 0;
68 do // Loop checking, 13.08.2015, G.Cosmo << 89 do
69 { 90 {
70 coincident = false; 91 coincident = false;
71 G4int j = 0; << 92 size_t j = 0;
72 do // Loop checking, 13.08.2015, G.Cosm << 93 do
73 { 94 {
74 coincident = (GetVertex(i)-right.GetVert 95 coincident = (GetVertex(i)-right.GetVertex(j)).mag2() < tolerance;
75 } while (!coincident && ++j < GetNumberOfV << 96 } while (!coincident && j++ < nVertices);
76 } while (coincident && ++i < GetNumberOfVert << 97 } while (coincident && i++ < nVertices);
77 << 98
78 return coincident; 99 return coincident;
79 } 100 }
80 101
81 ////////////////////////////////////////////// 102 ///////////////////////////////////////////////////////////////////////////////
82 // 103 //
83 void G4VFacet::ApplyTranslation(const G4ThreeV << 104 void G4VFacet::ApplyTranslation(const G4ThreeVector v)
84 { 105 {
85 G4int n = GetNumberOfVertices(); << 106 P0 += v;
86 for (G4int i = 0; i < n; ++i) << 107 for (G4ThreeVectorList::iterator it=P.begin(); it!=P.end(); it++)
87 { 108 {
88 SetVertex(i, GetVertex(i) + v); << 109 (*it) += v;
89 } 110 }
90 } 111 }
91 112
92 ////////////////////////////////////////////// 113 ///////////////////////////////////////////////////////////////////////////////
93 // 114 //
94 std::ostream& G4VFacet::StreamInfo(std::ostrea << 115 std::ostream &G4VFacet::StreamInfo(std::ostream &os) const
95 { 116 {
96 os << G4endl; << 117 os <<G4endl;
97 os << "************************************* << 118 os <<"***********************************************************************"
98 << G4endl; << 119 <<G4endl;
99 os << "FACET TYPE = " << GetEntityType << 120 os <<"FACET TYPE = " <<geometryType <<G4endl;
100 os << "ABSOLUTE VECTORS = " << G4endl; << 121 os <<"ABSOLUTE VECTORS = " <<G4endl;
101 G4int n = GetNumberOfVertices(); << 122 os <<"P0 = " <<P0 <<G4endl;
102 for (G4int i = 0; i < n; ++i) << 123 for (G4ThreeVectorList::const_iterator it=P.begin(); it!=P.end(); it++)
103 os << "P[" << i << "] = " << GetVerte << 124 os <<"P[" <<it-P.begin()+1 <<"] = " <<*it <<G4endl;
104 os << "************************************* << 125
105 << G4endl; << 126 os <<"RELATIVE VECTORS = " <<G4endl;
106 << 127 for (G4ThreeVectorList::const_iterator it=E.begin(); it!=E.end(); it++)
>> 128 os <<"E[" <<it-E.begin()+1 <<"] = " <<*it <<G4endl;
>> 129
>> 130 os <<"***********************************************************************"
>> 131 <<G4endl;
>> 132
107 return os; 133 return os;
108 } 134 }
109 135
110 G4bool G4VFacet::IsInside (const G4ThreeVector << 136 ///////////////////////////////////////////////////////////////////////////////
111 { << 137 //
112 G4ThreeVector d = p-GetVertex(0); << 138 G4VFacet* G4VFacet::GetClone ()
113 G4double displacement = d.dot(GetSurfaceNorm << 139 {return 0;}
114 return displacement <= 0.0; << 140
115 } << 141 ///////////////////////////////////////////////////////////////////////////////
>> 142 //
>> 143 G4double G4VFacet::Distance (const G4ThreeVector&, const G4double)
>> 144 {return kInfinity;}
>> 145
>> 146 ///////////////////////////////////////////////////////////////////////////////
>> 147 //
>> 148 G4double G4VFacet::Distance (const G4ThreeVector&, const G4double,
>> 149 const G4bool)
>> 150 {return kInfinity;}
>> 151
>> 152 ///////////////////////////////////////////////////////////////////////////////
>> 153 //
>> 154 G4double G4VFacet::Extent (const G4ThreeVector)
>> 155 {return 0.0;}
>> 156
>> 157 ///////////////////////////////////////////////////////////////////////////////
>> 158 //
>> 159 G4bool G4VFacet::Intersect (const G4ThreeVector&, const G4ThreeVector &,
>> 160 const G4bool , G4double &, G4double &,
>> 161 G4ThreeVector &)
>> 162 {return false;}
116 163