CaSearchWindowMapContainer.h

Go to the documentation of this file.

/* Copyright (C) 2025 GSI Helmholtzzentrum fuer Schwerionenforschung, Darmstadt
   SPDX-License-Identifier: GPL-3.0-only
   Authors: Sergei Zharko [committer] */

 
#pragma once
 
#include "CaDefs.h"
#include "CaDoubletSearchWindowMap.h"
#include "CaTripletSearchWindowMap.h"
 
#include <boost/serialization/array.hpp>
 
#include <string>
 
namespace cbm::algo::ca
{
  class SearchWindowMapContainer {
    friend class boost::serialization::access;
 
   public:
    static constexpr int kMaxNofIterations  = constants::size::MaxNiterations;     
    static constexpr int kMaxNofStations    = constants::size::MaxNstations;       
    static constexpr int kMaxNofTripletGaps = constants::size::MaxTripletGap + 1;  
 
    static constexpr size_t kNofDoubletSw{kMaxNofIterations * kMaxNofStations * kMaxNofTripletGaps};
    static constexpr size_t kNofTripletSw{kNofDoubletSw * kMaxNofTripletGaps};
 
    using DoubletSwContainer_t = std::array<DoubletSearchWindowMap, kNofDoubletSw>;  
    using TripletSwContainer_t = std::array<TripletSearchWindowMap, kNofTripletSw>;  

    DoubletSearchWindowMap& DoubletSw(int iIter, int iSta, int iGap)
    {
      return fDoubletSwMaps[DoubletSwIndex(iIter, iSta, iGap)];
    }

    const DoubletSearchWindowMap& DoubletSw(int iIter, int iSta, int iGap) const
    {
      return fDoubletSwMaps[DoubletSwIndex(iIter, iSta, iGap)];
    }

    TripletSearchWindowMap& TripletSw(int iIter, int iSta, int iGapL, int iGapM)
    {
      return fTripletSwMaps[TripletSwIndex(iIter, iSta, iGapL, iGapM)];
    }

    const TripletSearchWindowMap& TripletSw(int iIter, int iSta, int iGapL, int iGapM) const
    {
      return fTripletSwMaps[TripletSwIndex(iIter, iSta, iGapL, iGapM)];
    }
 
   private:
    DoubletSwContainer_t fDoubletSwMaps = {};  
    TripletSwContainer_t fTripletSwMaps = {};  

    [[gnu::always_inline]] static size_t DoubletSwIndex(int iIter, int iSta, int iGap)
    {
      assert(iIter >= 0 && iIter < kMaxNofIterations);
      assert(iSta >= 0 && iSta < kMaxNofStations);
      assert(iGap >= 0 && iGap < kMaxNofTripletGaps);
      return kMaxNofTripletGaps * (kMaxNofStations * iIter + iSta) + iGap;
    }

    [[gnu::always_inline]] static size_t TripletSwIndex(int iIter, int iSta, int iGapL, int iGapM)
    {
      assert(iIter >= 0 && iIter < kMaxNofIterations);
      assert(iSta >= 0 && iSta < kMaxNofStations);
      assert(iGapL >= 0 && iGapL < kMaxNofTripletGaps);
      assert(iGapM >= 0 && iGapM < kMaxNofTripletGaps);
      return kMaxNofTripletGaps * (kMaxNofTripletGaps * (kMaxNofStations * iIter + iSta) + iGapL) + iGapM;
    }

    template<class Archive>
    void serialize(Archive& ar, const unsigned int)
    {
      ar& fDoubletSwMaps;
      ar& fTripletSwMaps;
    }
  };
}  // namespace cbm::algo::ca