| 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 // class G4BlockingList Inlined Implementatio 29 // class G4BlockingList Inlined Implementation
30 // 30 //
31 // ------------------------------------------- 31 // --------------------------------------------------------------------
32 32
33 inline std::size_t G4BlockingList::Length() co 33 inline std::size_t G4BlockingList::Length() const
34 { 34 {
35 return fBlockingList.size(); 35 return fBlockingList.size();
36 } 36 }
37 37
38 inline void G4BlockingList::BlockVolume(const 38 inline void G4BlockingList::BlockVolume(const G4int vol)
39 { 39 {
40 fBlockingList[vol] = fBlockTagNo; 40 fBlockingList[vol] = fBlockTagNo;
41 } 41 }
42 42
43 inline G4bool G4BlockingList::IsBlocked(const 43 inline G4bool G4BlockingList::IsBlocked(const G4int vol) const
44 { 44 {
45 return fBlockingList[vol]==fBlockTagNo; << 45 return ( fBlockingList[vol]==fBlockTagNo ) ? true : false;
46 } 46 }
47 47
48 inline void G4BlockingList::Reset() 48 inline void G4BlockingList::Reset()
49 { 49 {
50 if ( fBlockTagNo!=kBlockTagNoMax ) 50 if ( fBlockTagNo!=kBlockTagNoMax )
51 { 51 {
52 fBlockTagNo += 1; 52 fBlockTagNo += 1;
53 } 53 }
54 else 54 else
55 { 55 {
56 FullyReset(); 56 FullyReset();
57 } 57 }
58 } 58 }
59 59
60 inline void G4BlockingList::Enlarge(const G4in 60 inline void G4BlockingList::Enlarge(const G4int nv)
61 { 61 {
62 std::size_t len=fBlockingList.size(); 62 std::size_t len=fBlockingList.size();
63 if ( G4int(len)<nv ) 63 if ( G4int(len)<nv )
64 { 64 {
65 std::size_t newlen = (nv/fStride+1)*fStrid 65 std::size_t newlen = (nv/fStride+1)*fStride;
66 fBlockingList.resize(newlen); 66 fBlockingList.resize(newlen);
67 for (auto i=len; i<newlen; ++i) 67 for (auto i=len; i<newlen; ++i)
68 { 68 {
69 fBlockingList[i] = 0; 69 fBlockingList[i] = 0;
70 } 70 }
71 } 71 }
72 } 72 }
73 73