Fixes to coding conventions violations

[u/mrichter/AliRoot.git] / RICH / AliRICHRawCluster.cxx

/**************************************************************************
 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
 *                                                                        *
 * Author: The ALICE Off-line Project.                                    *
 * Contributors are mentioned in the code where appropriate.              *
 *                                                                        *
 * Permission to use, copy, modify and distribute this software and its   *
 * documentation strictly for non-commercial purposes is hereby granted   *
 * without fee, provided that the above copyright notice appears in all   *
 * copies and that both the copyright notice and this permission notice   *
 * appear in the supporting documentation. The authors make no claims     *
 * about the suitability of this software for any purpose. It is          *
 * provided "as is" without express or implied warranty.                  *
 **************************************************************************/

/* $Id$ */

#include "AliRICHRawCluster.h"

#include <TMath.h>
#include <TArrayF.h>


ClassImp(AliRICHRawCluster)

AliRICHRawCluster :: AliRICHRawCluster() 
{
  fTracks[0]=fTracks[1]=fTracks[2]=-1; 
  fQ=0; fX=fY=0; fMultiplicity=0;
  for (int k=0;k<50;k++) {
    fIndexMap[k]=-1;
    fOffsetMap[k]=0;
    fContMap[k]=0;
    fPhysicsMap[k]=-1;
    fCtype=-1;
  }
  fNcluster[0]=fNcluster[1]=-1;
}

Int_t AliRICHRawCluster::Compare(const TObject *obj) const
{

// Compare two clusters

         AliRICHRawCluster *raw=(AliRICHRawCluster *)obj;
	 Float_t y=fY;
         Float_t yo=raw->fY;
         if (y>yo) return 1;
         else if (y<yo) return -1;
         else return 0;

}

Int_t AliRICHRawCluster::
BinarySearch(Float_t y, TArrayF coord, Int_t from, Int_t upto)
{
   // Find object using a binary search. Array must first have been sorted.
   // Search can be limited by setting upto to desired index.

   Int_t low=from, high=upto-1, half;
   while(high-low>1) {
        half=(high+low)/2;
        if(y>coord[half]) low=half;
        else high=half;
   }
   return low;
}

void AliRICHRawCluster::SortMin(Int_t *idx,Float_t *xdarray,Float_t *xarray,Float_t *yarray,Float_t *qarray, Int_t ntr)
{
  //
  // Get the 3 closest points(cog) one can find on the second cathode 
  // starting from a given cog on first cathode
  //
  
  //
  //  Loop over deltax, only 3 times
  //
  
    Float_t xmin;
    Int_t jmin;
    Int_t id[3] = {-2,-2,-2};
    Float_t jx[3] = {0.,0.,0.};
    Float_t jy[3] = {0.,0.,0.};
    Float_t jq[3] = {0.,0.,0.};
    Int_t jid[3] = {-2,-2,-2};
    Int_t i,j,imax;
  
    if (ntr<3) imax=ntr;
    else imax=3;
    for(i=0;i<imax;i++){
        xmin=1001.;
        jmin=0;
    
        for(j=0;j<ntr;j++){
            if ((i == 1 && j == id[i-1]) 
	          ||(i == 2 && (j == id[i-1] || j == id[i-2]))) continue;
           if (TMath::Abs(xdarray[j]) < xmin) {
	      xmin = TMath::Abs(xdarray[j]);
	      jmin=j;
           }       
        } // j
        if (xmin != 1001.) {    
           id[i]=jmin;
           jx[i]=xarray[jmin]; 
           jy[i]=yarray[jmin]; 
           jq[i]=qarray[jmin]; 
           jid[i]=idx[jmin];
        } 
    
    }  // i
  
    for (i=0;i<3;i++){
        if (jid[i] == -2) {
            xarray[i]=1001.;
            yarray[i]=1001.;
            qarray[i]=1001.;
            idx[i]=-1;
        } else {
            xarray[i]=jx[i];
            yarray[i]=jy[i];
            qarray[i]=jq[i];
            idx[i]=jid[i];
        }
    }

}


Int_t AliRICHRawCluster::PhysicsContribution()
{

// Type of physics processes

    Int_t iPhys=0;
    Int_t iBg=0;
    Int_t iMixed=0;
    for (Int_t i=0; i<fMultiplicity; i++) {
	if (fPhysicsMap[i]==2) iPhys++;
	if (fPhysicsMap[i]==1) iMixed++;
	if (fPhysicsMap[i]==0) iBg++;
    }
    if (iMixed==0 && iBg==0) {
	return 2;
    } else if ((iPhys != 0 && iBg !=0) || iMixed != 0) {
	return 1;
    } else {
	return 0;
    }
}