19 ATH_MSG_FATAL(
"ERROR! No Module Map provided. Please provide a valid path to a ROOT file.");
20 return StatusCode::FAILURE;
27 return StatusCode::SUCCESS;
39 return StatusCode::SUCCESS;
45 std::unique_ptr<TTree>
tree(
static_cast<TTree*
>(
file->Get(
"TreeModuleDoublet")));
47 unsigned int mid1_value = 0;
48 unsigned int mid2_value = 0;
49 float z0min_12_value = 0.0;
50 float dphimin_12_value = 0.0;
51 float phislopemin_12_value = 0.0;
52 float detamin_12_value = 0.0;
53 float z0max_12_value = 0.0;
54 float dphimax_12_value = 0.0;
55 float phislopemax_12_value = 0.0;
56 float detamax_12_value = 0.0;
58 tree->SetBranchAddress(
"Module1", &mid1_value);
59 tree->SetBranchAddress(
"Module2", &mid2_value);
60 tree->SetBranchAddress(
"z0min_12", &z0min_12_value);
61 tree->SetBranchAddress(
"dphimin_12", &dphimin_12_value);
62 tree->SetBranchAddress(
"phiSlopemin_12", &phislopemin_12_value);
63 tree->SetBranchAddress(
"detamin_12", &detamin_12_value);
64 tree->SetBranchAddress(
"z0max_12", &z0max_12_value);
65 tree->SetBranchAddress(
"dphimax_12", &dphimax_12_value);
66 tree->SetBranchAddress(
"phiSlopemax_12", &phislopemax_12_value);
67 tree->SetBranchAddress(
"detamax_12", &detamax_12_value);
72 m_mid1.emplace_back(mid1_value);
73 m_mid2.emplace_back(mid2_value);
102 for (
size_t i = 0;
i <
m_mid2.size();
i++) {
103 std::vector<std::shared_ptr<FPGATrackSimGNNHit>> hit1_matches;
104 std::vector<std::shared_ptr<FPGATrackSimGNNHit>> hit2_matches;
106 std::vector<int> hit1_indices;
107 std::vector<int> hit2_indices;
109 for (
size_t j = 0; j <
hits.size(); j++) {
111 hit1_matches.emplace_back(
hits[j]);
112 hit1_indices.emplace_back(j);
115 hit2_matches.emplace_back(
hits[j]);
116 hit2_indices.emplace_back(j);
120 for (
size_t h1 = 0;
h1 < hit1_matches.size();
h1++) {
121 for (
size_t h2 = 0; h2 < hit2_matches.size(); h2++) {
138 float dz = hit2->
getZ() - hit1->
getZ();
148 float phislope =
dr==0. ? 0. : dphi /
dr;
152 std::shared_ptr<FPGATrackSimGNNEdge> edge = std::make_shared<FPGATrackSimGNNEdge>();
161 edges.emplace_back(edge);
188 if(feature < 0.0) {
return -1.0; }
189 else if(feature > 0.0) {
return 1.0; }