//
// Author : Anthony Geay (CEA/DEN)
-#ifndef __INTERPKERNELMESHQUALITY_HXX_
+#ifndef __INTERPKERNELMESHQUALITY_HXX__
#define __INTERPKERNELMESHQUALITY_HXX__
#include "INTERPKERNELDefines.hxx"
}
// Square and diamond intersecting with no degeneracy
// /\
- // / \
- // / \
- // __/______\__
- // | / \ |
- // |/ \|
+ // / \
+ // / \
+ // __/______\__
+ // | / \ |
+ // |/ \|
// / \
- // /| |\
- // \| |/
- // \ /
- // |\ /|
- // |_\________/_|
+ // /| |\
+ // \| |/
+ // \ /
+ // |\ /|
+ // |_\________/_|
// \ /
// \ /
// \ /
// Two diamonds intersecting at one vertex on edge and one double vertex
// /\ /\
// / \ / \
- // / ¤ \
+ // / � \
// / / \ \
// \ \ / /
// \ * /
(INTERP_KERNEL::checkEqualPolygons<std::vector<double>,2>(&actual_result, &expected_result, _Epsilon)));
} // square and diamond intersecting at four degenerated pointss
//
- // ²/²\
- // ² / ² \
- // ² / ² \
- // ² \ ² /
- // ² \ ² /
- // ²\²/
+ // �/�\
+ // � / � \
+ // � / � \
+ // � \ � /
+ // � \ � /
+ // �\�/
// \brief Status : pass
void SingleElementPlanarTests::diamondsCritical2()
// Two tangent hexagons with double vertices and a critical starting vertex on edge
// _________
- // / \²²²
- // ² \²
- // / \
- // / ² ² \
+ // / \���
+ // � \�
+ // / \
+ // / � � \
// \ /
- // \ ² ² /
+ // \ � � /
// \ /
- // \²_______²/
+ // \�_______�/
// \brief Status : pass
// Two tangent hexagons with double vertices and a critical starting vertex on edge
// _______
// / \
- // / \
+ // / \
// \ /
// \_______/
// / \
- // / \
+ // / \
// \ /
// \_______/
(INTERP_KERNEL::checkEqualPolygons<std::vector<double>,2>(&actual_result, &expected_result, _Epsilon)));
}
// Two diamonds sharing a vertex in an exclusion configuration
- // /\
- // / \
- // / \
- // / \
- // \ /
- // \ /
- // \ /
- // \/
- // /\
- // / \
- // / \
- // / \
- // \ /
- // \ /
- // \ /
- // \/
+ // /\
+ // / \
+ // / \
+ // / \
+ // \ /
+ // \ /
+ // \ /
+ // \/
+ // /\
+ // / \
+ // / \
+ // / \
+ // \ /
+ // \ /
+ // \ /
+ // \/
// \brief Status : pass
// ____
// /|\ /
// / | \/
- // / | /\
- // / |/ \
- // \ /
- // \ /
- // \ /
- // \ /
+ // / | /\
+ // / |/ \
+ // \ /
+ // \ /
+ // \ /
+ // \ /
// \brief Status : pass
void SingleElementPlanarTests:: triangleAndDiamondCritical()
// | |
// | |\ |
// | | \|
- // | | \
+ // | | \
// | | |\
// | | |/
// | | /
}
// Two triangles with a starting vertex on edge
- // /\ ²²²²
- // / ² ²
- // / ² ²
- // /__²___\
+ // /\ ����
+ // / � �
+ // / � �
+ // /__�___\
// \brief Status : pass
void SingleElementPlanarTests::trianglesCritical()
// /\ /\
// / \ / \
// / \ / \
- // /______\/______\
+ // /______\/______\
// \brief Status : pass
}
// Two triangles with double starting point in an outer tangency configuration
- // /\
- // / \
- // / \
- // /______\
+ // /\
+ // / \
+ // / \
+ // /______\
// \ /
// \ /
// \ /
const int num_zero = (c_yz*c_xh == 0.0 ? 1 : 0) + (c_zx*c_yh == 0.0 ? 1 : 0) + (c_xy*c_zh == 0.0 ? 1 : 0);
const int num_neg = (c_yz*c_xh < 0.0 ? 1 : 0) + (c_zx*c_yh < 0.0 ? 1 : 0) + (c_xy*c_zh < 0.0 ? 1 : 0);
- if((num_zero == 1 && num_neg != 1) || num_zero == 2 || num_neg == 0 && num_zero !=3 || num_neg == 3 )
+ if((num_zero == 1 && num_neg != 1) || num_zero == 2 || (num_neg == 0 && num_zero !=3) || num_neg == 3 )
{
++num_cases;
using namespace MEDCoupling;
-template class MEDCouplingFieldT<double>;
+template class MEDCoupling::MEDCouplingFieldT<double>;
/*!
* Creates a new MEDCouplingFieldDouble, of given spatial type and time discretization.
using namespace MEDCoupling;
-template class MEDCouplingFieldT<int>;
+template class MEDCoupling::MEDCouplingFieldT<int>;
MEDCouplingFieldInt *MEDCouplingFieldInt::New(TypeOfField type, TypeOfTimeDiscretization td)
{
using namespace MEDCoupling;
-template class MemArray<int>;
-template class MemArray<double>;
-template class DataArrayTemplate<int>;
-template class DataArrayTemplate<double>;
+template class MEDCoupling::MemArray<int>;
+template class MEDCoupling::MemArray<double>;
+template class MEDCoupling::DataArrayTemplate<int>;
+template class MEDCoupling::DataArrayTemplate<double>;
template<int SPACEDIM>
void DataArrayDouble::findCommonTuplesAlg(const double *bbox, int nbNodes, int limitNodeId, double prec, DataArrayInt *c, DataArrayInt *cI) const
using namespace MEDCoupling;
-template class MemArray<char>;
-template class DataArrayTemplate<char>;
+template class MEDCoupling::MemArray<char>;
+template class MEDCoupling::DataArrayTemplate<char>;
/*!
* Returns an integer value characterizing \a this array, which is useful for a quick
using namespace MEDCoupling;
-template class MEDCouplingTimeDiscretizationTemplate<double>;
-template class MEDCouplingTimeDiscretizationTemplate<int>;
+template class MEDCoupling::MEDCouplingTimeDiscretizationTemplate<double>;
+template class MEDCoupling::MEDCouplingTimeDiscretizationTemplate<int>;
const char MEDCouplingTimeDiscretizationInt::REPR[]="One time label.";
using namespace MEDCoupling;
-template class MEDFileField1TSTemplateWithoutSDA<int>;
-template class MEDFileField1TSTemplateWithoutSDA<double>;
+template class MEDCoupling::MEDFileField1TSTemplateWithoutSDA<int>;
+template class MEDCoupling::MEDFileField1TSTemplateWithoutSDA<double>;
const char MEDFileField1TSWithoutSDA::TYPE_STR[]="FLOAT64";
const char MEDFileIntField1TSWithoutSDA::TYPE_STR[]="INT32";
protected:
MeshOrStructMeshCls(int mid):_mid(mid) { }
public:
+ virtual ~MeshOrStructMeshCls() {}
int getID() const { return _mid; }
virtual std::vector<std::string> getAxisInfoOnMesh(med_idt fid, const std::string& mName, MEDCoupling::MEDCouplingMeshType& meshType, MEDCoupling::MEDCouplingAxisType& axType, int& nstep, int& Mdim, MEDFileString& description, MEDFileString& dtunit, MEDFileString& univName) const = 0;
virtual double checkMeshTimeStep(med_idt fid, const std::string& mName, int nstep, int dt, int it) const = 0;
{
public:
MEDFileWritable();
+ virtual ~MEDFileWritable() {}
void copyOptionsFrom(const MEDFileWritable& other) const;
int getTooLongStrPolicy() const;
void setTooLongStrPolicy(int newVal);
//0123456789012345678901234567890123456789012345678901234567890123456789
const size_t posE = 18;
std::string aStr (_curPos);
- if ( aStr.find('E') < 0 && aStr.find('e') < 0 )
+ if ( aStr.find('E') == std::string::npos && aStr.find('e') == std::string::npos )
{
if ( aStr.size() < posE+1 )
THROW_IK_EXCEPTION("No more doubles (line #" << lineNb() << ")");
{
using std::vector;
using MEDPARTITIONER::BBTreeOfDim;
- if (!&meshOne || !&meshTwo) return; //empty or not existing
+ //if (!&meshOne || !&meshTwo) return; //empty or not existing
double* bbox;
BBTreeOfDim* tree = 0;
int nv1=meshOne.getNumberOfNodes();
if ( !domainSelector || domainSelector->isMyDomain( idomain ) )
{
- if ( !_collection->getMesh()[idomain]->getNumberOfCells()==0 ) continue;//empty domain
+ // [ABN] spurious test in 8.2 - fixed as I think it should be:
+ if ( _collection->getMesh()[idomain]->getNumberOfCells() == 0 ) continue;
WriteUMesh(distfilename.c_str(),(_collection->getMesh())[idomain],true);
//writeSubdomain(idomain, nbdomains, distfilename.c_str(), domainSelector);
}
array_of_displacements[0] = 0 ;
array_of_displacements[1] = sizeof(double) ;
array_of_displacements[2] = 2*sizeof(double) ;
- MPI_Type_struct(3, array_of_blocklengths, array_of_displacements,
+ MPI_Type_create_struct(3, array_of_blocklengths, array_of_displacements,
array_of_types, &_MPI_TIME) ;
MPI_Type_commit(&_MPI_TIME) ;
}
int MPIAccess::cancel( int source, int theMPITag, MPI_Datatype datatype, int outcount, int &flag )
{
int sts ;
- MPI_Aint extent ;
+ MPI_Aint extent, lbound ;
flag = 0 ;
- sts = MPI_Type_extent( datatype , &extent ) ;
+ sts = MPI_Type_get_extent( datatype , &lbound, &extent ) ;
if ( sts == MPI_SUCCESS )
{
void * recvbuf = malloc( extent*outcount ) ;
// Returns the MPI size of a TimeMessage
MPI_Aint MPIAccess::timeExtent() const
{
- MPI_Aint aextent ;
- MPI_Type_extent( _MPI_TIME , &aextent ) ;
+ MPI_Aint aextent, lbound ;
+ MPI_Type_get_extent( _MPI_TIME , &lbound, &aextent ) ;
return aextent ;
}
// Returns the MPI size of a MPI_INT
MPI_Aint MPIAccess::intExtent() const
{
- MPI_Aint aextent ;
- MPI_Type_extent( MPI_INT , &aextent ) ;
+ MPI_Aint aextent, lbound ;
+ MPI_Type_get_extent( MPI_INT , &lbound, &aextent ) ;
return aextent ;
}
// Returns the MPI size of a MPI_DOUBLE
MPI_Aint MPIAccess::doubleExtent() const
{
- MPI_Aint aextent ;
- MPI_Type_extent( MPI_DOUBLE , &aextent ) ;
+ MPI_Aint aextent, lbound ;
+ MPI_Type_get_extent( MPI_DOUBLE , &lbound, &aextent ) ;
return aextent ;
}