21 <<
": input segments in '" <<
m_segmentKey.key() <<
"' = " << segments->
size());
24 std::vector<SegmentEdgeScore> scores{};
25 std::vector<std::vector<unsigned>> ids{};
28 <<
": built graph with nodes=" << graph.
nNodes <<
", edges=" << graph.
nEdges);
31 if (!scores.empty()) {
32 float minProb = std::numeric_limits<float>::max();
33 float maxProb = std::numeric_limits<float>::lowest();
35 minProb = std::min(minProb, s.probability);
36 maxProb = std::max(maxProb, s.probability);
39 <<
": edge scores=" << scores.size()
40 <<
", prob range=[" << minProb <<
", " << maxProb <<
"]");
42 ATH_MSG_DEBUG(
"Event " << ctx.eventID().event_number() <<
": no edge scores produced");
46 std::size_t nonEmptyCandidates = 0;
47 std::size_t maxCandidateList = 0;
48 for (
const auto& segIds : ids) {
49 if (!segIds.empty()) ++nonEmptyCandidates;
50 maxCandidateList = std::max(maxCandidateList, segIds.size());
53 <<
": decorated segments=" << ids.size()
54 <<
", non-empty candidate lists=" << nonEmptyCandidates
55 <<
", max candidates/segment=" << maxCandidateList);
60 if (!segments->
empty()) {
61 decor(*(*segments)[0]) = {};
63 for (std::size_t i = 0; i < graph.
segments.size(); ++i) {
66 return StatusCode::SUCCESS;