5#ifndef _VrtSecInclusive_IntersectionPos_H
6#define _VrtSecInclusive_IntersectionPos_H
24 virtual int bec() = 0;
25 virtual const std::string&
name() = 0;
26 virtual std::vector<double>*
x() = 0;
27 virtual std::vector<double>*
y() = 0;
28 virtual std::vector<double>*
z() = 0;
44 inline std::vector<double>*
x() {
return m_x; }
45 inline std::vector<double>*
y() {
return m_y; }
46 inline std::vector<double>*
z() {
return m_z; }
50 std::vector<double>*
m_x;
51 std::vector<double>*
m_y;
52 std::vector<double>*
m_z;
68 inline std::vector<double>*
x() {
return m_x; }
69 inline std::vector<double>*
y() {
return m_y; }
70 inline std::vector<double>*
z() {
return m_z; }
76 std::vector<double>*
m_x;
77 std::vector<double>*
m_y;
78 std::vector<double>*
m_z;
const std::string & name()
std::vector< double > * m_y
std::vector< double > * m_z
IntersectionPos_barrel(const IntersectionPos_barrel &)=delete
std::vector< double > * z()
IntersectionPos_barrel(const char *name, const double &r)
std::vector< double > * y()
std::vector< double > * m_x
IntersectionPos_barrel & operator=(const IntersectionPos_barrel &)=delete
std::vector< double > * x()
virtual ~IntersectionPos_barrel()
void setBranchAddress(TTree *, const char *collectionName="RecoTrk")
std::vector< double > * y()
void setBranchAddress(TTree *, const char *collectionName="RecoTrk")
IntersectionPos_endcap(const IntersectionPos_endcap &)=delete
std::vector< double > * z()
std::vector< double > * m_x
std::vector< double > * m_y
std::vector< double > * m_z
std::vector< double > * x()
IntersectionPos_endcap(const char *name, const double &zpos, const double &rmin, const double &rmax)
virtual ~IntersectionPos_endcap()
IntersectionPos_endcap & operator=(const IntersectionPos_endcap &)=delete
const std::string & name()
virtual std::vector< double > * y()=0
virtual std::vector< double > * z()=0
virtual const std::string & name()=0
virtual ~IntersectionPos()
virtual void setBranchAddress(TTree *, const char *collectionName="RecoTrk")=0
virtual std::vector< double > * x()=0