tkmanager.h

/********************************************************************************
 *   Copyright (c) : Université de Lyon 1, CNRS/IN2P3, UMR5822,                 *
 *                   IP2I, F-69622 Villeurbanne Cedex, France                   *
 *                   Normandie Université, ENSICAEN, UNICAEN, CNRS/IN2P3,       *
 *                   LPC Caen, F-14000 Caen, France                             *
 *   Contibutor(s) :                                                            *
 *      Jérémie Dudouet jeremie.dudouet@cnrs.fr [2020]                          *
 *      Diego Gruyer    diego.gruyer@cnrs.fr    [2020]                          *
 *                                                                              *
 *   Licensed under the MIT License <http://opensource.org/licenses/MIT>.       *   
 *   SPDX-License-Identifier: MIT                                               *
 ********************************************************************************/
 
#ifndef tkmanager_H
#define tkmanager_H
 
#include <map>
#include <mutex>
#include <functional>
#include <unordered_map>
#include <utility>
 
#include "tklevel_scheme.h"
#include "tknucleus.h"
#include "tkstring.h"
 
#ifdef HAS_ROOT
#include "TClass.h"
#endif
 
namespace tkn {
 

struct tkn_drip_point {
    int         Z {0};   
    int         N {0};   
    double      value_mev {std::numeric_limits<double>::quiet_NaN()};  
    double      sigma_mev {std::numeric_limits<double>::quiet_NaN()};  
    std::string type;    
 
    void print() {cout << "(Z,N) = " << Z << ", " << N << " : " << type << " = " << value_mev << " MeV, sigma = " << sigma_mev << endl;}
};
 
class tkmanager
{
    friend class tknucleus;
 
    static std::recursive_mutex& get_mutex() {
        static std::recursive_mutex mutex;
        return mutex;
    }
 
protected:
    std::map<tkstring, shared_ptr<tklevel_scheme>> fmap_of_level_scheme;
    std::map<tkstring, shared_ptr<std::once_flag>> fmap_of_level_scheme_once; 
    std::mutex flevel_scheme_load_mutex; 
 
    std::vector<shared_ptr<tknucleus>> fvector_of_nuclei;
 
    std::map<tkstring, shared_ptr<tknucleus>> fmap_of_nuclei;
    std::map<int, std::map<int, shared_ptr<tknucleus>>> fmap_of_nuclei_per_z_and_a;
    std::map<int, std::vector<shared_ptr<tknucleus>>> fmap_of_nuclei_per_z;
    std::map<int, std::vector<shared_ptr<tknucleus>>> fmap_of_nuclei_per_a;
    std::map<int, std::vector<shared_ptr<tknucleus>>> fmap_of_nuclei_per_n;
 
    std::map<int, tkstring> fmap_of_symbols;
 
    int fmax_level_id=0;
    int fmax_decay_id=0;

    std::unordered_map<std::string, std::vector<tkn_drip_point>> fdrip_lines;
 
public:
    static tkmanager* the_data_manager();
    tkmanager();
    virtual ~tkmanager();

    bool is_level_scheme_loaded(const tkstring &_nuc);

    void preload_level_schemes(bool _verbose=false);

    bool known_nucleus(tkstring _nuc){return fmap_of_nuclei.find(_nuc) != fmap_of_nuclei.end();}
    bool known_nucleus(int _z, int _a) {
        const auto isotopes = fmap_of_nuclei_per_z_and_a.find(_z);
        return isotopes != fmap_of_nuclei_per_z_and_a.end() &&
               isotopes->second.find(_a) != isotopes->second.end();
    }

    bool known_element(tkstring _nuc, int &_z);
    bool known_element(int _z) { return fmap_of_nuclei_per_z.count(_z); }
    const tkstring &get_element_symbol(int _charge){return fmap_of_symbols[_charge];}

    vector<shared_ptr<tknucleus> > get_nuclei(std::function<bool(shared_ptr<tknucleus>)>const& _selection);

    const vector<shared_ptr<tknucleus>> &get_nuclei(){return fvector_of_nuclei;}

    const std::map<tkstring, shared_ptr<tknucleus>> &get_map_of_nuclei(){return fmap_of_nuclei;}
    const std::map<int, std::vector<shared_ptr<tknucleus>>> &get_map_of_nuclei_per_z(){return fmap_of_nuclei_per_z;}
    const std::map<int, std::vector<shared_ptr<tknucleus>>> &get_map_of_nuclei_per_a(){return fmap_of_nuclei_per_a;}
    const std::map<int, std::vector<shared_ptr<tknucleus>>> &get_map_of_nuclei_per_n(){return fmap_of_nuclei_per_n;}

    const vector<shared_ptr<tknucleus>> &get_nuclei_for_z(int z){return fmap_of_nuclei_per_z[z];}
    const vector<shared_ptr<tknucleus>> &get_nuclei_for_a(int a){return fmap_of_nuclei_per_a[a];}
    const vector<shared_ptr<tknucleus>> &get_nuclei_for_n(int n){return fmap_of_nuclei_per_n[n];}

    shared_ptr<tknucleus> get_nucleus(const tkstring &_nuc) {
        const auto nucleus = fmap_of_nuclei.find(_nuc);
        return nucleus == fmap_of_nuclei.end() ? nullptr : nucleus->second;
    }

    shared_ptr<tknucleus> get_nucleus(int _z, int _a) {
        const auto isotopes = fmap_of_nuclei_per_z_and_a.find(_z);
        if (isotopes == fmap_of_nuclei_per_z_and_a.end()) return nullptr;
        const auto nucleus = isotopes->second.find(_a);
        return nucleus == isotopes->second.end() ? nullptr : nucleus->second;
    }

    int get_new_level_id();
    int get_new_decay_id();

    void set_max_level_id(int _id);
    void set_max_decay_id(int _id);

    std::vector<tkn_drip_point> get_drip_line(const std::string& _type, bool reduce_per_Z=true);
 
protected:
    void preload_nuclei();
    shared_ptr<tklevel_scheme> get_level_scheme(const tkstring &_nuc, int _zz, int _aa);

    void load_drip_lines(const tkstring& json_path);
 
#ifdef HAS_ROOT
    ClassDef(tkmanager,0)
#endif
 
};
}
 
#define gmanager (tkn::tkmanager::the_data_manager())
 
#endif