#include <GNNR3_DataStorage.h>
Definition at line 40 of file GNNR3_DataStorage.h.
◆ TrigFTF_GNNR3_EtaBin()
| TrigFTF_GNNR3_EtaBin::TrigFTF_GNNR3_EtaBin |
( |
| ) |
|
Definition at line 14 of file GNNR3_DataStorage.cxx.
15
20}
std::vector< std::array< float, 5 > > m_params
std::vector< const TrigFTF_GNNR3_Node * > m_vn
std::vector< std::vector< unsigned int > > m_in
◆ ~TrigFTF_GNNR3_EtaBin()
| TrigFTF_GNNR3_EtaBin::~TrigFTF_GNNR3_EtaBin |
( |
| ) |
|
◆ empty()
| bool TrigFTF_GNNR3_EtaBin::empty |
( |
| ) |
const |
|
inline |
◆ generatePhiIndexing()
| void TrigFTF_GNNR3_EtaBin::generatePhiIndexing |
( |
float | dphi | ) |
|
Definition at line 71 of file GNNR3_DataStorage.cxx.
71 {
72
73 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
74
78
79 }
80
81 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
84 }
85
86 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
87
91 }
92
93}
Scalar phi() const
phi method
std::vector< std::pair< float, unsigned int > > m_vPhiNodes
◆ getMaxBinRadius()
| float TrigFTF_GNNR3_EtaBin::getMaxBinRadius |
( |
| ) |
const |
|
inline |
◆ getMinBinRadius()
| float TrigFTF_GNNR3_EtaBin::getMinBinRadius |
( |
| ) |
const |
|
inline |
◆ initializeNodes()
| void TrigFTF_GNNR3_EtaBin::initializeNodes |
( |
| ) |
|
Definition at line 53 of file GNNR3_DataStorage.cxx.
53 {
54
55 if(
m_vn.empty())
return;
56
58
60 for(
auto& v :
m_in)
v.reserve(50);
61
63 [](
const TrigFTF_GNNR3_Node* pN) { std::array<float,5> a = {-100.0, 100.0, pN->phi(), pN->r(), pN->z()};
return a;});
64
65 auto [min_iter, max_iter] = std::minmax_element(
m_vn.begin(),
m_vn.end(),
66 [](const TrigFTF_GNNR3_Node* s, const TrigFTF_GNNR3_Node* s1) { return (s->r() < s1->r()); });
69}
◆ sortByPhi()
| void TrigFTF_GNNR3_EtaBin::sortByPhi |
( |
| ) |
|
Definition at line 28 of file GNNR3_DataStorage.cxx.
28 {
29
30 std::vector<std::pair<float, const TrigFTF_GNNR3_Node*> > phiBuckets[32];
31
32 int nBuckets = 31;
33
34 for(
const auto& n :
m_vn) {
35 int bIdx = (
int)(0.5*nBuckets*(
n->phi()/(
float)
M_PI + 1.0f));
36 phiBuckets[bIdx].push_back(std::make_pair(
n->phi(), n));
37 }
38
39 for(auto& b : phiBuckets) {
41 }
42
44 for(const auto& b : phiBuckets) {
45 for(const auto& p : b) {
47 }
48 }
49
50}
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_GNNR3_EtaBin::m_in |
◆ m_maxRadius
| float TrigFTF_GNNR3_EtaBin::m_maxRadius |
◆ m_minRadius
| float TrigFTF_GNNR3_EtaBin::m_minRadius |
◆ m_params
| std::vector<std::array<float,5> > TrigFTF_GNNR3_EtaBin::m_params |
◆ m_vn
◆ m_vPhiNodes
| std::vector<std::pair<float, unsigned int> > TrigFTF_GNNR3_EtaBin::m_vPhiNodes |
The documentation for this class was generated from the following files: