ATLAS Offline Software
Loading...
Searching...
No Matches
TrigFTF_GNNR3_EtaBin Class Reference

#include <GNNR3_DataStorage.h>

Collaboration diagram for TrigFTF_GNNR3_EtaBin:

Classes

struct  CompareNodesByPhi

Public Member Functions

 TrigFTF_GNNR3_EtaBin ()
 ~TrigFTF_GNNR3_EtaBin ()
void sortByPhi ()
void initializeNodes ()
bool empty () const
void generatePhiIndexing (float)
float getMinBinRadius () const
float getMaxBinRadius () const

Public Attributes

std::vector< const TrigFTF_GNNR3_Node * > m_vn
std::vector< std::pair< float, unsigned int > > m_vPhiNodes
std::vector< std::vector< unsigned int > > m_in
std::vector< std::array< float, 5 > > m_params
float m_minRadius
float m_maxRadius

Detailed Description

Definition at line 40 of file GNNR3_DataStorage.h.

Constructor & Destructor Documentation

◆ TrigFTF_GNNR3_EtaBin()

TrigFTF_GNNR3_EtaBin::TrigFTF_GNNR3_EtaBin ( )

Definition at line 14 of file GNNR3_DataStorage.cxx.

14 : m_minRadius(0), m_maxRadius(0) {
15
16 m_in.clear();
17 m_vn.clear();
18 m_params.clear();
19 m_vn.reserve(1000);
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 ( )

Definition at line 22 of file GNNR3_DataStorage.cxx.

22 {
23 m_in.clear();
24 m_vn.clear();
25 m_params.clear();
26}

Member Function Documentation

◆ empty()

bool TrigFTF_GNNR3_EtaBin::empty ( ) const
inline

Definition at line 56 of file GNNR3_DataStorage.h.

56 {
57 return m_vn.empty();
58 }

◆ 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
75 float phi = m_params[nIdx][2];
76 if(phi <= M_PI-dphi) continue;
77 m_vPhiNodes.push_back(std::pair<float, unsigned int>(phi - 2*M_PI, nIdx));
78
79 }
80
81 for(unsigned int nIdx=0;nIdx<m_vn.size();nIdx++) {
82 float phi = m_params[nIdx][2];
83 m_vPhiNodes.push_back(std::pair<float, unsigned int>(phi, nIdx));
84 }
85
86 for(unsigned int nIdx=0;nIdx<m_vn.size();nIdx++) {
87
88 float phi = m_params[nIdx][2];
89 if(phi >= -M_PI + dphi) break;
90 m_vPhiNodes.push_back(std::pair<float, unsigned int>(phi + 2*M_PI, nIdx));
91 }
92
93}
#define M_PI
Scalar phi() const
phi method
std::vector< std::pair< float, unsigned int > > m_vPhiNodes

◆ getMaxBinRadius()

float TrigFTF_GNNR3_EtaBin::getMaxBinRadius ( ) const
inline

Definition at line 66 of file GNNR3_DataStorage.h.

66 {
67 return m_maxRadius;
68 }

◆ getMinBinRadius()

float TrigFTF_GNNR3_EtaBin::getMinBinRadius ( ) const
inline

Definition at line 62 of file GNNR3_DataStorage.h.

62 {
63 return m_minRadius;
64 }

◆ initializeNodes()

void TrigFTF_GNNR3_EtaBin::initializeNodes ( )

Definition at line 53 of file GNNR3_DataStorage.cxx.

53 {
54
55 if(m_vn.empty()) return;
56
57 m_params.resize(m_vn.size());
58
59 m_in.resize(m_vn.size());
60 for(auto& v : m_in) v.reserve(50);//reasonably high number of incoming edges per node
61
62 std::transform(m_vn.begin(), m_vn.end(), m_params.begin(),
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()); });
67 m_maxRadius = (*max_iter)->r();
68 m_minRadius = (*min_iter)->r();
69}
static Double_t a

◆ 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) {
40 std::sort(b.begin(), b.end());
41 }
42
43 int idx = 0;
44 for(const auto& b : phiBuckets) {
45 for(const auto& p : b) {
46 m_vn[idx++] = p.second;
47 }
48 }
49
50}
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.

Member Data Documentation

◆ m_in

std::vector<std::vector<unsigned int> > TrigFTF_GNNR3_EtaBin::m_in

Definition at line 72 of file GNNR3_DataStorage.h.

◆ m_maxRadius

float TrigFTF_GNNR3_EtaBin::m_maxRadius

Definition at line 75 of file GNNR3_DataStorage.h.

◆ m_minRadius

float TrigFTF_GNNR3_EtaBin::m_minRadius

Definition at line 75 of file GNNR3_DataStorage.h.

◆ m_params

std::vector<std::array<float,5> > TrigFTF_GNNR3_EtaBin::m_params

Definition at line 73 of file GNNR3_DataStorage.h.

◆ m_vn

std::vector<const TrigFTF_GNNR3_Node*> TrigFTF_GNNR3_EtaBin::m_vn

Definition at line 70 of file GNNR3_DataStorage.h.

◆ m_vPhiNodes

std::vector<std::pair<float, unsigned int> > TrigFTF_GNNR3_EtaBin::m_vPhiNodes

Definition at line 71 of file GNNR3_DataStorage.h.


The documentation for this class was generated from the following files: