DTOccupancyCluster.h

Go to the documentation of this file.

#ifndef DTOccupancyCluster_H
#define DTOccupancyCluster_H

#include "DTOccupancyPoint.h"

#include <vector>
#include <string>
#include <math.h>
#include <set>

class TH2F;

class DTOccupancyCluster {
public:
  // Contruct the cluster from a couple of point
  DTOccupancyCluster(const DTOccupancyPoint& firstPoint, const DTOccupancyPoint& secondPoint);

  // Contruct the cluster from a single point: you can not add points to such a cluster
  DTOccupancyCluster(const DTOccupancyPoint& singlePoint);

  virtual ~DTOccupancyCluster();

  // Operations
  
  bool isValid() const;

  bool addPoint(const DTOccupancyPoint& anotherPoint);

  double distance(const DTOccupancyPoint& point) const;

  double averageMean() const;

  double averageRMS() const;

  double maxMean() const;
  
  double maxRMS() const;

  TH2F * getHisto(std::string histoName, int nBinsX, double minX, double maxX,
          int nBinsY, double minY, double maxY, int fillColor) const;

  int nPoints() const;

  std::set<DTLayerId> getLayerIDs() const;

protected:

private:
  
  bool qualityCriterion(const DTOccupancyPoint& firstPoint, const DTOccupancyPoint& secondPoint);
  
  bool  qualityCriterion(const DTOccupancyPoint& anotherPoint);

  void computeRadius();

  bool theValidity;
  double radius;
  std::vector<DTOccupancyPoint> thePoints;

  double theMaxMean;
  double theMaxRMS;
  double theMeanSum;
  double theRMSSum;

};

bool clusterIsLessThan(const DTOccupancyCluster& clusterOne, const DTOccupancyCluster& clusterTwo);

#endif