#include <TrkVKalVrtCoreBase.h>
Definition at line 126 of file TrkVKalVrtCoreBase.h.
◆ VKVertex() [1/4]
◆ VKVertex() [2/4]
◆ VKVertex() [3/4]
| Trk::VKVertex::VKVertex |
( |
| ) |
|
Definition at line 140 of file TrkVKalVrtCoreBase.cxx.
140 :
143 {
152 }
double savedVrtMomCov[21]
std::vector< VKVertex * > includedVrt
std::vector< std::unique_ptr< VKTrack > > TrackList
std::vector< std::unique_ptr< VKConstraintBase > > ConstraintList
std::vector< std::unique_ptr< TWRK > > tmpArr
VKVertex * nextCascadeVrt
◆ ~VKVertex()
| Trk::VKVertex::~VKVertex |
( |
| ) |
|
|
default |
◆ VKVertex() [4/4]
| Trk::VKVertex::VKVertex |
( |
const VKVertex & | src | ) |
|
Definition at line 163 of file TrkVKalVrtCoreBase.cxx.
163 :
171 {
172 for(
int i=0;
i<6;
i++) {
175 if(i>=3) continue;
183 }
184 for(
int i=0;
i<21;
i++){
187 }
191
192 int NTrack=
src.TrackList.size();
194 int SIZE=3*NTrack+3;
195 for(
int i=0;
i<SIZE;
i++)
for(
int j=0; j<SIZE; j++) {
ader[
i*FULLSIZE+j]=
src.ader[
i*FULLSIZE+j]; }
196
197 for(
int i=0;
i<NTrack;
i++)
TrackList.emplace_back(
new VKTrack(*(
src.TrackList[i])) );
199 for(
int ic=0;
ic<(
int)
src.ConstraintList.size();
ic++){
201 }
203 }
double ader[(3 *vkalNTrkM+3) *(3 *vkalNTrkM+3)]
◆ operator=() [1/2]
Definition at line 205 of file TrkVKalVrtCoreBase.cxx.
206 {
207 if (this!=&src){
215 for(
int i=0;
i<6;
i++) {
218 if(i>=3) continue;
226 }
227 for(
int i=0;
i<21;
i++){
230 }
234
235 int NTrack=
src.TrackList.size();
237 int SIZE=3*NTrack+3;
238 for(
int i=0;
i<SIZE;
i++)
for(
int j=0; j<SIZE; j++) {
ader[
i*FULLSIZE+j]=
src.ader[
i*FULLSIZE+j]; }
239
243 for(
int i=0;
i<NTrack;
i++)
TrackList.emplace_back(
new VKTrack(*(
src.TrackList[i])) );
245 for(
int ic=0;
ic<(
int)
src.ConstraintList.size();
ic++){
247 }
248
249 std::copy (std::begin(
src.T), std::end(
src.T), std::begin(
T));
250 std::copy (std::begin(
src.wa), std::end(
src.wa), std::begin(
wa));
251 std::copy (std::begin(
src.dxyz0), std::end(
src.dxyz0), std::begin(
dxyz0));
252 }
253 return *this;
254 }
◆ operator=() [2/2]
◆ setCnstV()
| void Trk::VKVertex::setCnstV |
( |
double | v[3] | ) |
|
|
noexcept |
◆ setFitV()
| void Trk::VKVertex::setFitV |
( |
double | v[3] | ) |
|
|
noexcept |
◆ setIniV()
| void Trk::VKVertex::setIniV |
( |
double | v[3] | ) |
|
|
noexcept |
◆ setRefIterV()
| void Trk::VKVertex::setRefIterV |
( |
double | v[] | ) |
|
|
noexcept |
◆ setRefV()
| void Trk::VKVertex::setRefV |
( |
double | v[3] | ) |
|
|
noexcept |
◆ ader
◆ apriorV
| double Trk::VKVertex::apriorV[3] {} |
◆ apriorVWGT
| double Trk::VKVertex::apriorVWGT[6] {} |
◆ Chi2
| double Trk::VKVertex::Chi2 |
◆ cnstV
| double Trk::VKVertex::cnstV[3] {} |
◆ ConstraintList
◆ dxyz0
| double Trk::VKVertex::dxyz0[3] {} |
◆ existFullCov
| int Trk::VKVertex::existFullCov |
◆ fitCovXYZMom
| double Trk::VKVertex::fitCovXYZMom[21] {} |
◆ fitMom
| double Trk::VKVertex::fitMom[3] {} |
◆ fitV
| double Trk::VKVertex::fitV[3] {} |
◆ fitVcov
| double Trk::VKVertex::fitVcov[6] {} |
◆ FVC
◆ includedVrt
| std::vector<VKVertex*> Trk::VKVertex::includedVrt |
◆ iniV
| double Trk::VKVertex::iniV[3] {} |
◆ nextCascadeVrt
◆ passNearVertex
| bool Trk::VKVertex::passNearVertex |
◆ passWithTrkCov
| bool Trk::VKVertex::passWithTrkCov |
◆ refIterV
| double Trk::VKVertex::refIterV[3] {} |
◆ refV
| double Trk::VKVertex::refV[3] {} |
◆ savedVrtMomCov
| double Trk::VKVertex::savedVrtMomCov[21] {} |
| double Trk::VKVertex::T[3] {} |
◆ tmpArr
| std::vector<std::unique_ptr<TWRK> > Trk::VKVertex::tmpArr |
◆ TrackList
| std::vector<std::unique_ptr<VKTrack> > Trk::VKVertex::TrackList |
◆ truncatedStep
| bool Trk::VKVertex::truncatedStep |
◆ useApriorVertex
| int Trk::VKVertex::useApriorVertex |
◆ vk_fitterControl
◆ wa
| double Trk::VKVertex::wa[6] {} |
The documentation for this class was generated from the following files: