ecal::TemplatedClusterFinder< WeightClass > Class Template Reference

Public Member Functions
void	add (const ldmx::EcalHit &eh)
void	cluster (double seed_threshold, double cutoff)
double	getYMax () const
int	getNSeeds () const
int	getNLoops () const
std::map< int, double >	getWeights () const
std::vector< IntermediateCluster >	getClusters () const

Static Public Member Functions
static bool	compClusters (const IntermediateCluster &a, const IntermediateCluster &b)

Private Attributes
WeightClass	wgt_
double	finalwgt_
int	nseeds_
int	loops_
std::map< int, double >	transition_weights_
std::vector< IntermediateCluster >	clusters_
std::vector< IntermediateCluster >	final_clusters_

Detailed Description

template<class WeightClass>
class ecal::TemplatedClusterFinder< WeightClass >

Definition at line 20 of file TemplatedClusterFinder.h.

Member Function Documentation

add()

template<class WeightClass >

void ecal::TemplatedClusterFinder< WeightClass >::add ( const ldmx::EcalHit & eh )

inline

Definition at line 22 of file TemplatedClusterFinder.h.

                                  {
    clusters_.push_back(IntermediateCluster(eh));
  }

cluster()

template<class WeightClass >

void ecal::TemplatedClusterFinder< WeightClass >::cluster ( double seed_threshold, double cutoff )

inline

Definition at line 31 of file TemplatedClusterFinder.h.

                                                     {
    int ncluster = clusters_.size();
    double minwgt = cutoff;
    // Sort after highest energy
    std::sort(clusters_.begin(), clusters_.end(), compClusters);
    loops_ = 0;
    do {
      bool any = false;
      size_t mi(0), mj(0);
 
      int nseeds = 0;
 
      for (size_t i = 0; i < clusters_.size(); i++) {
        if (clusters_[i].empty()) continue;
 
        bool iseed = (clusters_[i].centroid().E() >= seed_threshold);
        if (iseed) {
          nseeds++;
        } else {
          // Since we sorted initially if we find a hit below seed threshold
          // it is guaranteed that there will be no seeds after.
          break;
        }
 
        for (size_t j = i + 1; j < clusters_.size(); j++) {
          if (clusters_[j].empty() ||
              (!iseed && clusters_[j].centroid().E() <
                             seed_threshold))  // this never happens
            continue;
          double wgt = wgt_(clusters_[i], clusters_[j]);
          if (!any || wgt < minwgt) {
            any = true;
            minwgt = wgt;
            mi = i;
            mj = j;
          }
        }
      }
 
      nseeds_ = nseeds;
      transition_weights_.insert(std::pair<int, double>(ncluster, minwgt));
 
      if (any && minwgt < cutoff) {
        // put the bigger one in mi
        if (clusters_[mi].centroid().E() < clusters_[mj].centroid().E()) {
          std::swap(mi, mj);
        }
        // now we have the smallest, merge
        clusters_[mi].add(clusters_[mj]);
        clusters_[mj].clear();
        // decrement cluster count
        ncluster--;
      }
      loops_++;
    } while (minwgt < cutoff && ncluster > 1);
    finalwgt_ = minwgt;
    for (const auto& cl : clusters_) {
      if (!cl.empty() && cl.centroid().E() >= seed_threshold)
        final_clusters_.push_back(cl);
      else if (cl.centroid().E() < seed_threshold)
        break;  // clusters are sorted, so should be safe to break
    }
  }

compClusters()

template<class WeightClass >

static bool ecal::TemplatedClusterFinder< WeightClass >::compClusters ( const IntermediateCluster & a, const IntermediateCluster & b )

inlinestatic

Definition at line 26 of file TemplatedClusterFinder.h.

                                                         {
    return a.centroid().E() > b.centroid().E();
  }

getClusters()

template<class WeightClass >

std::vector< IntermediateCluster > ecal::TemplatedClusterFinder< WeightClass >::getClusters ( ) const

inline

Definition at line 103 of file TemplatedClusterFinder.h.

                                                     {
    return final_clusters_;
  }

getNLoops()

template<class WeightClass >

int ecal::TemplatedClusterFinder< WeightClass >::getNLoops ( ) const

inline

Definition at line 99 of file TemplatedClusterFinder.h.

{ return loops_; }

getNSeeds()

template<class WeightClass >

int ecal::TemplatedClusterFinder< WeightClass >::getNSeeds ( ) const

inline

Definition at line 97 of file TemplatedClusterFinder.h.

{ return nseeds_; }

getWeights()

template<class WeightClass >

std::map< int, double > ecal::TemplatedClusterFinder< WeightClass >::getWeights ( ) const

inline

Definition at line 101 of file TemplatedClusterFinder.h.

{ return transition_weights_; }

getYMax()

template<class WeightClass >

double ecal::TemplatedClusterFinder< WeightClass >::getYMax ( ) const

inline

Definition at line 95 of file TemplatedClusterFinder.h.

{ return finalwgt_; }

Member Data Documentation

clusters_

template<class WeightClass >

std::vector<IntermediateCluster> ecal::TemplatedClusterFinder< WeightClass >::clusters_

private

Definition at line 113 of file TemplatedClusterFinder.h.

final_clusters_

template<class WeightClass >

std::vector<IntermediateCluster> ecal::TemplatedClusterFinder< WeightClass >::final_clusters_

private

Definition at line 114 of file TemplatedClusterFinder.h.

finalwgt_

template<class WeightClass >

double ecal::TemplatedClusterFinder< WeightClass >::finalwgt_

private

Definition at line 109 of file TemplatedClusterFinder.h.

loops_

template<class WeightClass >

int ecal::TemplatedClusterFinder< WeightClass >::loops_

private

Definition at line 111 of file TemplatedClusterFinder.h.

nseeds_

template<class WeightClass >

int ecal::TemplatedClusterFinder< WeightClass >::nseeds_

private

Definition at line 110 of file TemplatedClusterFinder.h.

transition_weights_

template<class WeightClass >

std::map<int, double> ecal::TemplatedClusterFinder< WeightClass >::transition_weights_

private

Definition at line 112 of file TemplatedClusterFinder.h.

wgt_

template<class WeightClass >

WeightClass ecal::TemplatedClusterFinder< WeightClass >::wgt_

private

Definition at line 108 of file TemplatedClusterFinder.h.

---

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

• Ecal/include/Ecal/TemplatedClusterFinder.h