| 1 | //
|
|---|
| 2 | // ********************************************************************
|
|---|
| 3 | // * License and Disclaimer *
|
|---|
| 4 | // * *
|
|---|
| 5 | // * The Geant4 software is copyright of the Copyright Holders of *
|
|---|
| 6 | // * the Geant4 Collaboration. It is provided under the terms and *
|
|---|
| 7 | // * conditions of the Geant4 Software License, included in the file *
|
|---|
| 8 | // * LICENSE and available at http://cern.ch/geant4/license . These *
|
|---|
| 9 | // * include a list of copyright holders. *
|
|---|
| 10 | // * *
|
|---|
| 11 | // * Neither the authors of this software system, nor their employing *
|
|---|
| 12 | // * institutes,nor the agencies providing financial support for this *
|
|---|
| 13 | // * work make any representation or warranty, express or implied, *
|
|---|
| 14 | // * regarding this software system or assume any liability for its *
|
|---|
| 15 | // * use. Please see the license in the file LICENSE and URL above *
|
|---|
| 16 | // * for the full disclaimer and the limitation of liability. *
|
|---|
| 17 | // * *
|
|---|
| 18 | // * This code implementation is the result of the scientific and *
|
|---|
| 19 | // * technical work of the GEANT4 collaboration. *
|
|---|
| 20 | // * By using, copying, modifying or distributing the software (or *
|
|---|
| 21 | // * any work based on the software) you agree to acknowledge its *
|
|---|
| 22 | // * use in resulting scientific publications, and indicate your *
|
|---|
| 23 | // * acceptance of all terms of the Geant4 Software license. *
|
|---|
| 24 | // ********************************************************************
|
|---|
| 25 | //
|
|---|
| 26 | //
|
|---|
| 27 | // $Id: G4BlockingList.icc,v 1.3 2006/06/29 18:30:43 gunter Exp $
|
|---|
| 28 | // GEANT4 tag $Name: geant4-09-04-beta-01 $
|
|---|
| 29 | //
|
|---|
| 30 | //
|
|---|
| 31 | // class G4BlockingList Inlined Implementation
|
|---|
| 32 | //
|
|---|
| 33 | // --------------------------------------------------------------------
|
|---|
| 34 |
|
|---|
| 35 | inline G4int G4BlockingList::Length() const
|
|---|
| 36 | {
|
|---|
| 37 | return fBlockingList.size();
|
|---|
| 38 | }
|
|---|
| 39 |
|
|---|
| 40 | inline void G4BlockingList::BlockVolume(const G4int v)
|
|---|
| 41 | {
|
|---|
| 42 | fBlockingList[v] = fBlockTagNo;
|
|---|
| 43 | }
|
|---|
| 44 |
|
|---|
| 45 | inline G4bool G4BlockingList::IsBlocked(const G4int v) const
|
|---|
| 46 | {
|
|---|
| 47 | return ( fBlockingList[v]==fBlockTagNo ) ? true : false;
|
|---|
| 48 | }
|
|---|
| 49 |
|
|---|
| 50 | inline void G4BlockingList::Reset()
|
|---|
| 51 | {
|
|---|
| 52 | if ( fBlockTagNo!=kBlockTagNoMax )
|
|---|
| 53 | {
|
|---|
| 54 | fBlockTagNo += 1;
|
|---|
| 55 | }
|
|---|
| 56 | else
|
|---|
| 57 | {
|
|---|
| 58 | FullyReset();
|
|---|
| 59 | }
|
|---|
| 60 | }
|
|---|
| 61 |
|
|---|
| 62 | inline void G4BlockingList::Enlarge(const G4int nv)
|
|---|
| 63 | {
|
|---|
| 64 | G4int len=fBlockingList.size();
|
|---|
| 65 | if ( len<nv )
|
|---|
| 66 | {
|
|---|
| 67 | G4int newlen = (nv/fStride+1)*fStride;
|
|---|
| 68 | fBlockingList.resize(newlen);
|
|---|
| 69 | for (G4int i=len; i<newlen; i++)
|
|---|
| 70 | {
|
|---|
| 71 | fBlockingList[i] = 0;
|
|---|
| 72 | }
|
|---|
| 73 | }
|
|---|
| 74 | }
|
|---|
