| Geant4 Cross Reference |
1 // 1
2 // *******************************************
3 // * License and Disclaimer
4 // *
5 // * The Geant4 software is copyright of th
6 // * the Geant4 Collaboration. It is provided
7 // * conditions of the Geant4 Software License
8 // * LICENSE and available at http://cern.ch/
9 // * include a list of copyright holders.
10 // *
11 // * Neither the authors of this software syst
12 // * institutes,nor the agencies providing fin
13 // * work make any representation or warran
14 // * regarding this software system or assum
15 // * use. Please see the license in the file
16 // * for the full disclaimer and the limitatio
17 // *
18 // * This code implementation is the result
19 // * technical work of the GEANT4 collaboratio
20 // * By using, copying, modifying or distri
21 // * any work based on the software) you ag
22 // * use in resulting scientific publicati
23 // * acceptance of all terms of the Geant4 Sof
24 // *******************************************
25 //
26 /*
27 * ===========================================
28 *
29 * Filename: CexmcAngularRange.cc
30 *
31 * Description: angular range object
32 *
33 * Version: 1.0
34 * Created: 28.12.2009 22:35:07
35 * Revision: none
36 * Compiler: gcc
37 *
38 * Author: Alexey Radkov (),
39 * Company: PNPI
40 *
41 * ===========================================
42 */
43
44 #include <algorithm>
45 #include <iostream>
46 #include <iomanip>
47 #include <cmath>
48 #include "CexmcAngularRange.hh"
49
50
51 void GetNormalizedAngularRange( const CexmcAn
52 CexmcAngularR
53 {
54 dst = src;
55 if ( dst.size() < 2 )
56 return;
57
58 std::sort( dst.begin(), dst.end() );
59
60 const G4double epsilon( 1E-7 );
61
62 for ( CexmcAngularRangeList::iterator k(
63
64 {
65 if ( std::fabs( k->top - ( k - 1 )->to
66 k->bottom + epsilon >= ( k - 1 )-
67 {
68 k = dst.erase( k );
69 continue;
70 }
71 if ( k->top + epsilon >= ( k - 1 )->bo
72 {
73 ( k - 1 )->bottom = k->bottom;
74 k = dst.erase( k );
75 continue;
76 }
77 ++k;
78 }
79 }
80
81
82 void GetAngularGaps( const CexmcAngularRangeL
83 CexmcAngularRangeList &
84 {
85 if ( src.empty() )
86 {
87 dst.push_back( CexmcAngularRange( 1.0,
88 return;
89 }
90
91 CexmcAngularRangeList normalizedAngularRa
92 GetNormalizedAngularRange( src, normalized
93
94 G4int index( 0 );
95 if ( normalizedAngularRanges[ 0 ].top < 1.
96 dst.push_back( CexmcAngularRange(
97 1.0, normalizedAngular
98
99 for ( CexmcAngularRangeList::iterator
100 k( normalizedAngularRanges.begin()
101 k != normalizedAngularRanges.end()
102 {
103 if ( k + 1 == normalizedAngularRanges.
104 break;
105 dst.push_back( CexmcAngularRange(
106 k->bottom, ( k + 1 )->
107 }
108
109 if ( normalizedAngularRanges.back().bottom
110 dst.push_back( CexmcAngularRange(
111 normalizedAngularRange
112 }
113
114
115 std::ostream & operator<<( std::ostream & ou
116 const CexmcAngular
117 {
118 std::ostream::fmtflags savedFlags( out.fl
119 std::streamsize prec( out.precisio
120
121 out.precision( 4 );
122 out.flags( std::ios::fixed );
123
124 out << std::setw( 2 ) << angularRange.inde
125 angularRange.top << ", " << std::se
126 ")";
127
128 out.precision( prec );
129 out.flags( savedFlags );
130
131 return out;
132 }
133
134
135 std::ostream & operator<<( std::ostream & ou
136 const CexmcAngular
137 {
138 out << std::endl;
139 for ( CexmcAngularRangeList::const_iterato
140
141 {
142 out << " " << *k << st
143 }
144
145 return out;
146 }
147
148