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.5.6.2 2002/07/24 10:09:31 alibrary
21 Revision 1.6 2002/03/28 14:59:07 cblume
24 Revision 1.5 2001/11/06 17:19:41 cblume
25 Add detailed geometry and simple simulator
27 Revision 1.4 2001/10/21 18:30:02 hristov
28 Several pointers were set to zero in the default constructors to avoid memory management problems
30 Revision 1.3 2000/10/15 23:40:01 cblume
33 Revision 1.2 2000/10/06 16:49:46 cblume
36 Revision 1.1.2.2 2000/10/04 16:34:58 cblume
37 Replace include files by forward declarations
39 Revision 1.1.2.1 2000/09/22 14:47:52 cblume
44 //////////////////////////////////////////////////////////////////////
46 // Hit compression class //
47 // Adapted from AliTPCTimeBin by Marian //
49 //////////////////////////////////////////////////////////////////////
51 #include "AliTRDcluster.h"
52 #include "AliTRDtimeBin.h"
54 ClassImp(AliTRDtimeBin)
56 //______________________________________________________
58 AliTRDtimeBin::AliTRDtimeBin() {
61 for (UInt_t i=0; i<kMaxClusterPerTimeBin; i++)
64 //______________________________________________________
66 void AliTRDtimeBin::InsertCluster(AliTRDcluster* c, UInt_t index) {
68 // Insert cluster in TimeBin cluster array.
69 // Clusters are sorted according to Y coordinate.
71 if (fN==kMaxClusterPerTimeBin) {
72 printf("AliTRDtimeBin::InsertCluster(): Too many clusters !\n");
75 if (fN==0) {fIndex[0]=index; fClusters[fN++]=c; return;}
76 Int_t i=Find(c->GetY());
77 memmove(fClusters+i+1 ,fClusters+i,(fN-i)*sizeof(AliTRDcluster*));
78 memmove(fIndex +i+1 ,fIndex +i,(fN-i)*sizeof(UInt_t));
79 fIndex[i]=index; fClusters[i]=c; fN++;
82 //______________________________________________________
84 Int_t AliTRDtimeBin::Find(Double_t y) const {
86 // Returns index of the cluster nearest in Y
88 if (y <= fClusters[0]->GetY()) return 0;
89 if (y > fClusters[fN-1]->GetY()) return fN;
90 Int_t b=0, e=fN-1, m=(b+e)/2;
91 for (; b<e; m=(b+e)/2) {
92 if (y > fClusters[m]->GetY()) b=m+1;
98 //______________________________________________________
99 AliTRDcluster *AliTRDtimeBin::operator[](Int_t i)