G4CascadeCoalescence Class Reference

#include <G4CascadeCoalescence.hh>

Collaboration diagram for G4CascadeCoalescence:

Public Member Functions
	G4CascadeCoalescence (G4int verbose=0)
virtual	~G4CascadeCoalescence ()
void	FindClusters (G4CollisionOutput &finalState)
void	setVerboseLevel (G4int verbose)

Private Types
typedef std::vector< size_t >	ClusterCandidate

Private Member Functions
void	selectCandidates ()
void	createNuclei ()
void	removeNucleons ()
void	tryClusters (size_t idx1, size_t idx2)
void	tryClusters (size_t idx1, size_t idx2, size_t idx3)
void	tryClusters (size_t idx1, size_t idx2, size_t idx3, size_t idx4)
void	fillCluster (size_t idx1, size_t idx2)
void	fillCluster (size_t idx1, size_t idx2, size_t idx3)
void	fillCluster (size_t idx1, size_t idx2, size_t idx3, size_t idx4)
size_t	clusterHash (const ClusterCandidate &clus) const
bool	clusterTried (const ClusterCandidate &clus) const
bool	nucleonUsed (size_t idx) const
bool	allNucleons (const ClusterCandidate &clus) const
bool	goodCluster (const ClusterCandidate &clus) const
G4int	clusterType (const ClusterCandidate &aCluster) const
const G4InuclElementaryParticle &	getHadron (size_t idx) const
bool	makeLightIon (const ClusterCandidate &aCluster)
G4LorentzVector	getClusterMomentum (const ClusterCandidate &aCluster) const
G4double	maxDeltaP (const ClusterCandidate &aCluster) const
void	reportArgs (const G4String &name, const ClusterCandidate &clus) const
void	reportResult (const G4String &name, const G4InuclNuclei &nucl) const

Private Attributes
G4int	verboseLevel
std::vector< ClusterCandidate >	allClusters
std::set< size_t >	triedClusters
std::set< size_t >	usedNucleons
G4CollisionOutput *	thisFinalState
const std::vector< G4InuclElementaryParticle > *	thisHadrons
ClusterCandidate	thisCluster
G4InuclNuclei	thisLightIon
const G4double	dpMaxDoublet
const G4double	dpMaxTriplet
const G4double	dpMaxAlpha
G4LorentzVector	pCluster

Detailed Description

Definition at line 51 of file G4CascadeCoalescence.hh.

Member Typedef Documentation

ClusterCandidate

typedef std::vector<size_t> G4CascadeCoalescence::ClusterCandidate

private

Definition at line 62 of file G4CascadeCoalescence.hh.

Constructor & Destructor Documentation

G4CascadeCoalescence()

G4CascadeCoalescence::G4CascadeCoalescence

(

G4int

verbose = 0

)

Definition at line 70 of file G4CascadeCoalescence.cc.

  : verboseLevel(verbose), thisFinalState(0), thisHadrons(0),
    dpMaxDoublet(G4CascadeParameters::dpMaxDoublet()),
    dpMaxTriplet(G4CascadeParameters::dpMaxTriplet()),
    dpMaxAlpha(G4CascadeParameters::dpMaxAlpha()) {}

~G4CascadeCoalescence()

G4CascadeCoalescence::~G4CascadeCoalescence ( )

virtual

Definition at line 76 of file G4CascadeCoalescence.cc.

{}

Member Function Documentation

allNucleons()

bool G4CascadeCoalescence::allNucleons ( const ClusterCandidate &  clus ) const

private

Definition at line 335 of file G4CascadeCoalescence.cc.

                                                                         {
  bool result = true;
  for (size_t i=0; i<clus.size(); i++)
    result &= getHadron(clus[0]).nucleon();
  return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

clusterHash()

size_t G4CascadeCoalescence::clusterHash ( const ClusterCandidate &  clus ) const

private

Definition at line 297 of file G4CascadeCoalescence.cc.

                                                    {
  G4int hash = 0;
  for (size_t i=0; i<aCluster.size(); i++) {
    hash = hash*1000 + aCluster[i]; // FIXME:  Use hadron list size instead?
  }

  return hash;
}

Here is the call graph for this function:

Here is the caller graph for this function:

clusterTried()

bool G4CascadeCoalescence::clusterTried ( const ClusterCandidate &  clus ) const

inlineprivate

Definition at line 99 of file G4CascadeCoalescence.hh.

                                                        {
    return triedClusters.find(clusterHash(clus)) != triedClusters.end();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

clusterType()

G4int G4CascadeCoalescence::clusterType ( const ClusterCandidate &  aCluster ) const

private

Definition at line 284 of file G4CascadeCoalescence.cc.

                                                    {
  G4int type = 0;
  for (size_t i=0; i<aCluster.size(); i++) {
    const G4InuclElementaryParticle& had = getHadron(aCluster[i]);
    type += had.nucleon() ? had.type() : 0;
  }

  return type;
}

Here is the call graph for this function:

Here is the caller graph for this function:

createNuclei()

void G4CascadeCoalescence::createNuclei ( )

private

Definition at line 215 of file G4CascadeCoalescence.cc.

                                        {
  if (verboseLevel)
    G4cout << " >>> G4CascadeCoalescence::createNuclei()" << G4endl;

  usedNucleons.clear();

  for (size_t i=0; i<allClusters.size(); i++) {
    if (verboseLevel>1) G4cout << " attempting candidate #" << i << G4endl;

    const ClusterCandidate& cand = allClusters[i];
    if (makeLightIon(cand)) {           // Success, put ion in output
      thisFinalState->addOutgoingNucleus(thisLightIon);
      usedNucleons.insert(cand.begin(), cand.end());
    }
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

fillCluster() [1/3]

void G4CascadeCoalescence::fillCluster ( size_t  idx1, size_t  idx2  )

private

Definition at line 309 of file G4CascadeCoalescence.cc.

                                                               {
  thisCluster.clear();
  thisCluster.push_back(idx1);
  thisCluster.push_back(idx2);
}

Here is the caller graph for this function:

fillCluster() [2/3]

void G4CascadeCoalescence::fillCluster ( size_t  idx1, size_t  idx2, size_t  idx3  )

private

Definition at line 315 of file G4CascadeCoalescence.cc.

                                                                            {
  thisCluster.clear();
  thisCluster.push_back(idx1);
  thisCluster.push_back(idx2);
  thisCluster.push_back(idx3);
}

fillCluster() [3/3]

void G4CascadeCoalescence::fillCluster ( size_t  idx1, size_t  idx2, size_t  idx3, size_t  idx4  )

private

Definition at line 322 of file G4CascadeCoalescence.cc.

                                   {
  thisCluster.clear();
  thisCluster.push_back(idx1);
  thisCluster.push_back(idx2);
  thisCluster.push_back(idx3);
  thisCluster.push_back(idx4);
}

FindClusters()

void G4CascadeCoalescence::FindClusters

(

G4CollisionOutput &

finalState

)

Definition at line 81 of file G4CascadeCoalescence.cc.

                                                                     {
  if (verboseLevel)
    G4cout << " >>> G4CascadeCoalescence::FindClusters()" << G4endl;

  thisFinalState = &finalState;     // Save pointers for use in processing
  thisHadrons = &finalState.getOutgoingParticles();

  if (verboseLevel>1) thisFinalState->printCollisionOutput();   // Before

  selectCandidates();
  createNuclei();
  removeNucleons();

  if (verboseLevel>1) thisFinalState->printCollisionOutput();   // After
}

Here is the call graph for this function:

Here is the caller graph for this function:

getClusterMomentum()

G4LorentzVector G4CascadeCoalescence::getClusterMomentum ( const ClusterCandidate &  aCluster ) const

private

Definition at line 251 of file G4CascadeCoalescence.cc.

                                                                               {
  pCluster.set(0.,0.,0.,0.);
  for (size_t i=0; i<aCluster.size(); i++)
    pCluster += getHadron(aCluster[i]).getMomentum();

  return pCluster;
}

Here is the call graph for this function:

Here is the caller graph for this function:

getHadron()

const G4InuclElementaryParticle& G4CascadeCoalescence::getHadron ( size_t  idx ) const

inlineprivate

Definition at line 114 of file G4CascadeCoalescence.hh.

                                                               {
    return (*thisHadrons)[idx];
  }

Here is the call graph for this function:

Here is the caller graph for this function:

goodCluster()

bool G4CascadeCoalescence::goodCluster ( const ClusterCandidate &  clus ) const

private

Definition at line 345 of file G4CascadeCoalescence.cc.

                                                                         {
  if (verboseLevel>2) reportArgs("goodCluster?",clus);

  if (!allNucleons(clus)) return false;

  if (clus.size() == 2)                 // Deuterons (pn)
    return (clusterType(clus) == 3 && maxDeltaP(clus) < dpMaxDoublet);

  if (clus.size() == 3)                 // Tritons or He-3
    return ((clusterType(clus) == 4 || clusterType(clus) == 5)  // ppn OR pnn
        && maxDeltaP(clus) < dpMaxTriplet);

  if (clus.size() == 4)                 // Alphas (ppnn)
    return (clusterType(clus) == 6 && maxDeltaP(clus) < dpMaxAlpha);

  return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

makeLightIon()

bool G4CascadeCoalescence::makeLightIon ( const ClusterCandidate &  aCluster )

private

Definition at line 367 of file G4CascadeCoalescence.cc.

                                                                        {
  if (verboseLevel>1) reportArgs("makeLightIon",aCluster);

  thisLightIon.clear();     // Initialize nucleus buffer before filling

  if (aCluster.size()<2) return false;      // Sanity check

  G4int A = aCluster.size();
  G4int Z = -1;

  G4int type = clusterType(aCluster);
  if (A==2 && type==3) Z = 1;       // Deuteron (pn)
  if (A==3 && type==5) Z = 1;       // Triton (pnn)
  if (A==3 && type==4) Z = 2;       // He-3 (ppn)
  if (A==4 && type==6) Z = 2;       // He-4/alpha (ppnn)

  if (Z < 0) return false;      // Invalid cluster content

  // NOTE:  Four-momentum will not be conserved due to binding energy
  thisLightIon.fill(getClusterMomentum(aCluster), A, Z, 0.,
            G4InuclParticle::Coalescence);

  if (verboseLevel>1) reportResult("makeLightIon output",thisLightIon);
  return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

maxDeltaP()

G4double G4CascadeCoalescence::maxDeltaP ( const ClusterCandidate &  aCluster ) const

private

Definition at line 262 of file G4CascadeCoalescence.cc.

                                                                               {
  if (verboseLevel>1) reportArgs("maxDeltaP", aCluster);

  G4ThreeVector boost = getClusterMomentum(aCluster).boostVector();

  G4double dp, maxDP = -1.;
  for (size_t i=0; i<aCluster.size(); i++) {
    const G4InuclElementaryParticle& nucl = getHadron(aCluster[i]);

    // NOTE:  getMomentum() returns by value, event kinematics are not changed
    if ((dp = nucl.getMomentum().boost(-boost).rho()) > maxDP) maxDP = dp;
  }

  if (verboseLevel>1) G4cout << " maxDP = " << maxDP << G4endl;

  return maxDP;
}

Here is the call graph for this function:

Here is the caller graph for this function:

nucleonUsed()

bool G4CascadeCoalescence::nucleonUsed ( size_t  idx ) const

inlineprivate

Definition at line 104 of file G4CascadeCoalescence.hh.

                                     {
    return usedNucleons.find(idx) != usedNucleons.end();
  }

Here is the call graph for this function:

Here is the caller graph for this function:

removeNucleons()

void G4CascadeCoalescence::removeNucleons ( )

private

Definition at line 235 of file G4CascadeCoalescence.cc.

                                          {
  if (verboseLevel>1)
    G4cout << " >>> G4CascadeCoalescence::removeNucleons()" << G4endl;

  // Remove nucleons from output from last to first (to preserve indexing)
  std::set<size_t>::reverse_iterator usedIter;
  for (usedIter = usedNucleons.rbegin(); usedIter != usedNucleons.rend(); ++usedIter)
    thisFinalState->removeOutgoingParticle(*usedIter);

  usedNucleons.clear();
}

Here is the call graph for this function:

Here is the caller graph for this function:

reportArgs()

void G4CascadeCoalescence::reportArgs ( const G4String &  name, const ClusterCandidate &  clus  ) const

private

Definition at line 396 of file G4CascadeCoalescence.cc.

                                                              {
  G4cout << " >>> G4CascadeCoalescence::" << name << " ";
  std::copy(aCluster.begin(), aCluster.end(),
        std::ostream_iterator<size_t>(G4cout, " "));
  G4cout << G4endl;

  if (verboseLevel>2) {
    for (size_t i=0; i<aCluster.size(); i++)
      G4cout << getHadron(aCluster[i]) << G4endl;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

reportResult()

void G4CascadeCoalescence::reportResult ( const G4String &  name, const G4InuclNuclei &  nucl  ) const

private

Definition at line 409 of file G4CascadeCoalescence.cc.

                                                     {
  G4cout << " >>> G4CascadeCoalescence::" << name << G4endl << nucl << G4endl;
}

Here is the caller graph for this function:

selectCandidates()

void G4CascadeCoalescence::selectCandidates ( )

private

Definition at line 100 of file G4CascadeCoalescence.cc.

                                            {
  if (verboseLevel)
    G4cout << " >>> G4CascadeCoalescence::selectCandidates()" << G4endl;

  triedClusters.clear();
  allClusters.clear();
  usedNucleons.clear();

  size_t nHad = thisHadrons->size();
  for (size_t idx1=0; idx1<nHad; idx1++) {
    if (!getHadron(idx1).nucleon()) continue;
    for (size_t idx2=idx1+1; idx2<nHad; idx2++) {
      if (!getHadron(idx2).nucleon()) continue;
      for (size_t idx3=idx2+1; idx3<nHad; idx3++) {
    if (!getHadron(idx3).nucleon()) continue;
    for (size_t idx4=idx3+1; idx4<nHad; idx4++) {
      if (!getHadron(idx4).nucleon()) continue;
      tryClusters(idx1, idx2, idx3, idx4);
    }
    tryClusters(idx1, idx2, idx3);      // If idx4 loop was empty
      }
      tryClusters(idx1, idx2);          // If idx3 loop was empty
    }
  }

  // All potential candidates built; report statistics
  if (verboseLevel>1) {
    G4cout << " Found " << allClusters.size() << " candidates, using "
       << usedNucleons.size() << " nucleons" << G4endl;
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

setVerboseLevel()

void G4CascadeCoalescence::setVerboseLevel ( G4int  verbose )

inline

Definition at line 59 of file G4CascadeCoalescence.hh.

{ verboseLevel = verbose; }

Here is the caller graph for this function:

tryClusters() [1/3]

void G4CascadeCoalescence::tryClusters ( size_t  idx1, size_t  idx2  )

private

Definition at line 192 of file G4CascadeCoalescence.cc.

                                                          {
  if (nucleonUsed(idx1) || nucleonUsed(idx2)) return;

  fillCluster(idx1,idx2);
  if (clusterTried(thisCluster)) return;

  if (verboseLevel>1)
    G4cout << " >>> G4CascadeCoalescence::tryClusters " << idx1 << " " << idx2
       << G4endl;

  triedClusters.insert(clusterHash(thisCluster));  // Remember current attempt

  fillCluster(idx1,idx2);
  if (goodCluster(thisCluster)) {
    allClusters.push_back(thisCluster);
    usedNucleons.insert(idx1);
    usedNucleons.insert(idx2);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

tryClusters() [2/3]

void G4CascadeCoalescence::tryClusters ( size_t  idx1, size_t  idx2, size_t  idx3  )

private

Definition at line 165 of file G4CascadeCoalescence.cc.

                                                                       {
  fillCluster(idx1,idx2,idx3);
  if (clusterTried(thisCluster)) return;

  if (verboseLevel>1)
    G4cout << " >>> G4CascadeCoalescence::tryClusters " << idx1 << " " << idx2
       << " " << idx3 << G4endl;

  triedClusters.insert(clusterHash(thisCluster));  // Remember current attempt

  if (!nucleonUsed(idx1) && !nucleonUsed(idx2) && !nucleonUsed(idx3)) {
    fillCluster(idx1,idx2,idx3);
    if (goodCluster(thisCluster)) {
      allClusters.push_back(thisCluster);
      usedNucleons.insert(idx1);
      usedNucleons.insert(idx2);
      usedNucleons.insert(idx3);
      return;
    }
  }

  tryClusters(idx2,idx3);       // Try constituent subclusters
  tryClusters(idx1,idx3);
  tryClusters(idx1,idx2);
}

Here is the call graph for this function:

tryClusters() [3/3]

void G4CascadeCoalescence::tryClusters ( size_t  idx1, size_t  idx2, size_t  idx3, size_t  idx4  )

private

Definition at line 135 of file G4CascadeCoalescence.cc.

                                                 {
  fillCluster(idx1,idx2,idx3,idx4);
  if (clusterTried(thisCluster)) return;

  if (verboseLevel>1)
    G4cout << " >>> G4CascadeCoalescence::tryClusters " << idx1 << " " << idx2
       << " " << idx3 << " " << idx4 << G4endl;

  triedClusters.insert(clusterHash(thisCluster));  // Remember current attempt

  if (!nucleonUsed(idx1) && !nucleonUsed(idx2) &&
      !nucleonUsed(idx3) && !nucleonUsed(idx4)) {
    if (goodCluster(thisCluster)) {
      allClusters.push_back(thisCluster);
      usedNucleons.insert(idx1);
      usedNucleons.insert(idx2);
      usedNucleons.insert(idx3);
      usedNucleons.insert(idx4);
      return;
    }
  }

  tryClusters(idx2,idx3,idx4);      // Try constituent subclusters
  tryClusters(idx1,idx3,idx4);
  tryClusters(idx1,idx2,idx4);
  tryClusters(idx1,idx2,idx3);
}

Here is the call graph for this function:

Member Data Documentation

allClusters

std::vector<ClusterCandidate> G4CascadeCoalescence::allClusters

private

Definition at line 66 of file G4CascadeCoalescence.hh.

dpMaxAlpha

const G4double G4CascadeCoalescence::dpMaxAlpha

private

Definition at line 78 of file G4CascadeCoalescence.hh.

dpMaxDoublet

const G4double G4CascadeCoalescence::dpMaxDoublet

private

Definition at line 76 of file G4CascadeCoalescence.hh.

dpMaxTriplet

const G4double G4CascadeCoalescence::dpMaxTriplet

private

Definition at line 77 of file G4CascadeCoalescence.hh.

pCluster

G4LorentzVector G4CascadeCoalescence::pCluster

mutableprivate

Definition at line 123 of file G4CascadeCoalescence.hh.

thisCluster

ClusterCandidate G4CascadeCoalescence::thisCluster

private

Definition at line 73 of file G4CascadeCoalescence.hh.

thisFinalState

G4CollisionOutput* G4CascadeCoalescence::thisFinalState

private

Definition at line 70 of file G4CascadeCoalescence.hh.

thisHadrons

const std::vector<G4InuclElementaryParticle>* G4CascadeCoalescence::thisHadrons

private

Definition at line 71 of file G4CascadeCoalescence.hh.

thisLightIon

G4InuclNuclei G4CascadeCoalescence::thisLightIon

private

Definition at line 74 of file G4CascadeCoalescence.hh.

triedClusters

std::set<size_t> G4CascadeCoalescence::triedClusters

private

Definition at line 67 of file G4CascadeCoalescence.hh.

usedNucleons

std::set<size_t> G4CascadeCoalescence::usedNucleons

private

Definition at line 68 of file G4CascadeCoalescence.hh.

verboseLevel

G4int G4CascadeCoalescence::verboseLevel

private

Definition at line 64 of file G4CascadeCoalescence.hh.

---

The documentation for this class was generated from the following files:

• G4CascadeCoalescence.hh
• G4CascadeCoalescence.cc