3 /* Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
8 //-------------------------------------------------------------------------
11 //-------------------------------------------------------------------------
16 template <Int_t N> class AliAODRedCov {
20 // Class containing reduced cov matrix, see example here for a track
26 // Y fOdia[ 0] fDiag[ 1]
28 // Z fOdia[ 1] fOdia[ 2] fDiag[ 2]
30 // Px fOdia[ 3] fOdia[ 4] fOdia[ 5] fDiag[ 3]
32 // Py fOdia[ 6] fOdia[ 7] fOdia[ 8] fOdia[ 9] fDiag[ 4]
34 // Pz fOdia[10] fOdia[11] fOdia[12] fOdia[13] fOdia[14] fDiag[ 5]
39 for(Int_t i=0; i<N; i++) fDiag[i] = 0.;
40 for(Int_t i=0; i<N*(N-1)/2; i++) fODia[i] = 0.;
42 virtual ~AliAODRedCov() {}
43 template <class T> void GetCovMatrix(T *cmat) const;
44 template <class T> void SetCovMatrix(T *cmat);
47 Double32_t fDiag[N]; // Diagonal elements
48 Double32_t fODia[N*(N-1)/2]; // [-1, 1,8] 8 bit precision for off diagonal elements
50 ClassDef(AliAODRedCov,1)
54 //Cint craps out here, we protect this part
55 #if !defined(__CINT__) && !defined(__MAKECINT__)
59 //______________________________________________________________________________
60 template <Int_t N> template <class T> inline void AliAODRedCov<N>::GetCovMatrix(T *cmat) const
63 // Returns the external cov matrix
66 for(Int_t i=0; i<N; ++i) {
67 // Off diagonal elements
68 for(Int_t j=0; j<i; ++j) {
69 cmat[i*(i+1)/2+j] = (fDiag[j] >= 0. && fDiag[i] >= 0.) ? fODia[(i-1)*i/2+j]*fDiag[j]*fDiag[i]: -999.;
71 printf("cmat[%2d] = fODia[%2d]*fDiag[%2d]*fDiag[%2d] = %f\n",
72 i*(i+1)/2+j,(i-1)*i/2+j,j,i,cmat[i*(i+1)/2+j]);
77 cmat[i*(i+1)/2+i] = (fDiag[i] >= 0.) ? fDiag[i]*fDiag[i] : -999.;
79 printf("cmat[%2d] = fDiag[%2d]*fDiag[%2d] = %f\n",
80 i*(i+1)/2+i,i,i,cmat[i*(i+1)/2+i]);
86 //______________________________________________________________________________
87 template <Int_t N> template <class T> inline void AliAODRedCov<N>::SetCovMatrix(T *cmat)
90 // Sets the external cov matrix
96 for (Int_t i=0; i<(N*(N+1))/2; i++) {
97 printf("cmat[%d] = %f\n", i, cmat[i]);
101 // Diagonal elements first
102 for(Int_t i=0; i<N; ++i) {
103 fDiag[i] = (cmat[i*(i+1)/2+i] >= 0.) ? TMath::Sqrt(cmat[i*(i+1)/2+i]) : -999.;
105 printf("fDiag[%2d] = TMath::Sqrt(cmat[%2d]) = %f\n",
106 i,i*(i+1)/2+i, fDiag[i]);
110 // ... then the ones off diagonal
111 for(Int_t i=0; i<N; ++i)
112 // Off diagonal elements
113 for(Int_t j=0; j<i; ++j) {
114 fODia[(i-1)*i/2+j] = (fDiag[i] > 0. && fDiag[j] > 0.) ? cmat[i*(i+1)/2+j]/(fDiag[j]*fDiag[i]) : 0.;
115 // check for division by zero (due to diagonal element of 0) and for fDiag != -999. (due to negative input diagonal element).
116 if (fODia[(i-1)*i/2+j]>1.) { // check upper boundary
118 printf("out of bounds: %f\n", fODia[(i-1)*i/2+j]);
120 fODia[(i-1)*i/2+j] = 1.;
122 if (fODia[(i-1)*i/2+j]<-1.) { // check lower boundary
124 printf("out of bounds: %f\n", fODia[(i-1)*i/2+j]);
126 fODia[(i-1)*i/2+j] = -1.;
129 printf("fODia[%2d] = cmat[%2d]/(fDiag[%2d]*fDiag[%2d]) = %f\n",
130 (i-1)*i/2+j,i*(i+1)/2+j,j,i,fODia[(i-1)*i/2+j]);
134 for(Int_t i=0; i< N; ++i) fDiag[i]=-999.;
135 for(Int_t i=0; i< N*(N-1)/2; ++i) fODia[i]=0.;