[3rdParty] fix typos found by the spellchecker CI

src/3rdParty/libkdtree/kdtree++/kdtree.hpp

@@ -48,7 +48,7 @@
 
 
 //
-//  This number is guarenteed to change with every release.
+//  This number is guaranteed to change with every release.
 //
 //  KDTREE_VERSION % 100 is the patch level
 //  KDTREE_VERSION / 100 % 1000 is the minor version
@@ -298,8 +298,8 @@ namespace KDTree
       typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
       typedef std::reverse_iterator<iterator> reverse_iterator;
 
-      // Note: the static_cast in end() is invalid (_M_header is not convertable to a _Link_type), but
-      // thats ok as it just means undefined behaviour if the user dereferences the end() iterator.
+      // Note: the static_cast in end() is invalid (_M_header is not convertible to a _Link_type), but
+      // that's ok as it just means undefined behaviour if the user dereferences the end() iterator.
 
       const_iterator begin() const { return const_iterator(_M_get_leftmost()); }
       const_iterator end() const { return const_iterator(static_cast<_Link_const_type>(&_M_header)); }
@@ -401,7 +401,7 @@ namespace KDTree
 
       // compares via equivalence
       // so if you are looking for any item with the same location,
-      // according to the standard accessor comparisions,
+      // according to the standard accessor comparisons,
       // then this is the function for you.
       template <class SearchVal>
       const_iterator
@@ -699,7 +699,7 @@ namespace KDTree
             _S_set_right(_S_parent(dead_dad), step_dad);
 
         // deal with the left and right edges of the tree...
-        // if the dead_dad was at the edge, then substitude...
+        // if the dead_dad was at the edge, then substitute...
         // but if there IS no new dead, then left_most is the dead_dad's parent
          if (dead_dad == _M_get_leftmost())
            _M_set_leftmost( (step_dad ? step_dad : _S_parent(dead_dad)) );

src/3rdParty/salomesmesh/inc/SMESH_MeshEditor.hxx

@@ -173,7 +173,7 @@ public:
                   const double                         theMaxAngle);
   /*!
    * \brief Split quadrangles into triangles.
-   * \param theElems     - The faces to be splitted.
+   * \param theElems     - The faces to be split.
    * \param theCriterion - Is used to choose a diagonal for splitting.
    * \return bool - Success or not.
    */
@@ -181,7 +181,7 @@ public:
                   SMESH::Controls::NumericalFunctorPtr theCriterion);
   /*!
    * \brief Split quadrangles into triangles.
-   * \param theElems  - The faces to be splitted.
+   * \param theElems  - The faces to be split.
    * \param the13Diag - Is used to choose a diagonal for splitting.
    * \return bool - Success or not.
    */
@@ -189,7 +189,7 @@ public:
                   const bool         the13Diag);
   /*!
    * \brief Split each of given quadrangles into 4 triangles.
-   * \param theElems - The faces to be splitted. If empty all faces are split.
+   * \param theElems - The faces to be split. If empty all faces are split.
    */
   void QuadTo4Tri (TIDSortedElemSet & theElems);
 
@@ -522,7 +522,7 @@ public:
   // of the side 2. If nb of links in the free border and
   // between theSide2FirstNode and theSide2LastNode are different,
   // additional nodes are inserted on a link provided that no
-  // volume elements share the splitted link.
+  // volume elements share the split link.
   // The side 2 is a free border if theSide2IsFreeBorder == true.
   // Sewing is peformed between the given first, second and last
   // nodes on the sides.

src/3rdParty/salomesmesh/src/SMESH/SMESH_MeshEditor.cpp

@@ -1503,7 +1503,7 @@ bool SMESH_MeshEditor::QuadToTri (TIDSortedElemSet &                   theElems,
 //=======================================================================
 /*!
  * \brief Split each of given quadrangles into 4 triangles.
- * \param theElems - The faces to be splitted. If empty all faces are split.
+ * \param theElems - The faces to be split. If empty all faces are split.
  */
 //=======================================================================
 

src/3rdParty/salomesmesh/src/StdMeshers/StdMeshers_QuadFromMedialAxis_1D2D.cpp

@@ -601,7 +601,7 @@ namespace
              theSinuEdges [0].size() > 0 && theSinuEdges [1].size() > 0 );
 
     // the sinuous EDGEs can be composite and C0 continuous,
-    // therefor we use a complex criterion to find TWO short non-sinuous EDGEs
+    // therefore we use a complex criterion to find TWO short non-sinuous EDGEs
     // and the rest EDGEs will be treated as sinuous.
     // A short edge should have the following features:
     // a) straight