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 Revision 1.3 2001/02/05 14:49:29 hristov
19 Compare() declared const (R.Brun)
21 Revision 1.2 2000/06/15 07:58:48 morsch
22 Code from MUON-dev joined
24 Revision 1.1.2.1 2000/06/09 22:04:50 morsch
25 Was before in DataStructures.cxx
29 #include "AliMUONRawCluster.h"
30 #include <TObjArray.h>
33 ClassImp(AliMUONRawCluster);
36 AliMUONRawCluster::AliMUONRawCluster() {
38 fTracks[0]=fTracks[1]=fTracks[2]=-1;
39 for (int j=0;j<2;j++) {
47 for (int k=0;k<50;k++) {
54 fNcluster[0]=fNcluster[1]=-1;
58 Int_t AliMUONRawCluster::Compare(const TObject *obj) const
61 AliMUONRawCluster *raw=(AliMUONRawCluster *)obj;
62 Float_t r=GetRadius();
63 Float_t ro=raw->GetRadius();
65 else if (r<ro) return -1;
68 AliMUONRawCluster *raw=(AliMUONRawCluster *)obj;
70 Float_t yo=raw->fY[0];
72 else if (y<yo) return -1;
77 Int_t AliMUONRawCluster::
78 BinarySearch(Float_t y, TArrayF coord, Int_t from, Int_t upto)
80 // Find object using a binary search. Array must first have been sorted.
81 // Search can be limited by setting upto to desired index.
83 Int_t low=from, high=upto-1, half;
86 if(y>coord[half]) low=half;
92 void AliMUONRawCluster::SortMin(Int_t *idx,Float_t *xdarray,Float_t *xarray,Float_t *yarray,Float_t *qarray, Int_t ntr)
95 // Get the 3 closest points(cog) one can find on the second cathode
96 // starting from a given cog on first cathode
100 // Loop over deltax, only 3 times
105 Int_t id[3] = {-2,-2,-2};
106 Float_t jx[3] = {0.,0.,0.};
107 Float_t jy[3] = {0.,0.,0.};
108 Float_t jq[3] = {0.,0.,0.};
109 Int_t jid[3] = {-2,-2,-2};
119 if ((i == 1 && j == id[i-1])
120 ||(i == 2 && (j == id[i-1] || j == id[i-2]))) continue;
121 if (TMath::Abs(xdarray[j]) < xmin) {
122 xmin = TMath::Abs(xdarray[j]);
153 Int_t AliMUONRawCluster::PhysicsContribution()
155 // Evaluate physics contribution to cluster
159 for (Int_t i=0; i<fMultiplicity[0]; i++) {
160 if (fPhysicsMap[i]==2) iPhys++;
161 if (fPhysicsMap[i]==1) iMixed++;
162 if (fPhysicsMap[i]==0) iBg++;
164 if (iMixed==0 && iBg==0) {
166 } else if ((iPhys != 0 && iBg !=0) || iMixed != 0) {
173 //____________________________________________________
174 void AliMUONRawCluster::DumpIndex(void)
177 for (Int_t icat=0;icat<2;icat++) {
178 printf ("Mult %d\n",fMultiplicity[icat]);
179 for (Int_t idig=0;idig<fMultiplicity[icat];idig++){
180 printf("Index %d",fIndexMap[idig][icat]);