| Geant4 Cross Reference |
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 // Class description:
27 //
28 // This is a stack class used by G4StackManager. This class object
29 // stores G4StackedTrack class objects in the form of bi-directional
30 // linked list.
31
32 // Author: Makoto Asai (SLAC) - 09/Dec/96
33 // --------------------------------------------------------------------
34 #ifndef G4TrackStack_hh
35 #define G4TrackStack_hh 1
36
37 #include <vector>
38
39 #include "G4StackedTrack.hh"
40 #include "G4Types.hh"
41
42 class G4SmartTrackStack;
43
44 class G4TrackStack : public std::vector<G4StackedTrack>
45 {
46 public:
47
48 G4TrackStack() = default;
49 explicit G4TrackStack(std::size_t n)
50 : safetyValue1(G4int(4*n/5)),
51 safetyValue2(G4int(4*n/5-100)), nstick(100) { reserve(n); }
52 ~G4TrackStack();
53
54 G4TrackStack& operator=(const G4TrackStack&) = delete;
55 G4bool operator==(const G4TrackStack&) const = delete;
56 G4bool operator!=(const G4TrackStack&) const = delete;
57
58 inline void PushToStack(const G4StackedTrack& aStackedTrack)
59 {
60 push_back(aStackedTrack);
61 if(size()>maxEntry) maxEntry = size();
62 }
63 inline G4StackedTrack PopFromStack()
64 { G4StackedTrack st = back(); pop_back(); return st; }
65 void TransferTo(G4TrackStack* aStack);
66 void TransferTo(G4SmartTrackStack* aStack);
67
68 void clearAndDestroy();
69
70 inline std::size_t GetNTrack() const { return size(); }
71 inline std::size_t GetMaxNTrack() const { return maxEntry; }
72 inline G4int GetSafetyValue1() const { return safetyValue1; }
73 inline G4int GetSafetyValue2() const { return safetyValue2; }
74 inline G4int GetNStick() const { return nstick; }
75
76 G4double getTotalEnergy() const;
77 inline void SetSafetyValue2(G4int x) { safetyValue2 = x < 0 ? 0 : x; }
78
79 private:
80
81 G4int safetyValue1{0};
82 G4int safetyValue2{0};
83 G4int nstick{0};
84 std::size_t maxEntry{0};
85 };
86
87 #endif
88