#include <EmcRecSeedLocalMax.h>
◆ EmcRecSeedLocalMax() [1/3]
| EmcRecSeedLocalMax::EmcRecSeedLocalMax |
( |
| ) |
|
◆ ~EmcRecSeedLocalMax() [1/3]
| EmcRecSeedLocalMax::~EmcRecSeedLocalMax |
( |
| ) |
|
◆ EmcRecSeedLocalMax() [2/3]
| EmcRecSeedLocalMax::EmcRecSeedLocalMax |
( |
| ) |
|
◆ ~EmcRecSeedLocalMax() [2/3]
| EmcRecSeedLocalMax::~EmcRecSeedLocalMax |
( |
| ) |
|
◆ EmcRecSeedLocalMax() [3/3]
| EmcRecSeedLocalMax::EmcRecSeedLocalMax |
( |
| ) |
|
◆ ~EmcRecSeedLocalMax() [3/3]
| EmcRecSeedLocalMax::~EmcRecSeedLocalMax |
( |
| ) |
|
◆ Seed() [1/3]
Implements EmcRecSeedAbs.
Definition at line 15 of file EmcRecSeedLocalMax.cxx.
15 {
16 RecEmcHitMap::const_iterator ciHitMap;
17 RecEmcHitMap::const_iterator ciNeigh;
18 RecEmcHit aHit;
19
21
23 RecEmcIDVector::const_iterator ciNeighVec;
24
25 aMaxVec.clear();
26
27 EmcRecNeighbor nhb;
28
29 for ( ciHitMap = aCluster.
Begin(); ciHitMap != aCluster.
End(); ++ciHitMap )
30 {
31
32
34 aHit = ciHitMap->second;
35
36 NeighVec.clear();
38
39
40 for ( ciNeighVec = NeighVec.begin(); ciNeighVec != NeighVec.end(); ++ciNeighVec )
41 {
42
43 ciNeigh = aCluster.
Find( *ciNeighVec );
44 if ( ciNeigh != aCluster.
End() )
45 {
46
47 if ( ciNeigh->second.getEnergy() >= aHit.
getEnergy() ) {
max =
false; }
48 }
49 }
50
51
52 if (
max ==
true ) { aMaxVec.push_back( aHit.
getCellId() ); }
53
54 }
55}
vector< RecEmcID > RecEmcIDVector
RecEmcIDVector GetNeighbors(const Identifier &id)
RecEmcHitMap::const_iterator Find(const RecEmcID &CellId) const
RecEmcHitMap::const_iterator Begin() const
RecEmcHitMap::const_iterator End() const
RecEmcEnergy getEnergy() const
RecEmcID getCellId() const
◆ Seed() [2/3]
◆ Seed() [3/3]
The documentation for this class was generated from the following files: