Iterateur_Source_Elem.h

/****************************************************************************
* Copyright (c) 2023, 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.
*
*****************************************************************************/
 
#ifndef Iterateur_Source_Elem_included
#define Iterateur_Source_Elem_included
 
#include <Iterateur_Source_base.h>
#include <Champ_Uniforme.h>
#include <TRUSTSingle.h>
 
template <class _TYPE_>
class Iterateur_Source_Elem : public Iterateur_Source_base
{
  inline unsigned taille_memoire() const override { throw; }
 
  inline int duplique() const override
  {
    Iterateur_Source_Elem* xxx = new  Iterateur_Source_Elem(*this);
    if(!xxx) Process::exit("Not enough memory !");
    return xxx->numero();
  }
 
public:
  DoubleTab& ajouter(DoubleTab& ) const override;
 
  void completer_() override { nb_elem_ = le_dom->nb_elem(); }
  inline Evaluateur_Source& evaluateur() override
  {
    Evaluateur_Source& eval = static_cast<Evaluateur_Source&>(evaluateur_source_elem);
    return eval;
  }
 
private:
  _TYPE_ evaluateur_source_elem;
  int nb_elem_;
 
  template <typename Type_Double> DoubleTab& ajouter_(const int, DoubleTab& ) const;
};
 
template<class _TYPE_>
DoubleTab& Iterateur_Source_Elem<_TYPE_>::ajouter(DoubleTab& resu) const
{
  ((_TYPE_&) (evaluateur_source_elem)).mettre_a_jour();
  assert(resu.nb_dim() < 3);
  const int ncomp = resu.line_size();
  DoubleVect& bilan = so_base->bilan();
  bilan = 0;
 
  (ncomp == 1) ? ajouter_<SingleDouble>(ncomp, resu) : ajouter_<ArrOfDouble>(ncomp, resu);
  return resu;
}
 
template<class _TYPE_> template<typename Type_Double>
DoubleTab& Iterateur_Source_Elem<_TYPE_>::ajouter_(const int ncomp, DoubleTab& resu) const
{
  Type_Double source(ncomp);
  DoubleVect& bilan = so_base->bilan();
  for (int num_elem = 0; num_elem < nb_elem_; num_elem++)
    {
      evaluateur_source_elem.calculer_terme_source(num_elem, source);
      for (int k = 0; k < ncomp; k++)
        {
          resu(num_elem, k) += source[k];
          bilan(k) += source[k];
        }
    }
  return resu;
}
 
#endif /* Iterateur_Source_Elem_included */