hgcal_clustering Namespace Reference

Typedefs
typedef std::map< DetId, float >	Density

Functions
template<typename T >
size_t	max_index (const std::vector< T > &v)
template<typename T >
std::vector< size_t >	sorted_indices (const std::vector< T > &v)

Typedef Documentation

Density

typedef std::map<DetId, float> hgcal_clustering::Density

Definition at line 44 of file HGCalClusteringAlgoBase.h.

Function Documentation

max_index()

template<typename T >

size_t hgcal_clustering::max_index

(

const std::vector< T > &

v

)

Definition at line 31 of file HGCalClusteringAlgoBase.h.

References testProducerWithPsetDescEmpty_cfi::i1, testProducerWithPsetDescEmpty_cfi::i2, heavyIonCSV_trainingSettings::idx, and findQualityFiles::v.

Referenced by CSCXonStrip_MatchGatti::findXOnStrip(), HGCalImagingAlgo::getClusters(), l1tVertexFinder::VertexFinder::NNVtxEmulation(), and TICLCandidateFromTrackstersProducer::produce().

                                          {
    // initialize original index locations
    std::vector<size_t> idx(v.size(), 0);
    std::iota(std::begin(idx), std::end(idx), 0);

    // take the max index based on comparing values in v
    auto maxidx = std::max_element(
        idx.begin(), idx.end(), [&v](size_t i1, size_t i2) { return v[i1].data.rho < v[i2].data.rho; });

    return (*maxidx);
  }

sorted_indices()

template<typename T >

std::vector<size_t> hgcal_clustering::sorted_indices

(

const std::vector< T > &

v

)

Definition at line 19 of file HGCalClusteringAlgoBase.h.

References testProducerWithPsetDescEmpty_cfi::i1, testProducerWithPsetDescEmpty_cfi::i2, heavyIonCSV_trainingSettings::idx, jetUpdater_cfi::sort, and findQualityFiles::v.

Referenced by HGCalImagingAlgo::calculateDistanceToHigher(), HGCalImagingAlgo::findAndAssignClusters(), HGCalDepthPreClusterer::makePreClusters(), and HGCal3DClustering::organizeByLayer().

                                                          {
    // initialize original index locations
    std::vector<size_t> idx(v.size());
    std::iota(std::begin(idx), std::end(idx), 0);

    // sort indices based on comparing values in v
    std::sort(idx.begin(), idx.end(), [&v](size_t i1, size_t i2) { return v[i1] > v[i2]; });

    return idx;
  }