Gabriele Cosmo
136 lines
3.2 KiB
C++
136 lines
3.2 KiB
C++
// This code implementation is the intellectual property of
|
|
// the RD44 GEANT4 collaboration.
|
|
//
|
|
// By copying, distributing or modifying the Program (or any work
|
|
// based on the Program) you indicate your acceptance of this statement,
|
|
// and all its terms.
|
|
//
|
|
// $Id: G4TrackStack.cc,v 1.1 1999/01/07 16:06:40 gunter Exp $
|
|
// GEANT4 tag $Name: geant4-00-01 $
|
|
//
|
|
//
|
|
// Last Modification : 09/Dec/96 M.Asai
|
|
//
|
|
|
|
#include "G4TrackStack.hh"
|
|
|
|
G4TrackStack::G4TrackStack()
|
|
:n_stackedTrack(0),firstStackedTrack(NULL),lastStackedTrack(NULL)
|
|
{;}
|
|
|
|
G4TrackStack::~G4TrackStack()
|
|
{;}
|
|
|
|
const G4TrackStack & G4TrackStack::operator=(const G4TrackStack &right)
|
|
{
|
|
n_stackedTrack = right.n_stackedTrack;
|
|
firstStackedTrack = right.firstStackedTrack;
|
|
lastStackedTrack = right.lastStackedTrack;
|
|
return *this;
|
|
}
|
|
|
|
int G4TrackStack::operator==(const G4TrackStack &right) const
|
|
{ return (firstStackedTrack==right.firstStackedTrack); }
|
|
int G4TrackStack::operator!=(const G4TrackStack &right) const
|
|
{ return (firstStackedTrack!=right.firstStackedTrack); }
|
|
|
|
void G4TrackStack::TransferTo(G4TrackStack * aStack)
|
|
{
|
|
if(n_stackedTrack==0) return;
|
|
|
|
if(aStack->n_stackedTrack == 0)
|
|
{
|
|
*aStack = *this;
|
|
}
|
|
else
|
|
{
|
|
aStack->lastStackedTrack->SetNext( firstStackedTrack );
|
|
firstStackedTrack->SetPrevious( aStack->lastStackedTrack );
|
|
aStack->lastStackedTrack = lastStackedTrack;
|
|
aStack->n_stackedTrack += n_stackedTrack;
|
|
}
|
|
|
|
n_stackedTrack = 0;
|
|
firstStackedTrack = NULL;
|
|
lastStackedTrack = NULL;
|
|
}
|
|
|
|
G4StackedTrack * G4TrackStack::PopFromStack()
|
|
{
|
|
if( n_stackedTrack == 0 ) return NULL;
|
|
G4StackedTrack * aStackedTrack = lastStackedTrack;
|
|
GrabFromStack( aStackedTrack );
|
|
return aStackedTrack;
|
|
}
|
|
|
|
void G4TrackStack::PushToStack( G4StackedTrack * aStackedTrack )
|
|
{
|
|
if( n_stackedTrack == 0 )
|
|
{
|
|
aStackedTrack->SetPrevious( NULL );
|
|
firstStackedTrack = aStackedTrack;
|
|
}
|
|
else
|
|
{
|
|
lastStackedTrack->SetNext( aStackedTrack );
|
|
aStackedTrack->SetPrevious( lastStackedTrack );
|
|
}
|
|
lastStackedTrack = aStackedTrack;
|
|
n_stackedTrack++;
|
|
}
|
|
|
|
void G4TrackStack::GrabFromStack( G4StackedTrack * aStackedTrack )
|
|
{
|
|
if( n_stackedTrack == 1 )
|
|
{
|
|
firstStackedTrack = NULL;
|
|
lastStackedTrack = NULL;
|
|
}
|
|
else
|
|
{
|
|
if( aStackedTrack == firstStackedTrack )
|
|
{
|
|
firstStackedTrack = aStackedTrack->GetNext();
|
|
firstStackedTrack->SetPrevious( NULL );
|
|
}
|
|
else
|
|
{
|
|
if( aStackedTrack == lastStackedTrack )
|
|
{
|
|
lastStackedTrack = aStackedTrack->GetPrevious();
|
|
lastStackedTrack->SetNext( NULL );
|
|
}
|
|
else
|
|
{
|
|
aStackedTrack->GetPrevious()
|
|
->SetNext( aStackedTrack->GetNext() );
|
|
aStackedTrack->GetNext()
|
|
->SetPrevious( aStackedTrack->GetPrevious() );
|
|
}
|
|
}
|
|
}
|
|
n_stackedTrack--;
|
|
}
|
|
|
|
void G4TrackStack::clear()
|
|
{
|
|
G4StackedTrack * aStackedTrack = firstStackedTrack;
|
|
G4StackedTrack * nextStackedTrack;
|
|
|
|
if ( n_stackedTrack == 0 ) return;
|
|
|
|
// delete tracks in the stack
|
|
while( aStackedTrack != NULL )
|
|
{
|
|
nextStackedTrack = aStackedTrack->GetNext();
|
|
delete aStackedTrack->GetTrack();
|
|
delete aStackedTrack;
|
|
aStackedTrack = nextStackedTrack;
|
|
}
|
|
n_stackedTrack = 0;
|
|
firstStackedTrack = NULL;
|
|
lastStackedTrack = NULL;
|
|
}
|
|
|
|
|