Champ_Fonc_Tabule_Morceaux.cpp

/****************************************************************************
* Copyright (c) 2026, CEA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*****************************************************************************/
 
#include <Champ_Fonc_Tabule_Morceaux.h>
#include <Domaine.h>
#include <TRUSTTrav.h>
#include <Domaine_VF.h>
#include <TRUSTTab_parts.h>
 
Implemente_instanciable(Champ_Fonc_Tabule_Morceaux, "Champ_Fonc_Tabule_Morceaux|Champ_Tabule_Morceaux", TRUSTChamp_Morceaux_generique<Champ_Morceaux_Type::FONC_TABULE>);
// XD Champ_Fonc_Tabule_Morceaux champ_don_base Champ_Tabule_Morceaux NO_BRACE Field defined by tabulated data in each
// XD_CONT sub-domaine. It makes possible the definition of a field which is a function of other fields.
// XD attr domain_name ref_domaine domain_name REQ Name of the domain.
// XD attr nb_comp entier nb_comp REQ Number of field components.
// XD attr data bloc_lecture data REQ { Defaut val_def sous_domaine_1 val_1 ... sous_domaine_i val_i } By default, the
// XD_CONT value val_def is assigned to the field. It takes the sous_domaine_i identifier Sous_Domaine (sub_area) type
// XD_CONT object function, val_i. Sous_Domaine (sub_area) type objects must have been previously defined if the
// XD_CONT operator wishes to use a champ_fonc_tabule_morceaux type object.
 
Sortie& Champ_Fonc_Tabule_Morceaux::printOn(Sortie& os) const { return os << valeurs(); }
 
Entree& Champ_Fonc_Tabule_Morceaux::readOn(Entree& is)
{
  Nom nom, nom_ch;
  is >> nom;
  interprete_get_domaine(nom);
  mon_domaine->creer_tableau_elements(i_mor);
  i_mor = -1; // to crash if a sub-domain was forgotten
 
  int nbcomp;
  is >> nbcomp;
 
  fixer_nb_comp(nbcomp);
  valeurs_.resize(0, nbcomp);
  mon_domaine->creer_tableau_elements(valeurs_);
 
  is >> nom;
  if(nom != "{")
    Process::exit(que_suis_je() + " : { expected instead of " + nom);
 
  for (is >> nom; nom != "}"; is >> nom)
    {
      CHTAB ch_lu;
      /* 1. reading the subdomain */
      OBS_PTR(Sous_Domaine) refssz = les_sous_domaines.add(mon_domaine->ss_domaine(nom));
      Sous_Domaine& ssz = refssz.valeur();
 
      /* 2. reading the parameter fields */
      is >> nom, m_pb_ch.push_back({});
      if (nom != "{")
        {
          Cerr << "Errror reading old syntax: " << que_suis_je() << " " << domaine()->le_nom() << " " << nbcomp << " { " << ssz.le_nom() << " " << nom << " 1 { ... } ... }" << finl;
          Cerr << "New syntax is like :       " << que_suis_je() << " " << domaine()->le_nom() << " " << nbcomp << " { " << ssz.le_nom() << " { problem_name " << nom << " } { ... } ... }" << finl;
          Cerr << "Check the doc or release notes." << finl;
          Process::exit();
        }
      else for (is >> nom; nom != "}"; is >> nom)
          {
            is >> nom_ch;
            Nom nat = "";
            if (is_interp_) is >> nat;
            std::array<std::string, 3> pb_ch = { nom.getString(), nom_ch.getString(), nat.getString() };
            s_pb_ch.insert(pb_ch), m_pb_ch.back().push_back(pb_ch); //add to the lists for this piece and globally
          }
 
      const int nb_param = (int)m_pb_ch.back().size();
 
      is >> nom;
      if (nom != "{")
        Process::exit(que_suis_je() + " : { expected instead of " + nom);
 
      /* 1. reading the parameter grid */
      DoubleVects params;
      for (int n = 0; n < nb_param; n++)
        {
          const int nb_val = lire_dimension(is, que_suis_je());
          DoubleVect param(nb_val);
          for (int i = 0; i < nb_val; i++) is >> param[i];
          params.add(param);
        }
 
      /* 2. reading the parameter values */
      // total size of the value array
      int size = nbcomp;
      for (int n = 0; n < nb_param; n++) size *= params[n].size();
 
      // reading: everything into a 1D array
      DoubleVect tab_valeurs(size);
      for (int i = 0; i < size; i++) is >> tab_valeurs[i];
      ch_lu.la_table.remplir(params, tab_valeurs);
 
      is >> nom;
      if (nom != "}")
        Process::exit(que_suis_je() + " : } expected instead of "+ nom);
      for (int i = 0; i < ssz.nb_elem_tot(); i++) i_mor(ssz(i)) = (int)morceaux.size();
      morceaux.push_back(ch_lu);
    }
  if (mp_min_vect(i_mor) == -1)
    Process::exit(que_suis_je() + " : some pieces of the field are missing!");
 
  return is;
}
 
int Champ_Fonc_Tabule_Morceaux::initialiser(const double tps)
{
  /* fill ch_param (pointers to the fields) and i_ch (fields used by each piece) */
  std::vector<std::array<std::string, 3>> v_pb_ch(s_pb_ch.begin(), s_pb_ch.end()); //set -> vector
  for (auto &&pb_ch : v_pb_ch) /* (problem, field) -> pointers */
    {
      const Nom pb_nom = Nom(pb_ch[0]);
      const Probleme_base& pb = ref_cast(Probleme_base, Interprete::objet(pb_nom));
      const Champ_base& ch = pb.has_champ(Nom(pb_ch[1])) ? pb.get_champ(Nom(pb_ch[1])) : pb.get_champ_post(Nom(pb_ch[1])).get_champ(espace_stockage_);
      ch_param.push_back(&ch);
    }
  for (int i = 0; i < (int) m_pb_ch.size(); i++)
    for (auto && pb_ch : m_pb_ch[i]) /* indices */
      morceaux[i].i_ch.push_back((int)(std::lower_bound(v_pb_ch.begin(), v_pb_ch.end(), pb_ch) - v_pb_ch.begin()));
 
  m_pb_ch.clear();
  s_pb_ch.clear();
 
  return TRUSTChamp_Morceaux_generique<Champ_Morceaux_Type::FONC_TABULE>::initialiser(tps);
}
 
void Champ_Fonc_Tabule_Morceaux::mettre_a_jour(double time)
{
 
  DoubleTab& tab = valeurs(), vide;
  std::vector<const DoubleTab* > pval; /* parameter values */
  std::vector<DoubleTrav> tval; /* temporary arrays */
  std::vector<bool> is_multi; /* true if the corresponding field is multi-component */
  pval.reserve(ch_param.size()), tval.reserve(ch_param.size()), is_multi.reserve(ch_param.size());
  for (auto &&pch : ch_param)
    {
      ConstDoubleTab_parts part(pch->valeurs()); //to ignore auxiliary variables of PolyMAC_HFV
      if (tab.get_md_vector() == part[0].get_md_vector()) /* we are indeed at elements -> direct use */
        pval.push_back(&pch->valeurs());
      else /* otherwise -> compute values at elements and store in a tval array */
        {
          IntVect polys(tab.dimension_tot(0));
          for (int i = 0; i < tab.dimension_tot(0); i++) polys[i] = i;
          tval.push_back(DoubleTab(tab.dimension_tot(0), pch->nb_comp()));
          pch->valeur_aux_elems(pch->a_un_domaine_dis_base() ? ref_cast(Domaine_VF, pch->domaine_dis_base()).xp() : vide, polys, tval.back());
          pval.push_back(&tval.back());
        }
      is_multi.push_back(pval.back()->dimension(1) > 1);
    }
  std::vector<double> vals(ch_param.size());
  for (int e  = 0; e < mon_domaine->nb_elem(); e++)
    {
      const CHTAB& mor = morceaux[i_mor(e)];
      int N = tab.dimension(1), M = (int) mor.i_ch.size();
      if (N == 1 && M == 1)
        tab(e, 0) = mor.la_table.val_simple((*pval[mor.i_ch[0]])(e, 0));
      else for (int n = 0, m; n < N; n++)
          {
            for (vals.clear(), m = 0; m < M; m++) vals.push_back((*pval[mor.i_ch[m]])(e, n * is_multi[mor.i_ch[m]])); /* if the parameter field is multi-component, take the same component as the field */
            tab(e, n) = mor.la_table.val(vals, n);
          }
    }
  tab.echange_espace_virtuel();
}