{
//
+
// Constructor
//
+ for (Int_t i=0; i< 10; i++) {
+ fA[i] = 0;
+ fB[i] = 0;
+ }
}
//________________________________________________________________________
//
// Constructor
//
+ for (Int_t i=0; i< 10; i++) {
+ fA[i] = 0;
+ fB[i] = 0;
+ }
DefineOutput(1, TList::Class());
}
,fCuts(0)
{
// Dummy copy constructor
+ for (Int_t i=0; i< 10; i++) {
+ fA[i] = 0;
+ fB[i] = 0;
+ }
}
AliAnalysisTaskKMeans& AliAnalysisTaskKMeans::operator=(const AliAnalysisTaskKMeans& /*trclass*/)
{
// Main loop
// Called for each event
- Double_t phi [500];
- Double_t phiR[500];
- Double_t eta[500];
- Double_t etaR[500];
- Double_t pt [500];
+ Double_t phi [500] = {0};
+ Double_t phiR[500] = {0};
+ Double_t eta[500] = {0};
+ Double_t etaR[500] = {0};
+ Double_t pt [500] = {0};
if (!fInputEvent) {
Printf("ERROR: fESD not available");
}while((fBeta<betaStop || nc<4) && nc<fNclustMax);
Int_t *xx=new Int_t[fNeff];
+ for (Int_t i = 0; i < fNeff; i++) xx[i] = 0;
+
EndDetAnn(nk,xData,xx,dEtSum,vPx,vPy,mPyx,mY);
StoreJets(nk,xData,xx,mY);
delete [] xx;
Int_t *nSame = new Int_t[nk];
Int_t **iSame = new Int_t*[nk];
Int_t **cont = new Int_t*[nk];
- for (Int_t iClust=0; iClust<nk; iClust++) cont[iClust]=new Int_t[nk],iSame[iClust]=new Int_t[nk];
+ for (Int_t iClust=0; iClust<nk; iClust++) {
+ cont[iClust] =new Int_t[nk];
+ iSame[iClust]=new Int_t[nk];
+ }
+
for (Int_t iClust=0; iClust<nk; iClust++){
iSame[iClust][iClust]=1;
for (Int_t iClust1=iClust+1; iClust1<nk; iClust1++){