10 unsigned nhits1 = hits1.size();
11 unsigned nhits2 = hits2.size();
13 for (
unsigned i1 = 0;
i1 < nhits1; ++
i1) {
17 std::cout <<
" Discarding " << hits1[
i1].first <<
" with " << hits1[
i1].second << std::endl;
20 for (
unsigned i2 = 0;
i2 < nhits2; ++
i2) {
24 std::cout <<
" Discarding " << hits2[
i2].first <<
" with " << hits2[
i2].second << std::endl;
29 std::cout <<
" Matching hits " << hits1[
i1].first <<
" with " << hits1[
i1].second <<
" and " 31 std::cout <<
" with " << hits2[
i2].second << std::endl;
44 if (pfclusassoc.
contains(caloclus->id())) {
47 if (pfclus.
id() == pfclustest.
id() && pfclus.
key() == pfclustest.
key())
55 const std::vector<const reco::SuperCluster *> &sc,
59 unsigned nsc = sc.size();
61 for (
unsigned isc = 0; isc < nsc; ++isc) {
69 const std::vector<reco::SuperClusterRef> &sc,
73 unsigned nsc = sc.size();
75 for (
unsigned isc = 0; isc < nsc; ++isc) {
83 const std::vector<reco::SuperClusterRef> &sc,
86 unsigned nsc = sc.size();
88 for (
unsigned isc = 0; isc < nsc; ++isc) {
89 if (
overlap(pfc, *sc[isc], pfclusassoc))
static bool overlap(const reco::CaloCluster &sc1, const reco::CaloCluster &sc, float minfrac=0.01, bool debug=false)
const std::vector< std::pair< DetId, float > > & hitsAndFractions() const
ProductID id() const
Accessor for product ID.
ProductID id() const
Accessor for product ID.
Particle flow cluster, see clustering algorithm in PFClusterAlgo.
CaloCluster_iterator clustersBegin() const
fist iterator over BasicCluster constituents
key_type key() const
Accessor for product key.
CaloCluster_iterator clustersEnd() const
last iterator over BasicCluster constituents
U second(std::pair< T, U > const &p)
static int checkOverlap(const reco::PFCluster &pfc, const std::vector< const reco::SuperCluster *> &sc, float minfrac=0.01, bool debug=false)
bool contains(ProductID id) const