]>
Commit | Line | Data |
---|---|---|
46d29e70 | 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 | $Log$ | |
0e9c2ad5 | 18 | Revision 1.2 2000/10/06 16:49:46 cblume |
19 | Made Getters const | |
20 | ||
46d29e70 | 21 | Revision 1.1.2.2 2000/10/04 16:34:58 cblume |
22 | Replace include files by forward declarations | |
23 | ||
24 | Revision 1.1.2.1 2000/09/22 14:47:52 cblume | |
25 | Add the tracking code | |
26 | ||
27 | */ | |
28 | ||
29 | #include "AliTRDcluster.h" | |
46d29e70 | 30 | #include "AliTRDtimeBin.h" |
31 | ||
32 | ClassImp(AliTRDtimeBin) | |
33 | ||
34 | //______________________________________________________ | |
35 | ||
36 | void AliTRDtimeBin::InsertCluster(AliTRDcluster* c, UInt_t index) { | |
37 | ||
38 | // Insert cluster in TimeBin cluster array. | |
39 | // Clusters are sorted according to Y coordinate. | |
40 | ||
41 | if (fN==kMAX_CLUSTER_PER_TIME_BIN) { | |
42 | printf("AliTRDtimeBin::InsertCluster(): Too many clusters !\n"); | |
43 | return; | |
44 | } | |
45 | if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;} | |
46 | Int_t i=Find(c->GetY()); | |
47 | memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTRDcluster*)); | |
48 | memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t)); | |
49 | fIndex[i]=index; fClusters[i]=c; fN++; | |
50 | } | |
51 | ||
52 | //______________________________________________________ | |
53 | ||
54 | Int_t AliTRDtimeBin::Find(Double_t y) const { | |
55 | ||
56 | // Returns index of the cluster nearest in Y | |
57 | ||
58 | if (y <= fClusters[0]->GetY()) return 0; | |
59 | if (y > fClusters[fN-1]->GetY()) return fN; | |
60 | Int_t b=0, e=fN-1, m=(b+e)/2; | |
61 | for (; b<e; m=(b+e)/2) { | |
62 | if (y > fClusters[m]->GetY()) b=m+1; | |
63 | else e=m; | |
64 | } | |
65 | return m; | |
66 | } | |
67 | ||
68 | //______________________________________________________ | |
69 | AliTRDcluster *AliTRDtimeBin::operator[](Int_t i) | |
70 | { | |
71 | // | |
72 | // Index operator | |
73 | // | |
74 | ||
75 | return fClusters[i]; | |
76 | ||
77 | } |