14 std::vector<std::pair<DetId, float> > hitsAndFracs = cluster.
hitsAndFractions();
15 std::vector<std::pair<DetId, float> >::const_iterator it;
16 for (it = hitsAndFracs.begin(); it != hitsAndFracs.end(); ++it) {
17 DetId id = (*it).first;
21 <<
"The cluster DetId " <<
id.rawId() <<
" is not in the recHit collection!!";
42 if (closestProb.
null())
46 std::vector<DetId>::const_iterator itn;
48 std::vector<std::pair<DetId, float> > hitsAndFracs = cluster.
hitsAndFractions();
49 std::vector<std::pair<DetId, float> >::const_iterator it;
53 for (itn = neighbours.begin(); itn != neighbours.end(); ++itn) {
55 for (it = hitsAndFracs.begin(); it != hitsAndFracs.end(); ++it) {
56 DetId id = (*it).first;
63 <<
"The cluster DetId " <<
id.rawId() <<
" is not in the recHit collection!!";
81 edm::LogError(
"EcalClusterSeverityLevelAlgo") <<
"The cluster seed is not in the BARREL";
90 for (std::vector<DetId>::const_iterator it = neighbours.begin(); it != neighbours.end(); ++it) {
102 double r =
sqrt(deta * deta + dphi * dphi);
118 edm::LogError(
"EcalClusterSeverityLevelAlgo") <<
"The cluster seed is not in the BARREL";
120 return std::pair<int, int>(-1, -1);
125 if (!closestProb.
null())
129 return std::pair<int, int>(-1, -1);