PreClusterFinder.h

Go to the documentation of this file.

// Copyright 2019-2020 CERN and copyright holders of ALICE O2.
// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders.
// All rights not expressly granted are reserved.
//
// This software is distributed under the terms of the GNU General Public
// License v3 (GPL Version 3), copied verbatim in the file "COPYING".
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
 
 
#ifndef O2_MCH_PRECLUSTERFINDER_H_
#define O2_MCH_PRECLUSTERFINDER_H_
 
#include "DataFormatsMCH/Digit.h"
#include "MCHBase/ErrorMap.h"
#include "MCHBase/PreCluster.h"
#include <cassert>
#include <cstdint>
#include <gsl/span>
#include <memory>
#include <unordered_map>
#include <utility>
#include <vector>
#include <map>
 
namespace o2
{
namespace mch
{
 
class PreClusterFinder
{
 public:
  PreClusterFinder();
  ~PreClusterFinder();
 
  PreClusterFinder(const PreClusterFinder&) = delete;
  PreClusterFinder& operator=(const PreClusterFinder&) = delete;
  PreClusterFinder(PreClusterFinder&&) = delete;
  PreClusterFinder& operator=(PreClusterFinder&&) = delete;
 
  void init();
  void deinit();
  void reset();
 
  void loadDigits(gsl::span<const Digit> digits);
  void loadDigit(const Digit& digit);
 
  int discardHighOccupancy(bool perDE, bool perEvent);
 
  int run();
 
  void getPreClusters(std::vector<o2::mch::PreCluster>& preClusters, std::vector<Digit>& digits);
 
  ErrorMap& getErrorMap() { return mErrorMap; }
 
 private:
  struct DetectionElement;
 
  struct PreCluster {
    uint16_t firstPad; // index of first associated pad in the orderedPads array
    uint16_t lastPad;  // index of last associated pad in the orderedPads array
    float area[2][2];  // 2D area containing the precluster
    bool useMe;        // false if precluster already merged to another one
    bool storeMe;      // true if precluster to be saved (merging result)
  };
 
  void reset(int deIndex);
 
  void preClusterizeRecursive();
  void addPad(DetectionElement& de, uint16_t iPad, PreCluster& cluster);
 
  int mergePreClusters();
  void mergePreClusters(PreCluster& cluster, std::vector<std::unique_ptr<PreCluster>> preClusters[2],
                        int nPreClusters[2], DetectionElement& de, int iPlane, PreCluster*& mergedCluster);
  PreCluster* usePreClusters(PreCluster* cluster, DetectionElement& de);
  void mergePreClusters(PreCluster& cluster1, PreCluster& cluster2, DetectionElement& de);
 
  bool areOverlapping(PreCluster& cluster1, PreCluster& cluster2, DetectionElement& de, float precision);
 
  void createMapping();
 
  static constexpr int SNDEs = 156; 
 
  std::vector<std::unique_ptr<DetectionElement>> mDEs; 
  std::unordered_map<int, int> mDEIndices{};           
 
  int mNPreClusters[SNDEs][2]{};                                     
  std::vector<std::unique_ptr<PreCluster>> mPreClusters[SNDEs][2]{}; 
 
  ErrorMap mErrorMap{}; 
};
 
} // namespace mch
} // namespace o2
 
#endif // O2_MCH_PRECLUSTERFINDER_H_