|
ATLAS Offline Software
|
#include <TrigITkAccelerationTool.h>
Definition at line 16 of file TrigITkAccelerationTool.h.
◆ TrigITkAccelerationTool()
TrigITkAccelerationTool::TrigITkAccelerationTool |
( |
const std::string & |
t, |
|
|
const std::string & |
n, |
|
|
const IInterface * |
p |
|
) |
| |
◆ exportSeedMakingJob()
Definition at line 25 of file TrigITkAccelerationTool.cxx.
27 typedef struct SpIndexPair {
32 bool operator()(
const std::pair<int, const TrigSiSpacePointBase*>&
p1,
const std::pair<int, const TrigSiSpacePointBase*>&
p2) {
33 return p1.second->z() <
p2.second->z();
39 bool operator()(
const std::pair<int, const TrigSiSpacePointBase*>&
p1,
const std::pair<int, const TrigSiSpacePointBase*>&
p2) {
40 return p1.second->r() <
p2.second->r();
49 const std::vector<short>& pixelLayers =
m_accelSvc->getLayerInformation(1);
50 const std::vector<short>& layerTypes =
m_accelSvc->getLayerInformation(0);
56 const size_t bufferOffset = 256;
57 size_t totalSize = bufferOffset+dataTypeSize;
63 memset(pJ,0,dataTypeSize);
88 bool isRoiFullscan = ((roi->
etaPlus() >= 4) && (roi->
etaMinus() <= -4));
89 if(!(isRoiFullscan || roi->
composite() )){
103 unsigned int nSP = vsp.size();
104 if(nSP >= TrigAccel::ITk::MAX_NUMBER_SPACEPOINTS) {
105 nSP = TrigAccel::ITk::MAX_NUMBER_SPACEPOINTS-1;
106 ATH_MSG_WARNING(
"MAX_NUMBER_SPACEPOINTS exceeded, exported data truncated ...");
112 int nLayers =
static_cast<int>(layerTypes.size());
115 std::vector<std::vector<std::pair<int, const TrigSiSpacePointBase*> > > phiLArray;
116 phiLArray.resize(nLayers*nSlices);
118 for(
unsigned int i=0;
i<nSP;
i++) {
123 short layerId = pixelLayers[hashId];
125 int phiIdx = (sp.
phi()+
M_PI)/phiSliceWidth;
129 else if (phiIdx < 0) {
134 std::vector<std::pair<int, const TrigSiSpacePointBase*> >&
v = phiLArray[layerId + phiIdx*nLayers];
135 v.push_back(std::pair<int, const TrigSiSpacePointBase*>(
i,&sp));
140 for(std::vector<short>::const_iterator
it = layerTypes.begin();
it!=layerTypes.end();++
it, layerIdx++) {
141 short barrel_ec = (*it);
143 std::vector<std::pair<int, const TrigSiSpacePointBase*> >&
v = phiLArray[layerIdx +
slice*nLayers];
144 if(barrel_ec==0)
std::sort(
v.begin(),
v.end(), SP_INDEX_PAIR::compareZ());
145 else std::sort(
v.begin(),
v.end(), SP_INDEX_PAIR::compareR());
157 int layerStart = spIdx;
159 std::vector<std::pair<int, const TrigSiSpacePointBase*> >&
v = phiLArray[
layer +
slice*nLayers];
160 for(std::vector<std::pair<int, const TrigSiSpacePointBase*> >::
iterator it =
v.begin();
it!=
v.end();++
it) {
165 if (!
isBarrel && clusterWidth > 0.2)
continue;
167 sps.
m_index[spIdx] = (*it).first;
169 sps.
m_x[spIdx] = sp->
x();
170 sps.
m_y[spIdx] = sp->
y();
171 sps.
m_z[spIdx] = sp->
z();
172 sps.
m_r[spIdx] = sp->
r();
179 int layerEnd = spIdx;
◆ extractTripletsFromOutput()
◆ getCovR()
float TrigITkAccelerationTool::getCovR |
( |
bool |
isBarrel | ) |
const |
|
private |
◆ getCovZ()
float TrigITkAccelerationTool::getCovZ |
( |
bool |
isBarrel | ) |
const |
|
private |
◆ initialize()
StatusCode TrigITkAccelerationTool::initialize |
( |
| ) |
|
|
overridevirtual |
◆ m_accelSvc
The documentation for this class was generated from the following files:
const std::pair< const PrepRawData *, const PrepRawData * > & clusterList() const
return the pair of cluster pointers by reference
JetConstituentVector::iterator iterator
void phi(const double phi)
int m_outerIndex[MAX_NUMBER_OUTPUT_SEEDS]
float m_covZ[MAX_NUMBER_SPACEPOINTS]
unsigned int m_maxTripletBufferLength
float m_tripletD0_PPS_Max
const Amg::Vector2D & widthPhiRZ() const
virtual double etaMinus() const =0
SEED_FINDER_SETTINGS m_settings
float m_clusterWidth[MAX_NUMBER_SPACEPOINTS]
SPACEPOINT_STORAGE m_data
unsigned int m_minEndcapPix
virtual double etaPlus() const =0
const Trk::SpacePoint * offlineSpacePoint() const
float m_x[MAX_NUMBER_SPACEPOINTS]
struct TrigAccel::ITk::SeedMakingJob SEED_MAKING_JOB
float m_phi[MAX_NUMBER_SPACEPOINTS]
int m_innerIndex[MAX_NUMBER_OUTPUT_SEEDS]
int m_layerBegin[MAX_SILICON_LAYERS]
unsigned int m_maxBarrelPix
float m_tripletD0_PPS_Max
float m_z[MAX_NUMBER_SPACEPOINTS]
virtual double phiMinus() const =0
unsigned int m_maxTripletBufferLength
unsigned int m_maxEndcapPix
virtual double phiPlus() const =0
extreme phi values
const std::pair< IdentifierHash, IdentifierHash > & elementIdList() const
return the pair of Ids of the element by reference
float m_r[MAX_NUMBER_SPACEPOINTS]
int m_middleIndex[MAX_NUMBER_OUTPUT_SEEDS]
SPACEPOINT_LAYER_RANGE m_phiSlices[MAX_PHI_SLICES]
float m_covR[MAX_NUMBER_SPACEPOINTS]
const InDet::SiWidth & width() const
return width class reference
unsigned char * m_rawBuffer
int m_layerEnd[MAX_SILICON_LAYERS]
virtual double zedPlus() const =0
the zed and eta values at the most forward and most rear ends of the RoI
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.
#define ATH_MSG_WARNING(x)
virtual double zedMinus() const =0
int m_type[MAX_NUMBER_SPACEPOINTS]
This is a "hash" representation of an Identifier. This encodes a 32 bit index which can be used to lo...
int m_index[MAX_NUMBER_SPACEPOINTS]
unsigned int m_maxSiliconLayer
float m_Q[MAX_NUMBER_OUTPUT_SEEDS]
float m_y[MAX_NUMBER_SPACEPOINTS]
virtual bool composite() const =0
Super RoI access methods.