TimeDistributionAlgorithm.cc

Go to the documentation of this file.

#include <utl/TimeDistributionAlgorithm.h>
#include <utl/TimeDistribution.h>

#include <utl/ErrorLogger.h>

#include <cmath>

using namespace utl;
using namespace std;


template<typename T>
double
TimeDistributionAlgorithm::Sum(const TimeDistribution<T>& td, const int bin1, const int bin2)
{
  const int rangeStart = max(td.GetStart(), min(bin1, bin2));
  const int rangeStop = min(td.GetStop(), max(bin1, bin2));

  if (td.fData.find(rangeStart) == td.fData.end() ||
      td.fData.find(rangeStop)  == td.fData.end())
    return 0;  // completely outside range containing valid data

  double sum = 0.0;
  typedef typename TimeDistribution<T>::InternalConstIterator TDCIt;
  const TDCIt mStop = ++(td.fData.find(rangeStop));
  for (TDCIt mIt = td.fData.find(rangeStart); mIt != mStop; ++mIt)
    sum += mIt->second;

  return sum;
}


template<typename T>
double
TimeDistributionAlgorithm::Mean(const TimeDistribution<T>& td, const int bin1, const int bin2)
{
  return Sum(td, bin1, bin2) / (abs(bin2 - bin1) + 1);
}


template<typename T>
double
TimeDistributionAlgorithm::RMS(const TimeDistribution<T>& td, const int bin1, const int bin2)
{
  const int rangeStart = max(td.GetStart(), min(bin1, bin2));
  const int rangeStop = min(td.GetStop(), max(bin1, bin2));

  if (td.fData.find(rangeStart) == td.fData.end() ||
      td.fData.find(rangeStop)  == td.fData.end())
    return 0;  // completely outside range containing valid data

  double v = 0;
  double v2 = 0;
  // ATTENTION use of td.fData can be replaced with use of SlotIterator once that is ready (I think)
  for (int i = rangeStart; i <= rangeStop; ++i) {
    const double slotContents = td.At(i);
    v += slotContents;
    v2 += slotContents * slotContents;
  }
  const int n = abs(bin2 - bin1) + 1;
  v /= n;
  v2 /= n;

  return sqrt(v2 - v*v);
}


template<typename T>
TimeDistributionAlgorithm::TupleD
TimeDistributionAlgorithm::MeanRMS(const TimeDistribution<T>& td, const int bin1, const int bin2)
{
  const int rangeStart = max(td.GetStart(), min(bin1, bin2));
  const int rangeStop = min(td.GetStop(), max(bin1, bin2));

  if (td.fData.find(rangeStart) == td.fData.end() ||
      td.fData.find(rangeStop)  == td.fData.end())
    return TupleD(0, 0);  // completely outside range containing valid data

  double v = 0;
  double v2 = 0;
  // ATTENTION use of td.fData can be replaced with use of SlotIterator once that is ready (I think)
  for (int i = rangeStart; i <= rangeStop; ++i) {
    const double slotContents = td.At(i);
    v += slotContents;
    v2 += slotContents * slotContents;
  }
  const int n = abs(bin2 - bin1) + 1;
  v /= n;
  v2 /= n;

  return TupleD(v, sqrt(v2 - v*v));
}


template<typename T>
double
TimeDistributionAlgorithm::Centroid(const TimeDistribution<T>& td, const int bin1, const int bin2)
{
  const int rangeStart = max(td.GetStart(), min(bin1, bin2));
  const int rangeStop = min(td.GetStop(), max(bin1, bin2));
  if (td.fData.find(rangeStart) == td.fData.end() ||
      td.fData.find(rangeStop)  == td.fData.end())
    return 0;  // completely outside range containing valid data

  double sum = 0;
  double val = 0;
  for (int i = rangeStart; i <= rangeStop; ++i) {
    const double slotContent = td.At(i);
    sum += slotContent;
    val += slotContent * i;
  }

  return val / sum;
}


// instantations
#define INST(T...) \
template double TimeDistributionAlgorithm::Sum(const TimeDistribution<T>& td, const int bin1, const int bin2); \
template double TimeDistributionAlgorithm::Mean(const TimeDistribution<T>& td, const int bin1, const int bin2); \
template double TimeDistributionAlgorithm::RMS(const TimeDistribution<T>& td, const int bin1, const int bin2); \
template TimeDistributionAlgorithm::TupleD TimeDistributionAlgorithm::MeanRMS(const TimeDistribution<T>& td, const int bin1, const int bin2); \
template double TimeDistributionAlgorithm::Centroid(const TimeDistribution<T>& td, const int bin1, const int bin2)

INST(int);
INST(double);

#undef INST


// Configure (x)emacs for this file ...
// Local Variables:
// mode: c++
// compile-command: "make -C .. -k"
// End: