#include <GNN_DataStorage.h>
Definition at line 41 of file GNN_DataStorage.h.
◆ TrigFTF_GNN_EtaBin()
| TrigFTF_GNN_EtaBin::TrigFTF_GNN_EtaBin |
( |
| ) |
|
Definition at line 15 of file GNN_DataStorage.cxx.
16
21}
std::vector< const TrigFTF_GNN_Node * > m_vn
std::vector< std::vector< unsigned int > > m_in
std::vector< std::array< float, 5 > > m_params
◆ ~TrigFTF_GNN_EtaBin()
| TrigFTF_GNN_EtaBin::~TrigFTF_GNN_EtaBin |
( |
| ) |
|
◆ empty()
| bool TrigFTF_GNN_EtaBin::empty |
( |
| ) |
const |
|
inline |
◆ generatePhiIndexing()
| void TrigFTF_GNN_EtaBin::generatePhiIndexing |
( |
float | dphi | ) |
|
Definition at line 72 of file GNN_DataStorage.cxx.
72 {
73
74 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
75
79
80 }
81
82 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
85 }
86
87 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
88
92 }
93
94}
Scalar phi() const
phi method
std::vector< std::pair< float, unsigned int > > m_vPhiNodes
◆ getMaxBinRadius()
| float TrigFTF_GNN_EtaBin::getMaxBinRadius |
( |
| ) |
const |
|
inline |
◆ getMinBinRadius()
| float TrigFTF_GNN_EtaBin::getMinBinRadius |
( |
| ) |
const |
|
inline |
◆ initializeNodes()
| void TrigFTF_GNN_EtaBin::initializeNodes |
( |
| ) |
|
Definition at line 54 of file GNN_DataStorage.cxx.
54 {
55
56 if(
m_vn.empty())
return;
57
59
61 for(
auto& v :
m_in)
v.reserve(50);
62
64 [](
const TrigFTF_GNN_Node* pN) { std::array<float,5> a = {-100.0, 100.0, pN->phi(), pN->r(), pN->z()};
return a;});
65
66 auto [min_iter, max_iter] = std::minmax_element(
m_vn.begin(),
m_vn.end(),
67 [](const TrigFTF_GNN_Node* s, const TrigFTF_GNN_Node* s1) { return (s->r() < s1->r()); });
70}
◆ sortByPhi()
| void TrigFTF_GNN_EtaBin::sortByPhi |
( |
| ) |
|
Definition at line 29 of file GNN_DataStorage.cxx.
29 {
30
31 std::vector<std::pair<float, const TrigFTF_GNN_Node*> > phiBuckets[32];
32
33 int nBuckets = 31;
34
35 for(
const auto& n :
m_vn) {
36 int bIdx = (
int)(0.5*nBuckets*(
n->phi()/(
float)
M_PI + 1.0f));
37 phiBuckets[bIdx].push_back(std::make_pair(
n->phi(), n));
38 }
39
40 for(auto& b : phiBuckets) {
42 }
43
45 for(const auto& b : phiBuckets) {
46 for(const auto& p : b) {
48 }
49 }
50
51}
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.
◆ m_in
| std::vector<std::vector<unsigned int> > TrigFTF_GNN_EtaBin::m_in |
◆ m_layerKey
| unsigned int TrigFTF_GNN_EtaBin::m_layerKey {0} |
◆ m_maxRadius
| float TrigFTF_GNN_EtaBin::m_maxRadius |
◆ m_minRadius
| float TrigFTF_GNN_EtaBin::m_minRadius |
◆ m_params
| std::vector<std::array<float,5> > TrigFTF_GNN_EtaBin::m_params |
◆ m_vn
◆ m_vPhiNodes
| std::vector<std::pair<float, unsigned int> > TrigFTF_GNN_EtaBin::m_vPhiNodes |
The documentation for this class was generated from the following files: