3 /**************************************************************************
4 * This file is property of and copyright by the ALICE HLT Project *
5 * All rights reserved. *
7 * Primary Authors: Oystein Djuvsland *
9 * Permission to use, copy, modify and distribute this software and its *
10 * documentation strictly for non-commercial purposes is hereby granted *
11 * without fee, provided that the above copyright notice appears in all *
12 * copies and that both the copyright notice and this permission notice *
13 * appear in the supporting documentation. The authors make no claims *
14 * about the suitability of this software for any purpose. It is *
15 * provided "as is" without express or implied warranty. *
16 **************************************************************************/
19 * @file AliHLTPHOSSanityInspector.cxx
20 * @author Oystein Djuvsland
22 * @brief Sanity inspector for PHOS HLT
25 // see header file for class documentation
27 // refer to README to build package
29 // visit http://web.ift.uib.no/~kjeks/doc/alice-hlt
31 #include "AliHLTPHOSSanityInspector.h"
34 ClassImp(AliHLTPHOSSanityInspector);
37 AliHLTPHOSSanityInspector::AliHLTPHOSSanityInspector() :
41 //See header file for documentation
45 AliHLTPHOSSanityInspector::~AliHLTPHOSSanityInspector()
47 //See header file for documentation
53 AliHLTPHOSSanityInspector::CheckInsanity(const UShort_t* data, const Int_t N) const
55 //See header file for documentation
57 for(Int_t i = 1; i < N; i++)
59 if((((Int_t)data[i] - (Int_t)data[i-1]) > fMaxDifference) || (((Int_t)data[i-1] - (Int_t)data[i]) > fMaxDifference))
67 AliHLTPHOSSanityInspector::CheckInsanity(Int_t* data, Int_t N)
69 //See header file for documentation
70 for(Int_t i = 1; i < N; i++)
72 if((((Int_t)data[i] - (Int_t)data[i-1]) > fMaxDifference) || (((Int_t)data[i-1] - (Int_t)data[i]) > fMaxDifference))
81 AliHLTPHOSSanityInspector::CheckAndHealInsanity(UShort_t* data, Int_t N)
83 //See header file for documentation
89 if((((Short_t)data[0] - (Short_t)data[1]) > fMaxDifference) || (((Short_t)data[1] - (Short_t)data[0]) > fMaxDifference))
91 if((((Short_t)data[1] - (Short_t)data[2]) > fMaxDifference) || (((Short_t)data[2] - (Short_t)data[1]) > fMaxDifference))
95 for(Short_t i = 2; i < N - 3; i++)
97 if((((Short_t)data[i] - (Short_t)data[i+1]) > fMaxDifference) || (((Short_t)data[i+1] - (Short_t)data[i]) > fMaxDifference))
100 if((((Short_t)data[i] -(Short_t)data[i+1]) > fMaxDifference) || (((Short_t)data[i+1] - (Short_t)data[i]) > fMaxDifference))
103 if((((Short_t)data[i] - (Short_t)data[i+1]) > fMaxDifference) || (((Short_t)data[i+1] - (Short_t)data[i]) > fMaxDifference))
105 return -2; //Too crazy
107 data[i-1] = ((Short_t)data[i] + (Short_t)data[i-2])/2;
111 return -3; //Two spikes in a row?
117 if((((Short_t)data[N - 3] -(Short_t) data[N - 2]) > fMaxDifference) ||
118 (((Short_t)data[N - 2] - (Short_t)data[N - 3]) > fMaxDifference))
120 if((((Short_t)data[N - 2] - (Short_t)data[N - 1]) > fMaxDifference) ||
121 (((Short_t)data[N - 1] - (Short_t)data[N - 2]) > fMaxDifference))
123 data[N - 2] = ((Short_t)data[N - 3] + (Short_t)data[N - 1])/2;
130 if((((Short_t)data[N - 2] - (Short_t)data[N - 1]) > fMaxDifference) ||
131 (((Short_t)data[N - 1] - (Short_t)data[N - 2]) > fMaxDifference))
133 // (Short_t)data[N - 3] = (Short_t)data[N - 4] -(Short_t) data[N - 5] + (Short_t)data[N-4];
134 data[N - 1] = data[N - 2];