#include <GNN_DataStorage.h>
Definition at line 42 of file GNN_DataStorage.h.
◆ TrigFTF_GNN_EtaBin()
TrigFTF_GNN_EtaBin::TrigFTF_GNN_EtaBin |
( |
| ) |
|
◆ ~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 80 of file GNN_DataStorage.cxx.
82 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
90 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
95 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
◆ 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 56 of file GNN_DataStorage.cxx.
58 if(
m_vn.empty())
return;
64 for(
unsigned int nIdx=0;nIdx<
m_vn.size();nIdx++) {
65 m_in[nIdx].reserve(50);
74 auto [min_iter, max_iter] = std::minmax_element(
m_vn.begin(),
m_vn.end(),
◆ sortByPhi()
void TrigFTF_GNN_EtaBin::sortByPhi |
( |
| ) |
|
Definition at line 31 of file GNN_DataStorage.cxx.
33 std::vector<std::pair<float, const TrigFTF_GNN_Node*> > phiBuckets[32];
37 for(
const auto&
n :
m_vn) {
39 int bIdx = (
int)(0.5*nBuckets*(
n->phi()/(
float)
M_PI + 1.0f));
40 phiBuckets[bIdx].push_back(std::make_pair(
n->phi(),
n));
43 for(
auto&
b : phiBuckets) {
48 for(
const auto&
b : phiBuckets) {
49 for(
const auto&
p :
b) {
◆ m_in
std::vector<std::vector<unsigned int> > TrigFTF_GNN_EtaBin::m_in |
◆ 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:
void sort(typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const Compare &comp)
Specialization of sort for DataVector/List.