1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
18 #include "AliMUONRawCluster.h"
19 #include <TObjArray.h>
22 ClassImp(AliMUONRawCluster);
25 AliMUONRawCluster::AliMUONRawCluster() {
27 fTracks[0]=fTracks[1]=fTracks[2]=-1;
28 for (int j=0;j<2;j++) {
36 for (int k=0;k<50;k++) {
43 fNcluster[0]=fNcluster[1]=-1;
47 Int_t AliMUONRawCluster::Compare(const TObject *obj) const
50 AliMUONRawCluster *raw=(AliMUONRawCluster *)obj;
51 Float_t r=GetRadius();
52 Float_t ro=raw->GetRadius();
54 else if (r<ro) return -1;
57 AliMUONRawCluster *raw=(AliMUONRawCluster *)obj;
59 Float_t yo=raw->fY[0];
61 else if (y<yo) return -1;
66 Int_t AliMUONRawCluster::
67 BinarySearch(Float_t y, TArrayF coord, Int_t from, Int_t upto)
69 // Find object using a binary search. Array must first have been sorted.
70 // Search can be limited by setting upto to desired index.
72 Int_t low=from, high=upto-1, half;
75 if(y>coord[half]) low=half;
81 void AliMUONRawCluster::SortMin(Int_t *idx,Float_t *xdarray,Float_t *xarray,Float_t *yarray,Float_t *qarray, Int_t ntr)
84 // Get the 3 closest points(cog) one can find on the second cathode
85 // starting from a given cog on first cathode
89 // Loop over deltax, only 3 times
94 Int_t id[3] = {-2,-2,-2};
95 Float_t jx[3] = {0.,0.,0.};
96 Float_t jy[3] = {0.,0.,0.};
97 Float_t jq[3] = {0.,0.,0.};
98 Int_t jid[3] = {-2,-2,-2};
108 if ((i == 1 && j == id[i-1])
109 ||(i == 2 && (j == id[i-1] || j == id[i-2]))) continue;
110 if (TMath::Abs(xdarray[j]) < xmin) {
111 xmin = TMath::Abs(xdarray[j]);
142 Int_t AliMUONRawCluster::PhysicsContribution()
144 // Evaluate physics contribution to cluster
148 for (Int_t i=0; i<fMultiplicity[0]; i++) {
149 if (fPhysicsMap[i]==2) iPhys++;
150 if (fPhysicsMap[i]==1) iMixed++;
151 if (fPhysicsMap[i]==0) iBg++;
153 if (iMixed==0 && iBg==0) {
155 } else if ((iPhys != 0 && iBg !=0) || iMixed != 0) {
162 //____________________________________________________
163 void AliMUONRawCluster::DumpIndex(void)
166 for (Int_t icat=0;icat<2;icat++) {
167 printf ("Mult %d\n",fMultiplicity[icat]);
168 for (Int_t idig=0;idig<fMultiplicity[icat];idig++){
169 printf("Index %d",fIndexMap[idig][icat]);