| 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 /* 26 /*
27 * =========================================== 27 * ============================================================================
28 * 28 *
29 * Filename: CexmcAngularRange.cc 29 * Filename: CexmcAngularRange.cc
30 * 30 *
31 * Description: angular range object 31 * Description: angular range object
32 * 32 *
33 * Version: 1.0 33 * Version: 1.0
34 * Created: 28.12.2009 22:35:07 34 * Created: 28.12.2009 22:35:07
35 * Revision: none 35 * Revision: none
36 * Compiler: gcc 36 * Compiler: gcc
37 * 37 *
38 * Author: Alexey Radkov (), 38 * Author: Alexey Radkov (),
39 * Company: PNPI 39 * Company: PNPI
40 * 40 *
41 * =========================================== 41 * ============================================================================
42 */ 42 */
43 43
44 #include <algorithm> 44 #include <algorithm>
45 #include <iostream> 45 #include <iostream>
46 #include <iomanip> 46 #include <iomanip>
47 #include <cmath> 47 #include <cmath>
48 #include "CexmcAngularRange.hh" 48 #include "CexmcAngularRange.hh"
49 49
50 50
51 void GetNormalizedAngularRange( const CexmcAn 51 void GetNormalizedAngularRange( const CexmcAngularRangeList & src,
52 CexmcAngularR 52 CexmcAngularRangeList & dst )
53 { 53 {
54 dst = src; 54 dst = src;
55 if ( dst.size() < 2 ) 55 if ( dst.size() < 2 )
56 return; 56 return;
57 57
58 std::sort( dst.begin(), dst.end() ); 58 std::sort( dst.begin(), dst.end() );
59 59
60 const G4double epsilon( 1E-7 ); 60 const G4double epsilon( 1E-7 );
61 61
62 for ( CexmcAngularRangeList::iterator k( 62 for ( CexmcAngularRangeList::iterator k( dst.begin() + 1 );
63 63 k != dst.end(); )
64 { 64 {
65 if ( std::fabs( k->top - ( k - 1 )->to 65 if ( std::fabs( k->top - ( k - 1 )->top ) < epsilon ||
66 k->bottom + epsilon >= ( k - 1 )- 66 k->bottom + epsilon >= ( k - 1 )->bottom )
67 { 67 {
68 k = dst.erase( k ); 68 k = dst.erase( k );
69 continue; 69 continue;
70 } 70 }
71 if ( k->top + epsilon >= ( k - 1 )->bo 71 if ( k->top + epsilon >= ( k - 1 )->bottom )
72 { 72 {
73 ( k - 1 )->bottom = k->bottom; 73 ( k - 1 )->bottom = k->bottom;
74 k = dst.erase( k ); 74 k = dst.erase( k );
75 continue; 75 continue;
76 } 76 }
77 ++k; 77 ++k;
78 } 78 }
79 } 79 }
80 80
81 81
82 void GetAngularGaps( const CexmcAngularRangeL 82 void GetAngularGaps( const CexmcAngularRangeList & src,
83 CexmcAngularRangeList & 83 CexmcAngularRangeList & dst )
84 { 84 {
85 if ( src.empty() ) 85 if ( src.empty() )
86 { 86 {
87 dst.push_back( CexmcAngularRange( 1.0, 87 dst.push_back( CexmcAngularRange( 1.0, -1.0 , 0 ) );
88 return; 88 return;
89 } 89 }
90 90
91 CexmcAngularRangeList normalizedAngularRa 91 CexmcAngularRangeList normalizedAngularRanges;
92 GetNormalizedAngularRange( src, normalized 92 GetNormalizedAngularRange( src, normalizedAngularRanges );
93 93
94 G4int index( 0 ); 94 G4int index( 0 );
95 if ( normalizedAngularRanges[ 0 ].top < 1. 95 if ( normalizedAngularRanges[ 0 ].top < 1.0 )
96 dst.push_back( CexmcAngularRange( 96 dst.push_back( CexmcAngularRange(
97 1.0, normalizedAngular 97 1.0, normalizedAngularRanges[ 0 ].top, index++ ) );
98 98
99 for ( CexmcAngularRangeList::iterator 99 for ( CexmcAngularRangeList::iterator
100 k( normalizedAngularRanges.begin() 100 k( normalizedAngularRanges.begin() );
101 k != normalizedAngularRanges.end() 101 k != normalizedAngularRanges.end(); ++k )
102 { 102 {
103 if ( k + 1 == normalizedAngularRanges. 103 if ( k + 1 == normalizedAngularRanges.end() )
104 break; 104 break;
105 dst.push_back( CexmcAngularRange( 105 dst.push_back( CexmcAngularRange(
106 k->bottom, ( k + 1 )-> 106 k->bottom, ( k + 1 )->top, index++ ) );
107 } 107 }
108 108
109 if ( normalizedAngularRanges.back().bottom 109 if ( normalizedAngularRanges.back().bottom > -1.0 )
110 dst.push_back( CexmcAngularRange( 110 dst.push_back( CexmcAngularRange(
111 normalizedAngularRange 111 normalizedAngularRanges.back().bottom, -1.0, index ) );
112 } 112 }
113 113
114 114
115 std::ostream & operator<<( std::ostream & ou 115 std::ostream & operator<<( std::ostream & out,
116 const CexmcAngular 116 const CexmcAngularRange & angularRange )
117 { 117 {
118 std::ostream::fmtflags savedFlags( out.fl 118 std::ostream::fmtflags savedFlags( out.flags() );
119 std::streamsize prec( out.precisio 119 std::streamsize prec( out.precision() );
120 120
121 out.precision( 4 ); 121 out.precision( 4 );
122 out.flags( std::ios::fixed ); 122 out.flags( std::ios::fixed );
123 123
124 out << std::setw( 2 ) << angularRange.inde 124 out << std::setw( 2 ) << angularRange.index + 1 << " [" << std::setw( 7 ) <<
125 angularRange.top << ", " << std::se 125 angularRange.top << ", " << std::setw( 7 ) << angularRange.bottom <<
126 ")"; 126 ")";
127 127
128 out.precision( prec ); 128 out.precision( prec );
129 out.flags( savedFlags ); 129 out.flags( savedFlags );
130 130
131 return out; 131 return out;
132 } 132 }
133 133
134 134
135 std::ostream & operator<<( std::ostream & ou 135 std::ostream & operator<<( std::ostream & out,
136 const CexmcAngular 136 const CexmcAngularRangeList & angularRanges )
137 { 137 {
138 out << std::endl; 138 out << std::endl;
139 for ( CexmcAngularRangeList::const_iterato 139 for ( CexmcAngularRangeList::const_iterator k( angularRanges.begin() );
140 140 k != angularRanges.end(); ++k )
141 { 141 {
142 out << " " << *k << st 142 out << " " << *k << std::endl;
143 } 143 }
144 144
145 return out; 145 return out;
146 } 146 }
147 147
148 148