Joints.cpp

/****************************************************************************
* Copyright (c) 2024, 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 <Joints.h>
 
Implemente_instanciable_32_64(Joints_32_64, "Joints", LIST(Joint_32_64<_T_>));
 
template <typename _SIZE_>
Sortie& Joints_32_64<_SIZE_>::printOn(Sortie& os) const { return LIST(Joint_32_64<_SIZE_>)::printOn(os); }
 
template <typename _SIZE_>
Entree& Joints_32_64<_SIZE_>::readOn(Entree& is) { return LIST(Joint_32_64<_SIZE_>)::readOn(is); }
 
/*! @brief Associates a domain with all joints in the list.
 *
 * The joints in the list will belong to this domain.
 *
 * @param un_domaine The domain to associate with the joints.
 */
template <typename _SIZE_>
void Joints_32_64<_SIZE_>::associer_domaine(const Domaine_t& un_domaine)
{
  for (auto& itr : *this) itr.associer_domaine(un_domaine);
}
 
/*! @brief Returns the total number of faces in all Joints_32_64 in the list.
 *
 * This is the sum of faces over all joints in the list.
 *
 * @return Total number of faces across all joints in the list.
 */
template <typename _SIZE_>
_SIZE_ Joints_32_64<_SIZE_>::nb_faces() const
{
  int_t nombre = 0;
  for (const auto &itr : *this) nombre += itr.nb_faces();
 
  return nombre;
}
 
/*! @brief Returns the number of faces of the specified type contained in the joint list.
 *
 * This is the sum of faces of the given type over all joints in the list.
 *
 * @param type The face type to count.
 * @return Number of faces of the specified type contained in the joint list.
 */
template <typename _SIZE_>
_SIZE_ Joints_32_64<_SIZE_>::nb_faces(Type_Face type) const
{
  int_t nombre = 0;
  for (const auto &itr : *this)
    if (type == itr.faces().type_face())
      nombre += itr.nb_faces();
 
  return nombre;
}
 
/*! @brief Compresses the joint list by merging joints sharing the same neighboring PE.
 *
 */
template <typename _SIZE_>
void Joints_32_64<_SIZE_>::comprimer()
{
  Cerr << "Joints_32_64<_SIZE_>::comprimer() - Start" << finl;
  IntVect fait(this->size());
  int rang1 = 0, rang2 = 0;
 
  auto& list = this->get_stl_list();
  for (auto &itr : list)
    {
      if (!fait(rang1))
        {
          fait(rang1) = 1;
          Joint_t& joint1 = itr;
          rang2 = rang1;
 
          for (auto &itr2 : list)
            {
              if (!fait(rang2))
                {
                  Joint_t& joint2 = itr2;
                  if (joint1.PEvoisin() == joint2.PEvoisin())
                    {
                      Cerr << "agglomeration of joints " << joint1.le_nom() << " and " << joint2.le_nom() << finl;
                      fait(rang2) = 1;
                      joint1.nommer(joint1.le_nom() + joint2.le_nom());
 
                      // Concatenation of faces
                      joint1.ajouter_faces(joint2.les_sommets_des_faces());
 
                      // Concatenation of vertices ???
                      Cerr << "Concatenation of nodes ?" << finl;
                      Process::exit();
 
                      joint2.dimensionner(0);
                    }
                }
              rang2++;
            }
        }
      ++rang1;
    }
 
  for (auto itr = list.begin(); itr != list.end(); )
    {
      Joint_t& joint1 = *itr;
      if (joint1.nb_faces() == 0)
        itr = list.erase(itr);
      else
        ++itr;
    }
  Cerr << "Joints_32_64<_SIZE_>::comprimer() - End" << finl;
}
 
/*! @brief Returns a reference to the joint whose neighboring PE is the specified one.
 *
 * @param pe A PE index.
 * @return Reference to the joint whose neighboring PE is pe.
 * @throws Error if the specified neighboring PE is not found in the joint list.
 */
template <typename _SIZE_>
typename Joints_32_64<_SIZE_>::Joint_t& Joints_32_64<_SIZE_>::joint_PE(int pe)
{
  for (auto &itr : *this)
    {
      Joint_t& joint = itr;
      int pe_joint = joint.PEvoisin();
      if (pe == pe_joint) return joint;
    }
  Cerr << "Error in Joints_32_64<_SIZE_>::joint_PE : joint not found" << finl;
  Process::exit();
  throw;
}
 
 
template class Joints_32_64<int>;
#if INT_is_64_ == 2
template class Joints_32_64<trustIdType>;
#endif