| [816] | 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: G4StackedTrack.hh,v 1.10 2006/06/29 18:09:09 gunter Exp $
|
|---|
| [1228] | 28 | // GEANT4 tag $Name: geant4-09-03 $
|
|---|
| [816] | 29 | //
|
|---|
| 30 | //
|
|---|
| 31 | // Last Modification : 02/Feb/96 M.Asai
|
|---|
| 32 | //
|
|---|
| 33 |
|
|---|
| 34 |
|
|---|
| 35 | #ifndef G4StackedTrack_h
|
|---|
| 36 | #define G4StackedTrack_h 1
|
|---|
| 37 |
|
|---|
| 38 | #include "G4Track.hh"
|
|---|
| 39 | #include "globals.hh"
|
|---|
| 40 | #include "G4Allocator.hh"
|
|---|
| 41 | class G4VTrajectory;
|
|---|
| 42 |
|
|---|
| 43 | // class description:
|
|---|
| 44 | //
|
|---|
| 45 | // This class is exclusively used by G4StackManager and G4TrackStack
|
|---|
| 46 | // classes for storing a G4Track object in the form of bi-directional
|
|---|
| 47 | // linked list.
|
|---|
| 48 |
|
|---|
| 49 | class G4StackedTrack
|
|---|
| 50 | {
|
|---|
| 51 | public:
|
|---|
| 52 | inline void *operator new(size_t);
|
|---|
| 53 | inline void operator delete(void *aStackedTrack);
|
|---|
| 54 |
|
|---|
| 55 | G4StackedTrack();
|
|---|
| 56 | G4StackedTrack(G4Track * aTrack, G4VTrajectory * aTrajectory = 0);
|
|---|
| 57 | ~G4StackedTrack();
|
|---|
| 58 |
|
|---|
| 59 | const G4StackedTrack & operator=(const G4StackedTrack &right);
|
|---|
| 60 | G4int operator==(const G4StackedTrack &right) const;
|
|---|
| 61 | G4int operator!=(const G4StackedTrack &right) const;
|
|---|
| 62 |
|
|---|
| 63 | private:
|
|---|
| 64 | G4double priorityWeight;
|
|---|
| 65 | G4Track * track;
|
|---|
| 66 | G4VTrajectory * trajectory;
|
|---|
| 67 | G4StackedTrack * previousStackedTrack;
|
|---|
| 68 | G4StackedTrack * nextStackedTrack;
|
|---|
| 69 |
|
|---|
| 70 | public:
|
|---|
| 71 | inline G4double GetPriorityWeight() const
|
|---|
| 72 | { return priorityWeight; }
|
|---|
| 73 | inline void SetPriorityWeight(const G4double value)
|
|---|
| 74 | { priorityWeight = value; }
|
|---|
| 75 | inline G4Track * GetTrack() const
|
|---|
| 76 | { return track; }
|
|---|
| 77 | inline G4VTrajectory * GetTrajectory() const
|
|---|
| 78 | { return trajectory; }
|
|---|
| 79 | inline G4StackedTrack * GetPrevious() const
|
|---|
| 80 | { return previousStackedTrack; }
|
|---|
| 81 | inline G4StackedTrack * GetNext() const
|
|---|
| 82 | { return nextStackedTrack; }
|
|---|
| 83 | inline void SetPrevious(G4StackedTrack * value)
|
|---|
| 84 | { previousStackedTrack = value; }
|
|---|
| 85 | inline void SetNext(G4StackedTrack * value)
|
|---|
| 86 | { nextStackedTrack = value; }
|
|---|
| 87 | };
|
|---|
| 88 |
|
|---|
| 89 | #if defined G4EVENT_ALLOC_EXPORT
|
|---|
| 90 | extern G4DLLEXPORT G4Allocator<G4StackedTrack> aStackedTrackAllocator;
|
|---|
| 91 | #else
|
|---|
| 92 | extern G4DLLIMPORT G4Allocator<G4StackedTrack> aStackedTrackAllocator;
|
|---|
| 93 | #endif
|
|---|
| 94 |
|
|---|
| 95 | inline void * G4StackedTrack::operator new(size_t)
|
|---|
| 96 | {
|
|---|
| 97 | void * aStackedTrack;
|
|---|
| 98 | aStackedTrack = (void *) aStackedTrackAllocator.MallocSingle();
|
|---|
| 99 | return aStackedTrack;
|
|---|
| 100 | }
|
|---|
| 101 |
|
|---|
| 102 | inline void G4StackedTrack::operator delete(void * aStackedTrack)
|
|---|
| 103 | {
|
|---|
| 104 | aStackedTrackAllocator.FreeSingle((G4StackedTrack *) aStackedTrack);
|
|---|
| 105 | }
|
|---|
| 106 |
|
|---|
| 107 |
|
|---|
| 108 | #endif
|
|---|
| 109 |
|
|---|