From fc36c1d1bafdaa75f81c8cb7861ba05639f73516 Mon Sep 17 00:00:00 2001 From: eap Date: Mon, 25 Jun 2018 14:27:26 +0300 Subject: [PATCH] Typo-fix by Kunda http://www.salome-platform.org/forum/forum_9/625363577 --- doc/developer/doxygen/doxfiles/reference/cpp/cpp.dox | 2 +- .../doxfiles/reference/interpolation/Geometric2D.dox | 6 +++--- .../doxfiles/reference/medloader/MEDLoaderAdvancedAPI.dox | 2 +- doc/tutorial/atestMEDCouplingCube.rst | 2 +- doc/tutorial/medcoupling_3Dcube.rst | 4 ++-- src/INTERP_KERNEL/ExprEval/InterpKernelUnit.hxx | 2 +- src/INTERP_KERNEL/GenMathFormulae.hxx | 4 ++-- src/INTERP_KERNEL/InterpKernelCellSimplify.cxx | 2 +- src/INTERP_KERNEL/InterpolationUtils.hxx | 6 +++--- src/MEDCoupling/MEDCoupling1GTUMesh.cxx | 2 +- src/MEDCoupling/MEDCouplingFieldDiscretization.cxx | 4 ++-- src/MEDCoupling/MEDCouplingMemArray.cxx | 6 +++--- src/MEDCoupling/MEDCouplingStructuredMesh.cxx | 2 +- src/MEDCoupling/MEDCouplingTimeLabel.hxx | 2 +- src/MEDCoupling/MEDCouplingUMesh.cxx | 4 ++-- src/MEDCoupling/MEDCouplingUMesh_intersection.cxx | 4 ++-- src/MEDLoader/MEDFileField1TS.cxx | 2 +- src/MEDLoader/MEDFileFieldInternal.cxx | 4 ++-- src/MEDLoader/MEDFileMesh.cxx | 4 ++-- src/MEDLoader/MEDFileMeshSupport.cxx | 2 +- src/MEDLoader/SauvMedConvertor.hxx | 2 +- src/MEDLoader/SauvWriter.cxx | 2 +- src/MEDLoader/Swig/MEDLoaderTest1.py | 2 +- src/MEDLoader/Swig/MEDLoaderTest3.py | 6 +++--- src/MEDLoader/Swig/MEDLoaderTest4.py | 4 ++-- src/ParaMEDMEM/OverlapMapping.cxx | 2 +- 26 files changed, 42 insertions(+), 42 deletions(-) diff --git a/doc/developer/doxygen/doxfiles/reference/cpp/cpp.dox b/doc/developer/doxygen/doxfiles/reference/cpp/cpp.dox index c2c8d4774..27e610c16 100644 --- a/doc/developer/doxygen/doxfiles/reference/cpp/cpp.dox +++ b/doc/developer/doxygen/doxfiles/reference/cpp/cpp.dox @@ -11,7 +11,7 @@ visible to the Python user. \ref MEDCoupling "MEDCoupling namespace". The true parallel functionalities of the \ref library "MED library" are detailed here: \ref parallel -The memory management of the various strucutres is eased by the class +The memory management of the various structures is eased by the class \ref MEDCoupling::MCAuto "MCAuto". It acts as an auto pointer and takes care of deleting the memory automatically when going out of scope. See an example usage in \ref cpp_mcfielddouble_WriteVTK . Beware however that not all functions return a pointer that should be deleted when going out of scope. diff --git a/doc/developer/doxygen/doxfiles/reference/interpolation/Geometric2D.dox b/doc/developer/doxygen/doxfiles/reference/interpolation/Geometric2D.dox index 3ddb29c31..d8dab31cd 100644 --- a/doc/developer/doxygen/doxfiles/reference/interpolation/Geometric2D.dox +++ b/doc/developer/doxygen/doxfiles/reference/interpolation/Geometric2D.dox @@ -209,11 +209,11 @@ right one \a P2 has 4 edges too. \image html SampGeo2D1.png "An example of intersection of 2 polygons." \image latex SampGeo2D1.eps "An example of intersection of 2 polygons." -After \ref interpkernelGeo2DBoolOpStep1 "spliting process" \a P1 has 6 edges and \a P2 has 6 edges too. +After \ref interpkernelGeo2DBoolOpStep1 "splitting process" \a P1 has 6 edges and \a P2 has 6 edges too. \anchor interpkernelGeo2DEx2 -\image html SampGeo2D2.png "After spliting process two edges of P1 have been located has out." -\image latex SampGeo2D2.eps "After spliting process two edges of P1 have been located has out." +\image html SampGeo2D2.png "After splitting process two edges of P1 have been located has out." +\image latex SampGeo2D2.eps "After splitting process two edges of P1 have been located has out." \note BLUE is for OUT, GREEN for IN and RED for ON. diff --git a/doc/developer/doxygen/doxfiles/reference/medloader/MEDLoaderAdvancedAPI.dox b/doc/developer/doxygen/doxfiles/reference/medloader/MEDLoaderAdvancedAPI.dox index 39171b8eb..7fcf0598f 100644 --- a/doc/developer/doxygen/doxfiles/reference/medloader/MEDLoaderAdvancedAPI.dox +++ b/doc/developer/doxygen/doxfiles/reference/medloader/MEDLoaderAdvancedAPI.dox @@ -184,7 +184,7 @@ Generally speaking traduce get* methods with set* methods have corresponding wri Some differences still exist : -- \c setMeshAtLevel, \c setMeshAtLevelOld simply call \c setMeshAtLevelGen with repectively \c newOrOld parameter +- \c setMeshAtLevel, \c setMeshAtLevelOld simply calls \c setMeshAtLevelGen with subsequent \c newOrOld parameter set to true and false. These methods specify if a renumbering computation is needed or not. \c setMeshAtLevelOld is faster than \c setMeshAtLevel because no renumbering computation is done. If the user is not warranty about the order of its meshes to enter it is better to use \c setMeshAtLevel method. diff --git a/doc/tutorial/atestMEDCouplingCube.rst b/doc/tutorial/atestMEDCouplingCube.rst index e8e3ddd25..e5bafe8f7 100644 --- a/doc/tutorial/atestMEDCouplingCube.rst +++ b/doc/tutorial/atestMEDCouplingCube.rst @@ -12,7 +12,7 @@ from math import * - # Definition of environnement variables + # Definition of environment variables spaceDimension = 3 N = 4 nbOfNodes = N*N*N diff --git a/doc/tutorial/medcoupling_3Dcube.rst b/doc/tutorial/medcoupling_3Dcube.rst index b589fb503..de10a56b9 100644 --- a/doc/tutorial/medcoupling_3Dcube.rst +++ b/doc/tutorial/medcoupling_3Dcube.rst @@ -45,7 +45,7 @@ First instantiate a meshing object. Therefore, we need to define : * its dimension * its number of cells -.. note:: All this initialisation are necessary. If one lacks, you will have a segmentation fault!. +.. note:: All this initialisation is necessary. If one is missing, you'll have a segmentation fault!. :: @@ -290,7 +290,7 @@ General Case Multi mesh Case ```````````````` -In spite of a MEDCoupling mesh has only one dimension, it's possible to genrate a file with multi dimension. +In spite of a MEDCoupling mesh has only one dimension, it's possible to generate a file with multi dimension. Therefore, you need to create as meshes as necessary dimensions. You have to give the connectivity of the faces on the bottom face of the 3D cube: the list of the nodes which belong to the face. diff --git a/src/INTERP_KERNEL/ExprEval/InterpKernelUnit.hxx b/src/INTERP_KERNEL/ExprEval/InterpKernelUnit.hxx index 797a1ea2d..aaab69514 100644 --- a/src/INTERP_KERNEL/ExprEval/InterpKernelUnit.hxx +++ b/src/INTERP_KERNEL/ExprEval/InterpKernelUnit.hxx @@ -84,7 +84,7 @@ namespace INTERP_KERNEL /*! * This class deals with units. * This class has two main responsibilities : - * - interprete units by giving simply their representation in string type. + * - interpret units by giving simply their representation in string type. * - performing operations on these units. * * All the possible units are represented with a unique tuple with 5 elements diff --git a/src/INTERP_KERNEL/GenMathFormulae.hxx b/src/INTERP_KERNEL/GenMathFormulae.hxx index dbb9df519..1bdf284a6 100644 --- a/src/INTERP_KERNEL/GenMathFormulae.hxx +++ b/src/INTERP_KERNEL/GenMathFormulae.hxx @@ -28,7 +28,7 @@ namespace INTERP_KERNEL { /*! - * This method computes eigenvalues of a 3x3 symmetric matrix stored with 6 values in 'matrix'. The convension chosen for 'matrix' is described here: + * This method computes eigenvalues of a 3x3 symmetric matrix stored with 6 values in 'matrix'. The convention chosen for 'matrix' is described here: * matrix[0]=m_xx, matrix[1]=m_yy, matrix[2]=m_zz, * matrix[3]=m_xy, matrix[4]=m_yz, matrix[5]=m_xz * This method returns the 3 eigenvalues in 'eigenVals'. @@ -55,7 +55,7 @@ namespace INTERP_KERNEL } /*! - * This method computes one eigenvector of a 3x3 symmetric matrix stored with 6 values in 'matrix'. The convension chosen for 'matrix' is described here: + * This method computes one eigenvector of a 3x3 symmetric matrix stored with 6 values in 'matrix'. The convention chosen for 'matrix' is described here: * matrix[0]=m_xx, matrix[1]=m_yy, matrix[2]=m_zz, * matrix[3]=m_xy, matrix[4]=m_yz, matrix[5]=m_xz * This method returns the eigenvector of the corresponding eigenvalue in 'eigenVal'. The returned eigenValue is normalized. diff --git a/src/INTERP_KERNEL/InterpKernelCellSimplify.cxx b/src/INTERP_KERNEL/InterpKernelCellSimplify.cxx index f524d215c..40fad8559 100644 --- a/src/INTERP_KERNEL/InterpKernelCellSimplify.cxx +++ b/src/INTERP_KERNEL/InterpKernelCellSimplify.cxx @@ -280,7 +280,7 @@ bool CellSimplify::isWellOriented(const int *baseFace, int *retConn, const int * /*! * This method is trying to permute the connectivity of 'oppFace' face so that the k_th node of 'baseFace' is associated to the * k_th node in retConnOfOppFace. Excluded faces 'baseFace' and 'oppFace' all the other faces in 'conn' must be QUAD4 faces. - * If the arragement process succeeds true is returned and retConnOfOppFace is filled. + * If the arrangement process succeeds true is returned and retConnOfOppFace is filled. */ bool CellSimplify::tryToArrangeOppositeFace(const int *conn, int lgth, int lgthBaseFace, const int *baseFace, const int *oppFace, int nbOfFaces, int *retConnOfOppFace) { diff --git a/src/INTERP_KERNEL/InterpolationUtils.hxx b/src/INTERP_KERNEL/InterpolationUtils.hxx index fad2faea7..70d4ca9b8 100644 --- a/src/INTERP_KERNEL/InterpolationUtils.hxx +++ b/src/INTERP_KERNEL/InterpolationUtils.hxx @@ -406,7 +406,7 @@ namespace INTERP_KERNEL double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11; // vector double r11 = p[0]-triaCoords[2*SPACEDIM], r12 = p[1]-triaCoords[2*SPACEDIM+1]; - // barycentric coordinates: mutiply matrix by vector + // barycentric coordinates: multiply matrix by vector bc[0] = (t11 * r11 + t12 * r12)/Tdet; bc[1] = (t21 * r11 + t22 * r12)/Tdet; bc[2] = 1. - bc[0] - bc[1]; @@ -448,7 +448,7 @@ namespace INTERP_KERNEL double t11 = T22, t12 = -T12, t21 = -T21, t22 = T11; // vector double r11 = p[_XX]-n[2][_XX], r12 = p[_YY]-n[2][_YY]; - // barycentric coordinates: mutiply matrix by vector + // barycentric coordinates: multiply matrix by vector bc[0] = (t11 * r11 + t12 * r12)/Tdet; bc[1] = (t21 * r11 + t22 * r12)/Tdet; bc[2] = 1. - bc[0] - bc[1]; @@ -1208,7 +1208,7 @@ namespace INTERP_KERNEL (XA[0]*XB[1]-XA[1]*XB[0])*XC[2]; } - /*! Subroutine of checkEqualPolygins that tests if two list of nodes (not necessarily distincts) describe the same polygon, assuming they share a comon point.*/ + /*! Subroutine of checkEqualPolygins that tests if two list of nodes (not necessarily distincts) describe the same polygon, assuming they share a common point.*/ /*! Indexes istart1 and istart2 designate two points P1 in L1 and P2 in L2 that have identical coordinates. Generally called with istart1=0.*/ /*! Integer sign ( 1 or -1) indicate the direction used in going all over L2. */ template diff --git a/src/MEDCoupling/MEDCoupling1GTUMesh.cxx b/src/MEDCoupling/MEDCoupling1GTUMesh.cxx index 93b403949..7f7decbd5 100644 --- a/src/MEDCoupling/MEDCoupling1GTUMesh.cxx +++ b/src/MEDCoupling/MEDCoupling1GTUMesh.cxx @@ -3381,7 +3381,7 @@ MEDCoupling1DGTUMesh *MEDCoupling1DGTUMesh::copyWithNodalConnectivityPacked(bool /*! * This method allows to compute, if needed, the packed nodal connectivity pair. - * Indeed, it is possible to store in \a this a nodal connectivity array bigger than ranges convered by nodal connectivity index array. + * Indeed, it is possible to store in \a this a nodal connectivity array bigger than ranges covered by nodal connectivity index array. * It is typically the case when nodalConnIndx starts with an id greater than 0, and finishes with id less than number of tuples in \c this->_conn. * * If \a this looks packed (the front of nodal connectivity index equal to 0 and back of connectivity index equal to number of tuple of nodal connectivity array) diff --git a/src/MEDCoupling/MEDCouplingFieldDiscretization.cxx b/src/MEDCoupling/MEDCouplingFieldDiscretization.cxx index cb3824a3c..92bed51db 100644 --- a/src/MEDCoupling/MEDCouplingFieldDiscretization.cxx +++ b/src/MEDCoupling/MEDCouplingFieldDiscretization.cxx @@ -1742,7 +1742,7 @@ void MEDCouplingFieldDiscretizationGauss::getValueOn(const DataArrayDouble *arr, void MEDCouplingFieldDiscretizationGauss::getValueOnPos(const DataArrayDouble *arr, const MEDCouplingMesh *mesh, int i, int j, int k, double *res) const { - throw INTERP_KERNEL::Exception("getValueOnPos(i,j,k) : Not applyable for Gauss points !"); + throw INTERP_KERNEL::Exception("getValueOnPos(i,j,k) : Not applicable for Gauss points !"); } DataArrayDouble *MEDCouplingFieldDiscretizationGauss::getValueOnMulti(const DataArrayDouble *arr, const MEDCouplingMesh *mesh, const double *loc, int nbOfPoints) const @@ -2634,7 +2634,7 @@ void MEDCouplingFieldDiscretizationGaussNE::getValueOn(const DataArrayDouble *ar void MEDCouplingFieldDiscretizationGaussNE::getValueOnPos(const DataArrayDouble *arr, const MEDCouplingMesh *mesh, int i, int j, int k, double *res) const { - throw INTERP_KERNEL::Exception("getValueOnPos(i,j,k) : Not applyable for Gauss points !"); + throw INTERP_KERNEL::Exception("getValueOnPos(i,j,k) : Not applicable for Gauss points !"); } DataArrayDouble *MEDCouplingFieldDiscretizationGaussNE::getValueOnMulti(const DataArrayDouble *arr, const MEDCouplingMesh *mesh, const double *loc, int nbOfPoints) const diff --git a/src/MEDCoupling/MEDCouplingMemArray.cxx b/src/MEDCoupling/MEDCouplingMemArray.cxx index 4d4fed46d..7a2c7da1c 100644 --- a/src/MEDCoupling/MEDCouplingMemArray.cxx +++ b/src/MEDCoupling/MEDCouplingMemArray.cxx @@ -2078,7 +2078,7 @@ DataArrayDouble *DataArrayDouble::fromCartToCylGiven(const DataArrayDouble *coor /*! * Computes the doubly contracted product of every tensor defined by the tuple of \a this - * array contating 6 components. + * array containing 6 components. * \return DataArrayDouble * - the new instance of DataArrayDouble, whose each tuple * is calculated from the tuple (t) of \a this array as follows: * \f$ t[0]^2+t[1]^2+t[2]^2+2*t[3]^2+2*t[4]^2+2*t[5]^2\f$. @@ -3837,7 +3837,7 @@ void DataArrayInt::reprQuickOverviewData(std::ostream& stream, std::size_t maxNb /*! * Computes distribution of values of \a this one-dimensional array between given value - * ranges (casts). This method is typically useful for entity number spliting by types, + * ranges (casts). This method is typically useful for entity number splitting by types, * for example. * \warning The values contained in \a arrBg should be sorted ascendently. No * check of this is be done. If not, the result is not warranted. @@ -6274,7 +6274,7 @@ DataArrayInt *DataArrayInt::findIdInRangeForEachTuple(const DataArrayInt *ranges * If this method has correctly worked, \a this will be able to be considered as a linked list. * This method does nothing if number of tuples is lower of equal to 1. * - * This method is useful for users having an unstructured mesh having only SEG2 to rearrange internaly the connectibity without any coordinates consideration. + * This method is useful for users having an unstructured mesh having only SEG2 to rearrange internally the connectibity without any coordinates consideration. * * \sa MEDCouplingUMesh::orderConsecutiveCells1D, DataArrayInt::fromLinkedListOfPairToList */ diff --git a/src/MEDCoupling/MEDCouplingStructuredMesh.cxx b/src/MEDCoupling/MEDCouplingStructuredMesh.cxx index a6b9706fd..f7d0bf42b 100644 --- a/src/MEDCoupling/MEDCouplingStructuredMesh.cxx +++ b/src/MEDCoupling/MEDCouplingStructuredMesh.cxx @@ -1160,7 +1160,7 @@ int MEDCouplingStructuredMesh::FindMinimalPartOf3D(const std::vector& st, c * std::distance( \a nodeStBg, \a nodeStEnd ) is equal to the space dimension. The returned value is equal to * the meshDimension (or the zipped spaceDimension). * - * \param [out] zipNodeSt - The zipped node strucutre + * \param [out] zipNodeSt - The zipped node structure * \return int - the */ int MEDCouplingStructuredMesh::ZipNodeStructure(const int *nodeStBg, const int *nodeStEnd, int zipNodeSt[3]) diff --git a/src/MEDCoupling/MEDCouplingTimeLabel.hxx b/src/MEDCoupling/MEDCouplingTimeLabel.hxx index 1c534dc15..cc138c91d 100644 --- a/src/MEDCoupling/MEDCouplingTimeLabel.hxx +++ b/src/MEDCoupling/MEDCouplingTimeLabel.hxx @@ -37,7 +37,7 @@ namespace MEDCoupling MEDCOUPLING_EXPORT TimeLabel& operator=(const TimeLabel& other); //! This method should be called when write access has been done on this. MEDCOUPLING_EXPORT void declareAsNew() const; - //! This method should be called on high level classes as Field or Mesh to take into acount modifications done in aggregates objects. + //! This method should be called on high level classes as Field or Mesh to take into account modifications done in aggregates objects. MEDCOUPLING_EXPORT virtual void updateTime() const = 0; MEDCOUPLING_EXPORT std::size_t getTimeOfThis() const { return _time; } protected: diff --git a/src/MEDCoupling/MEDCouplingUMesh.cxx b/src/MEDCoupling/MEDCouplingUMesh.cxx index 8a0293fd0..6ef3eb8e3 100644 --- a/src/MEDCoupling/MEDCouplingUMesh.cxx +++ b/src/MEDCoupling/MEDCouplingUMesh.cxx @@ -687,7 +687,7 @@ MEDCouplingUMesh *MEDCouplingUMesh::explode3DMeshTo1D(DataArrayInt *desc, DataAr /*! * This method computes the micro edges constituting each cell in \a this. Micro edge is an edge for non quadratic cells. Micro edge is an half edge for quadratic cells. - * This method works for both meshes with mesh dimenstion equal to 2 or 3. Dynamical cells are not supported (polygons, polyhedrons...) + * This method works for both meshes with mesh dimension equal to 2 or 3. Dynamical cells are not supported (polygons, polyhedrons...) * * \sa explode3DMeshTo1D, buildDescendingConnectiviy */ @@ -6373,7 +6373,7 @@ MEDCouplingMesh *MEDCouplingUMesh::mergeMyselfWith(const MEDCouplingMesh *other) /*! * Returns a new DataArrayDouble holding barycenters of all cells. The barycenter is * computed by averaging coordinates of cell nodes, so this method is not a right - * choice for degnerated meshes (not well oriented, cells with measure close to zero). + * choice for degenerated meshes (not well oriented, cells with measure close to zero). * \return DataArrayDouble * - a new instance of DataArrayDouble, of size \a * this->getNumberOfCells() tuples per \a this->getSpaceDimension() * components. The caller is to delete this array using decrRef() as it is diff --git a/src/MEDCoupling/MEDCouplingUMesh_intersection.cxx b/src/MEDCoupling/MEDCouplingUMesh_intersection.cxx index 52cd1f1d0..c5f173165 100644 --- a/src/MEDCoupling/MEDCouplingUMesh_intersection.cxx +++ b/src/MEDCoupling/MEDCouplingUMesh_intersection.cxx @@ -1196,7 +1196,7 @@ int FindRightCandidateAmong(const MEDCouplingUMesh *mesh2DSplit, const int *cand * \param [out] subDiv2 - for each cell in \a m2Desc returns nodes that split it using convention \a m1Desc first, then \a m2Desc, then addCoo * \param [out] colinear2 - for each cell in \a m2Desc returns the edges in \a m1Desc that are colinear to it. * \param [out] addCoo - nodes to be append at the end - * \param [out] mergedNodes - gives all pair of nodes of \a m2Desc that have same location than some nodes in \a m1Desc. key is id in \a m2Desc offseted and value is id in \a m1Desc. + * \param [out] mergedNodes - gives all pair of nodes of \a m2Desc that have same location than some nodes in \a m1Desc. key is id in \a m2Desc offsetted and value is id in \a m1Desc. */ void MEDCouplingUMesh::Intersect1DMeshes(const MEDCouplingUMesh *m1Desc, const MEDCouplingUMesh *m2Desc, double eps, std::vector< std::vector >& intersectEdge1, std::vector< std::vector >& colinear2, std::vector< std::vector >& subDiv2, std::vector& addCoo, std::map& mergedNodes) @@ -1843,7 +1843,7 @@ void MEDCouplingUMesh::Intersect2DMeshWith1DLine(const MEDCouplingUMesh *mesh2D, /*! * \b WARNING this method is \b potentially \b non \b const (if returned array is empty). * \b WARNING this method lead to have a non geometric type sorted mesh (for MED file users) ! - * This method performs a conformization of \b this. So if a edge in \a this can be split into entire edges in \a this this method + * This method performs a conformization of \b this. So if a edge in \a this can be split into entire edges in \a this method * will suppress such edges to use sub edges in \a this. So this method does not add nodes in \a this if merged edges are both linear (INTERP_KERNEL::NORM_SEG2). * In the other cases new nodes can be created. If any are created, they will be appended at the end of the coordinates object before the invocation of this method. * diff --git a/src/MEDLoader/MEDFileField1TS.cxx b/src/MEDLoader/MEDFileField1TS.cxx index 3e04c813e..e884ea05a 100644 --- a/src/MEDLoader/MEDFileField1TS.cxx +++ b/src/MEDLoader/MEDFileField1TS.cxx @@ -599,7 +599,7 @@ std::vector< MCAuto > MEDFileAnyTypeField1TSWi } /*! - * This method performs a sub splitting as splitDiscretizations does but finer. This is the finest spliting level that can be done. + * This method performs a sub splitting as splitDiscretizations does but finer. This is the finest splitting level that can be done. * This method implements the minimal splitting so that each returned elements are mono Gauss discretization per geometric type. * * \sa splitDiscretizations diff --git a/src/MEDLoader/MEDFileFieldInternal.cxx b/src/MEDLoader/MEDFileFieldInternal.cxx index 363ea1a57..922b89dae 100644 --- a/src/MEDLoader/MEDFileFieldInternal.cxx +++ b/src/MEDLoader/MEDFileFieldInternal.cxx @@ -2912,7 +2912,7 @@ MEDCouplingFieldDouble *MEDFileFieldPerMesh::finishField(TypeOfField type, const /*! * This method is an extension of MEDFileFieldPerMesh::finishField method. It deals with profiles. This method should be called when type is different from ON_NODES. * 'dads', 'locs' and 'geoTypes' input parameters have the same number of elements. - * No check of this is performed. 'da' array contains an array in old2New style to be applyied to mesh to obtain the right support. + * No check of this is performed. 'da' array contains an array in old2New style to be applied to mesh to obtain the right support. * The order of cells in the returned field is those imposed by the profile. * \param [in] mesh is the global mesh. */ @@ -2979,7 +2979,7 @@ MEDCouplingFieldDouble *MEDFileFieldPerMesh::finishFieldNode2(const MEDFileField else { std::ostringstream oss; oss << "MEDFileFieldPerMesh::finishFieldNode2 : The field on nodes lies on a node profile so that it is impossible to find a submesh having exactly the same nodes of that profile !!!"; - oss << "So it is impossible to return a well definied MEDCouplingFieldDouble instance on specified mesh on a specified meshDim !" << std::endl; + oss << "So it is impossible to return a well defined MEDCouplingFieldDouble instance on specified mesh on a specified meshDim !" << std::endl; oss << "To retrieve correctly such a field you have 3 possibilities :" << std::endl; oss << " - use an another meshDim compatible with the field on nodes (MED file does not have such information)" << std::endl; oss << " - use an another a meshDimRelToMax equal to 1 -> it will return a mesh with artificial cell POINT1 containing the profile !" << std::endl; diff --git a/src/MEDLoader/MEDFileMesh.cxx b/src/MEDLoader/MEDFileMesh.cxx index 04fa341d5..7e610d1a8 100644 --- a/src/MEDLoader/MEDFileMesh.cxx +++ b/src/MEDLoader/MEDFileMesh.cxx @@ -513,7 +513,7 @@ std::vector MEDFileMesh::getFamiliesNames() const * Returns names of all families of \a this mesh but like they would be in file. * This method is here only for MED file families gurus. If you are a kind user forget this method :-) * This method is only useful for aggressive users that want to have in their file a same family lying both on cells and on nodes. This is not a good idea for lisibility ! - * For your information internaly in memory such families are renamed to have a nicer API. + * For your information internally in memory such families are renamed to have a nicer API. */ std::vector MEDFileMesh::getFamiliesNamesWithFilePointOfView() const { @@ -3987,7 +3987,7 @@ void MEDFileUMesh::buildInnerBoundaryAlongM1Group(const std::string& grpNameM1, std::vector levs=getNonEmptyLevels(); if(std::find(levs.begin(),levs.end(),0)==levs.end() || std::find(levs.begin(),levs.end(),-1)==levs.end()) - throw INTERP_KERNEL::Exception("MEDFileUMesh::buildInnerBoundaryAlongM1Group : This method works only for mesh definied on level 0 and -1 !"); + throw INTERP_KERNEL::Exception("MEDFileUMesh::buildInnerBoundaryAlongM1Group : This method works only for mesh defined on level 0 and -1 !"); MUMesh m0=getMeshAtLevel(0); MUMesh m1=getMeshAtLevel(-1); int nbNodes=m0->getNumberOfNodes(); diff --git a/src/MEDLoader/MEDFileMeshSupport.cxx b/src/MEDLoader/MEDFileMeshSupport.cxx index d70600c85..f4d5ccdec 100644 --- a/src/MEDLoader/MEDFileMeshSupport.cxx +++ b/src/MEDLoader/MEDFileMeshSupport.cxx @@ -114,7 +114,7 @@ const MEDFileUMesh *MEDFileMeshSupports::getSupMeshWithName(const std::string& n } } std::ostringstream oss; - oss << "MEDFileMeshSupports::getSupMeshWithName : no such name \"" << name << "\". Possibilitities are :"; + oss << "MEDFileMeshSupports::getSupMeshWithName : no such name \"" << name << "\". Possibilities are :"; std::copy(mns.begin(),mns.end(),std::ostream_iterator(oss,",")); oss << " !"; throw INTERP_KERNEL::Exception(oss.str()); diff --git a/src/MEDLoader/SauvMedConvertor.hxx b/src/MEDLoader/SauvMedConvertor.hxx index 9331f29bb..3cc5e555e 100644 --- a/src/MEDLoader/SauvMedConvertor.hxx +++ b/src/MEDLoader/SauvMedConvertor.hxx @@ -70,7 +70,7 @@ namespace SauvUtilities struct Cell { std::vector< Node* > _nodes; - mutable bool _reverse; // to reverse orienation of a face only + mutable bool _reverse; // to reverse orientation of a face only mutable TID* _sortedNodeIDs; // for comparison mutable TID _number; diff --git a/src/MEDLoader/SauvWriter.cxx b/src/MEDLoader/SauvWriter.cxx index d80b96960..b60635f64 100644 --- a/src/MEDLoader/SauvWriter.cxx +++ b/src/MEDLoader/SauvWriter.cxx @@ -848,7 +848,7 @@ void SauvWriter::writeNodes() MCAuto< MEDCouplingMesh > mesh = _fileMesh->getMeshAtLevel( 1 ); MCAuto< MEDCouplingUMesh > umesh = mesh->buildUnstructured(); - // write the index connecting nodes with their coodrinates + // write the index connecting nodes with their coordinates const int nbNodes = umesh->getNumberOfNodes(); *_sauvFile << " ENREGISTREMENT DE TYPE 2" << endl diff --git a/src/MEDLoader/Swig/MEDLoaderTest1.py b/src/MEDLoader/Swig/MEDLoaderTest1.py index 6bb279073..673f76349 100644 --- a/src/MEDLoader/Swig/MEDLoaderTest1.py +++ b/src/MEDLoader/Swig/MEDLoaderTest1.py @@ -692,7 +692,7 @@ class MEDLoaderTest1(unittest.TestCase): d=MEDLoader.DataArrayDouble.New() d.alloc(1,1) d.iota(1.) - # seting a long name + # setting a long name d.setInfoOnComponent(0,"CONCENTRATION of I129") f.setArray(d) f.setName("field") diff --git a/src/MEDLoader/Swig/MEDLoaderTest3.py b/src/MEDLoader/Swig/MEDLoaderTest3.py index aa0600393..b9dd8c961 100644 --- a/src/MEDLoader/Swig/MEDLoaderTest3.py +++ b/src/MEDLoader/Swig/MEDLoaderTest3.py @@ -1223,7 +1223,7 @@ class MEDLoaderTest3(unittest.TestCase): del tes0 # tes1=f.getFieldOnMeshAtLevel(ON_NODES,1,m) - self.assertEqual(ON_CELLS,tes1.getTypeOfField())# it is not a bug even if ON_NODES has been sepecified + self.assertEqual(ON_CELLS,tes1.getTypeOfField())# it is not a bug even if ON_NODES has been specified self.assertEqual(0,tes1.getMesh().getMeshDimension()) self.assertEqual(2,tes1.getMesh().getNumberOfCells()) self.assertEqual(135,tes1.getMesh().getNumberOfNodes()) @@ -1259,7 +1259,7 @@ class MEDLoaderTest3(unittest.TestCase): pass # tes3=f.getFieldOnMeshAtLevel(ON_NODES,1,m) - self.assertEqual(ON_CELLS,tes3.getTypeOfField())# it is not a bug even if ON_NODES has been sepecified + self.assertEqual(ON_CELLS,tes3.getTypeOfField())# it is not a bug even if ON_NODES has been specified self.assertEqual(0,tes3.getMesh().getMeshDimension()) self.assertEqual(2,tes3.getMesh().getNumberOfCells()) self.assertEqual(135,tes3.getMesh().getNumberOfNodes()) @@ -3852,7 +3852,7 @@ class MEDLoaderTest3(unittest.TestCase): pass def testMEDFileUMeshLoadPart1(self): - """ This method tests MEDFileUMesh.LoadPart that loads only a part of a specified mesh in a MED file. The part is specfied using a slice of cell ids. Only nodes on which cells lies are loaded to reduce at most the amount of + """ This method tests MEDFileUMesh.LoadPart that loads only a part of a specified mesh in a MED file. The part is specified using a slice of cell ids. Only nodes on which cells lies are loaded to reduce at most the amount of memory of the returned instance. """ fileName="Pyfile81.med" diff --git a/src/MEDLoader/Swig/MEDLoaderTest4.py b/src/MEDLoader/Swig/MEDLoaderTest4.py index be9440267..e5b5be722 100644 --- a/src/MEDLoader/Swig/MEDLoaderTest4.py +++ b/src/MEDLoader/Swig/MEDLoaderTest4.py @@ -1375,7 +1375,7 @@ class MEDLoaderTest4(unittest.TestCase): mml2=mml.prepare() self.assertTrue(isinstance(mml2,MEDCurveLinearMeshMultiLev)) # here the 2nd support is a part of CMesh that is also a CMesh -> CMesh not a UMesh a,b,c=mml2.buildVTUArrays() - self.assertTrue(not c)#False here because a is the result of a computation not the internal strucutre + self.assertTrue(not c)#False here because a is the result of a computation not the internal structure self.assertTrue(a.isEqual(a0Exp[pfl2],1e-12)) self.assertEqual(b,[3,3]) a6,a7=mml2.retrieveFamilyIdsOnCells() @@ -4877,7 +4877,7 @@ class MEDLoaderTest4(unittest.TestCase): pass allFMTSLeavesToDisplay.append(allFMTSLeavesToDisplay2) pass - # Here 2 MED fields in input and at the end 5 ! 1+4 ! 4 fields have been built from zeField0 due to subspliting per dis / per geo type + # Here 2 MED fields in input and at the end 5 ! 1+4 ! 4 fields have been built from zeField0 due to subsplitting per dis / per geo type self.assertEqual(len(allFMTSLeavesToDisplay),1) self.assertEqual(len(allFMTSLeavesToDisplay[0]),5) allFMTSLeavesPerTimeSeries=MEDFileAnyTypeFieldMultiTS.SplitIntoCommonTimeSeries(sum(allFMTSLeavesToDisplay,[])) diff --git a/src/ParaMEDMEM/OverlapMapping.cxx b/src/ParaMEDMEM/OverlapMapping.cxx index 60a4a8b03..4be5c883a 100644 --- a/src/ParaMEDMEM/OverlapMapping.cxx +++ b/src/ParaMEDMEM/OverlapMapping.cxx @@ -152,7 +152,7 @@ void OverlapMapping::prepare(const std::vector< int >& procsToSendField, int nbO //updating _src_ids_zip_st2 and _src_ids_zip_st2 with received matrix. fillSourceIdsZipReceivedForMultiply(); - // Prepare proc list for future field data exchange (mutliply()): + // Prepare proc list for future field data exchange (multiply()): _proc_ids_to_send_vector_st = procsToSendField; // Make some space on local proc: _matrixes_st.clear(); -- 2.39.2