ClusterCache.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
#pragma once
 
#include <deque>
#include <pxd/reconstruction/ClusterCandidate.h>
 
namespace Belle2 {
  namespace PXD {
 
    class ClusterCache {
    public:
      typedef std::deque<ClusterCandidate>::iterator iterator;
      typedef std::deque<ClusterCandidate>::const_iterator const_iterator;
 
      enum {
        c_defaultNumberColumns = 250
      };
      explicit ClusterCache(unsigned int maxU = c_defaultNumberColumns);
 
      ClusterCache(const ClusterCache&) = delete;
 
      ClusterCache& operator=(const ClusterCache&) = delete;
 
      ~ClusterCache();
      void clear();
 
      ClusterCandidate& findCluster(unsigned int u, unsigned int v);
 
      std::deque<ClusterCandidate>::iterator begin() { return m_clusters.begin(); }
      std::deque<ClusterCandidate>::iterator end() { return m_currCluster; }
 
      bool empty() const { return m_clusters.begin() == m_currCluster; }
 
    private:
 
      ClusterCandidate* mergeCluster(ClusterCandidate* cls1, ClusterCandidate* cls2);
 
      void switchRow(unsigned int v);
 
      const unsigned int m_maxU;
      unsigned int m_curV;
      ClusterCandidate** m_clsTop;
      ClusterCandidate** m_clsCur;
      std::deque<ClusterCandidate> m_clusters;
      std::deque<ClusterCandidate>::iterator m_currCluster;
    };
 
  }
 
}