PreClustersDE.cxx

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.
 
#include "MIDClustering/PreClustersDE.h"
 
namespace o2
{
namespace mid
{
 
//______________________________________________________________________________
bool PreClustersDE::init()
{
 
  // prepare storage of PreClusters
  mPreClustersNBP.reserve(100);
  for (int icol = 0; icol < 7; ++icol) {
    mPreClustersBP[icol].reserve(20);
  }
 
  return true;
}
 
//______________________________________________________________________________
std::vector<int> PreClustersDE::getNeighbours(int icolumn, int idx) const
{
  std::vector<int> neighbours;
  if (icolumn == 6) {
    return neighbours;
  }
  const BP& pcB = mPreClustersBP[icolumn][idx];
  static constexpr double epsilon = 0.1;
  // The epsilon is used to reject strips that touches only in one corner
  for (int ib = 0; ib < mPreClustersBP[icolumn + 1].size(); ++ib) {
    const BP& neigh = mPreClustersBP[icolumn + 1][ib];
    if (neigh.area.getYmin() > pcB.area.getYmax() - epsilon) {
      continue;
    }
    if (neigh.area.getYmax() < pcB.area.getYmin() + epsilon) {
      continue;
    }
    neighbours.emplace_back(ib);
  }
  return neighbours;
}
 
//______________________________________________________________________________
void PreClustersDE::reset()
{
  mDEId = 99;
  mPreClustersNBP.clear();
  for (int icol = 0; icol < 7; ++icol) {
    mPreClustersBP[icol].clear();
  }
}
} // namespace mid
} // namespace o2