Euclidian3GeometryService.cc

// -*- tab-width: 2; indent-tabs-mode: nil; coding: utf-8-with-signature -*-
//-----------------------------------------------------------------------------
// Copyright 2000-2026 CEA (www.cea.fr) IFPEN (www.ifpenergiesnouvelles.com)
// See the top-level COPYRIGHT file for details.
// SPDX-License-Identifier: Apache-2.0
//-----------------------------------------------------------------------------
#include <arcane/geometry/euclidian/Euclidian3GeometryService.h>
/* Author : havep at Wed Nov 14 13:55:36 2007
 * Generated by createNew
 */
 
#include <arcane/core/IMesh.h>
#include <arcane/core/IMeshSubMeshTransition.h>
#include <arcane/core/IItemFamily.h>
using namespace Arcane;
 
#include <arcane/geometry/euclidian/Euclidian3Geometry.h>
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
namespace Arcane::Numerics
{
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
/* A few words about possible optimizations:
 * Next possible optimizations (when necessary) are:
 * - Compute common properties on maximal group 
   (instead of re-computing the same property on all groups with shared items)
 * - Different properties may use the same computation. Then, maximal group factorization
 *   may be considered by a system of "what properties may compute this kernel" even if not
 *   shared by alls group in a maximal set.
 * - Mandatory storage parameter in addItemGroupProperty (up to now, this is optional)
 * - Geometry computations by constraints
   e.g.: for volume computations, we need face center on Quad4. This center is computed twice 
       for each shared face. Moreover, this computation may also be needed by the user.
 *  The idea is to define requirements for each geometry computation by kind and type.
 *  Then computations are done following the order of the weakest constraints.
 */
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
Euclidian3GeometryService::
Euclidian3GeometryService(const Arcane::ServiceBuildInfo& sbi)
: ArcaneEuclidian3GeometryObject(sbi)
, GeometryServiceBase()
, m_geometry(NULL)
{
  ;
}
 
Euclidian3GeometryService::
~Euclidian3GeometryService()
{
  if (m_geometry)
    delete m_geometry;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
void Euclidian3GeometryService::
init()
{
  if (m_geometry) {
    info() << className() << " already initialized";
    return;
  }
 
  // The current implementation is built upon the default mesh
  m_geometry = new Euclidian3Geometry(PRIMARYMESH_CAST(this->mesh())->nodesCoordinates());
 
  if (options()->variableSuffix.size() > 0) {
    setSuffix(options()->variableSuffix[0]);
  }
}
 
/*---------------------------------------------------------------------------*/
 
void Euclidian3GeometryService::
update(ItemGroup group)
{
  updateGroup(group, *m_geometry);
}
 
void Euclidian3GeometryService::
reset(ItemGroup group)
{
  ARCANE_UNUSED(group);
}
 
/*---------------------------------------------------------------------------*/
 
/*---------------------------------------------------------------------------*/
 
IGeometry*
Euclidian3GeometryService::
geometry()
{
  return m_geometry;
}
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
ARCANE_REGISTER_SERVICE_EUCLIDIAN3GEOMETRY(Euclidian3Geometry, Euclidian3GeometryService);
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
 
} // namespace Arcane::Numerics
 
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/