]> git.uio.no Git - u/mrichter/AliRoot.git/blame - TPC/AliTPCclusterInfo.cxx
fix for coverity issues : 17923
[u/mrichter/AliRoot.git] / TPC / AliTPCclusterInfo.cxx
CommitLineData
03fe1804 1/**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
3 * *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
6 * *
7 * Permission to use, copy, modify and distribute this software and its *
8 * documentation strictly for non-commercial purposes is hereby granted *
9 * without fee, provided that the above copyright notice appears in all *
10 * copies and that both the copyright notice and this permission notice *
11 * appear in the supporting documentation. The authors make no claims *
12 * about the suitability of this software for any purpose. It is *
13 * provided "as is" without express or implied warranty. *
14 **************************************************************************/
15
16//-------------------------------------------------------
17// Implementation of the TPC cluster debug information
18//
19// Origin: Marian Ivanov Marian.Ivanov@cern.ch
20//
21// Additional cluster information to monitor clustering performance
22// and to extract a features of detector response
23// Information attached to the default cluster
24// ONLY in DEBUG MODE
25//
26//-------------------------------------------------------
27
28/* $Id$ */
29
30#include "AliTPCclusterInfo.h"
31#include "AliLog.h"
32
bb29c1fd 33ClassImp(AliTPCclusterInfo)
03fe1804 34
35
36AliTPCclusterInfo::AliTPCclusterInfo():
37 fNPads(0),
38 fNTimeBins(0),
39 fNBins(0),
40 fGraph(0)
41{
42 //
43 // default constructor
44 //
45 for (Int_t i=0; i<25;i++){
46 fMatrix[i] = i;
47 }
48}
49
50AliTPCclusterInfo::AliTPCclusterInfo(const AliTPCclusterInfo & info):
51 TObject(info),
52 fNPads(info.fNPads),
53 fNTimeBins(info.fNTimeBins),
54 fNBins(info.fNBins),
55 fGraph(0)
56{
57 //
58 // copy constructor
59 //
60 // AliInfo("Copy constructor\n");
61 for (Int_t i=0; i<25;i++){
62 fMatrix[i] = info.fMatrix[i];
63 }
35e039dc 64 if (info.fGraph) {
65 fGraph = new Float_t[fNBins];
66 for (Int_t i=0;i<fNBins; i++){
67 fGraph[i] = info.fGraph[i];
68 }
03fe1804 69 }
03fe1804 70}
71
72
73AliTPCclusterInfo::AliTPCclusterInfo(Bool_t extend):
74 fNPads(0),
75 fNTimeBins(0),
76 fNBins(0),
77 fGraph(0)
78{
79 //
80 // allocate dummy graph - neccessary for IO part to use automatic branching
81 //
82 for (Int_t i=0; i<25;i++){
83 fMatrix[i] = i;
84 }
85 if (extend){
86 fNBins = 1;
87 fGraph = new Float_t[1];
88 fGraph[0]=-1;
89 }
90}
91
b85029eb 92AliTPCclusterInfo::AliTPCclusterInfo(Float_t *matrix, Int_t nbins, Float_t* graph):
93 fNPads(0),
94 fNTimeBins(0),
95 fNBins(0),
96 fGraph(0)
97{
03fe1804 98 //
99 // constructor of the info
100 //
101 for (Int_t i=0;i<25;i++){
102 fMatrix[i]=matrix[i];
103 }
104 fNPads=0;
105 fNTimeBins=0;
106 Int_t center = 5+5+2;
107 for (Int_t i=-2; i<=2;i++) if (matrix[center+i]>0) fNTimeBins++;
108 for (Int_t i=-2; i<=2;i++) if (matrix[center+i*5]>0) fNPads++;
109 fNBins = nbins;
110 fGraph = 0;
111 if (fNBins>0) {
112 fGraph = new Float_t[fNBins];
113 for (Int_t i=0;i<fNBins; i++){
114 fGraph[i] = graph[i];
115 }
116 }
117}
118
b85029eb 119AliTPCclusterInfo& AliTPCclusterInfo::operator=(const AliTPCclusterInfo& info){
120 //
121 // assignment operator
122 //
123 if (this != &info) {
124 new (this) AliTPCclusterInfo(info);
125 }
126 return *this;
127}
128
129
03fe1804 130UChar_t AliTPCclusterInfo::GetNPads(Float_t threshold) const {
131 //
132 //
133 Int_t nPads=0;
134 Int_t center = 5+5+2;
135 for (Int_t i=-2; i<=2;i++) if (fMatrix[center+i*5]>threshold) nPads++;
136 return nPads;
137}
138
139UChar_t AliTPCclusterInfo::GetNTimeBins(Float_t threshold) const {
140 //
141 //
142 //
143 Int_t nTimeBins=0;
144 Int_t center = 5+5+2;
b85029eb 145 for (Int_t i=-2; i<=2;i++) if (fMatrix[center+i]>threshold) nTimeBins++;
03fe1804 146 return nTimeBins;
147}
148
149
150
151
152AliTPCclusterInfo::~AliTPCclusterInfo(){
153 //
154 // destructor
155 //
156 if (fGraph) delete [] fGraph;
157}
158