0031939: Coding - correction of spelling errors in comments [part 4]

Fix various typos

Fixed via `codespell v2.1.dev

src/IntPatch/IntPatch_ALine.hxx

@@ -63,14 +63,14 @@ public:
   
   //! Returns the first parameter on the intersection line.
   //! If IsIncluded returns True, Value and D1 methods can
-  //! be call with a parameter equal to FirstParamater.
+  //! be call with a parameter equal to FirstParameter.
   //! Otherwise, the parameter must be greater than
   //! FirstParameter.
     Standard_Real FirstParameter (Standard_Boolean& IsIncluded) const;
   
   //! Returns the last parameter on the intersection line.
   //! If IsIncluded returns True, Value and D1 methods can
-  //! be call with a parameter equal to LastParamater.
+  //! be call with a parameter equal to LastParameter.
   //! Otherwise, the parameter must be less than LastParameter.
     Standard_Real LastParameter (Standard_Boolean& IsIncluded) const;
   

src/IntPatch/IntPatch_ALineToWLine.hxx

@@ -52,7 +52,7 @@ public:
   Standard_EXPORT void MakeWLine (const Handle(IntPatch_ALine)& aline,
                                   IntPatch_SequenceOfLine& theLines) const;
   
-  //! Converts aline (limitted by paraminf and paramsup) to the set of 
+  //! Converts aline (limited by paraminf and paramsup) to the set of
   //! Walking-lines and adds them in theLines.
   Standard_EXPORT void MakeWLine (const Handle(IntPatch_ALine)& aline,
                                   const Standard_Real paraminf,

src/IntPatch/IntPatch_GLine.hxx

@@ -129,19 +129,19 @@ public:
   //! when ArcType returns IntPatch_Line.
     gp_Lin Line() const;
   
-  //! Returns the Circ from gp corrsponding to the intersection
+  //! Returns the Circ from gp corresponding to the intersection
   //! when ArcType returns IntPatch_Circle.
     gp_Circ Circle() const;
   
-  //! Returns the Elips from gp corrsponding to the intersection
+  //! Returns the Elips from gp corresponding to the intersection
   //! when ArcType returns IntPatch_Ellipse.
     gp_Elips Ellipse() const;
   
-  //! Returns the Parab from gp corrsponding to the intersection
+  //! Returns the Parab from gp corresponding to the intersection
   //! when ArcType returns IntPatch_Parabola.
     gp_Parab Parabola() const;
   
-  //! Returns the Hypr from gp corrsponding to the intersection
+  //! Returns the Hypr from gp corresponding to the intersection
   //! when ArcType returns IntPatch_Hyperbola.
     gp_Hypr Hyperbola() const;
   

src/IntPatch/IntPatch_ImpImpIntersection_4.gxx

@@ -1458,7 +1458,7 @@ Standard_Boolean ComputationMethods::CylCylComputeParameters(const Standard_Real
 
     //Then
     //  aPar - cos(aFI2) == -5.10703e-015 ==> cos(aFI2) == aPar. 
-    //Theoreticaly, in this case 
+    //Theoretically, in this case
     //  aFI2 == +/- acos(aPar).
     //However,
     //  acos(aPar) - aFI2 == 2.16362e-009.

src/IntPatch/IntPatch_ImpImpIntersection_5.gxx

@@ -105,7 +105,7 @@ Standard_Boolean IntCoCo(const IntSurf_Quadric& Quad1,
 	situC1=IntSurf_Inside;
 	situC2=IntSurf_Outside;
 	if (aR1>aR2) {					// Intersection line parametrizes from Apex1 to Apex2,
-	  situC1=IntSurf_Outside;		// So the distance betwee ptbid and aLAx1 is greater than the 
+	  situC1=IntSurf_Outside;		// So the distance between ptbid and aLAx1 is greater than the
 	  situC2=IntSurf_Inside;		// distance between ptbid and aLAx2 and in that case Cone2 
 									// is inside Cone 1
 	}
@@ -446,7 +446,7 @@ Standard_Boolean IntCoCo(const IntSurf_Quadric& Quad1,
     }
   }
 
-  //When two cones have common generatrix passing trough apexes
+  //When two cones have common generatrix passing through apexes
   //it is necessary to add it is solution
   if(inter.HasCommonGen()) {
     Standard_Real para;

src/IntPatch/IntPatch_ImpPrmIntersection.cxx

@@ -3159,7 +3159,7 @@ static Standard_Boolean CheckSegmSegm(const Standard_Real theRefParF,
 //purpose  : Check, if theLine is coincided with theArc (in 2d-space).
 //
 // Attention!!!
-//            Cases when theArc is not 2d-line adaptor are suppored by
+//            Cases when theArc is not 2d-line adaptor are supported by
 //          TopOpeBRep classes only (i.e. are archaic).
 //=======================================================================
 Standard_Boolean IsCoincide(IntPatch_TheSurfFunction& theFunc,

src/IntPatch/IntPatch_ImpPrmIntersection.hxx

@@ -44,7 +44,7 @@ public:
   
   Standard_EXPORT void Perform (const Handle(Adaptor3d_Surface)& Surf1, const Handle(Adaptor3d_TopolTool)& D1, const Handle(Adaptor3d_Surface)& Surf2, const Handle(Adaptor3d_TopolTool)& D2, const Standard_Real TolArc, const Standard_Real TolTang, const Standard_Real Fleche, const Standard_Real Pas);
   
-  //! Returns true if the calculus was succesfull.
+  //! Returns true if the calculus was successful.
     Standard_Boolean IsDone() const;
   
   //! Returns true if the is no intersection.

src/IntPatch/IntPatch_Intersection.hxx

@@ -71,7 +71,7 @@ public:
   //! compatibility with TopOpeBRep package. It shall be deleted
   //! after deleting TopOpeBRep.
   //! If theIsReqToPostWLProc == FALSE, then we will work with Walking-line
-  //! obtained after intersection algorithm directly (wothout any post-processing). 
+  //! obtained after intersection algorithm directly (without any post-processing).
   Standard_EXPORT void Perform (const Handle(Adaptor3d_Surface)& S1, const Handle(Adaptor3d_TopolTool)& D1, const Handle(Adaptor3d_Surface)& S2, const Handle(Adaptor3d_TopolTool)& D2, const Standard_Real TolArc, const Standard_Real TolTang, const Standard_Boolean isGeomInt = Standard_True, const Standard_Boolean theIsReqToKeepRLine = Standard_False, const Standard_Boolean theIsReqToPostWLProc = Standard_True);
   
   //! If isGeomInt == Standard_False, then method

src/IntPatch/IntPatch_LineConstructor.cxx

@@ -1300,7 +1300,7 @@ void IntPatch_LineConstructor::Perform(const IntPatch_SequenceOfLine& slinref,
 	// --purpose: If on a face (lastp-firstp) == 1,
 	//            sometimes it could mean a bad parametrisation of WLine.
 	//            In this case we try to classify the "virtual" WLine point:
-	//            the geometrical point between two vertexes. This emulates
+	//            the geometrical point between two vertices. This emulates
 	//            situation when (lastp-firstp) != 1.
 	if(Abs(int_lastp-int_firstp) == 1)
 	  {

src/IntPatch/IntPatch_PointLine.cxx

@@ -67,7 +67,7 @@ Standard_Real IntPatch_PointLine::
   //the method, which will be changed possibly never.
   //However, if we do something in this method we can check its
   //functionality easily. For that:
-  //  1. Initialyze aTestID variable by the correct value;
+  //  1. Initialize aTestID variable by the correct value;
   //  2. Compile this test code fragment.
 
   int aTestID = 0;
@@ -115,7 +115,7 @@ Standard_Real IntPatch_PointLine::
 #endif
 
   const gp_Vec aN1(aDU1.Crossed(aDV1)), aN2(aDU2.Crossed(aDV2));
-  //Tangent vactor to the intersection curve
+  //Tangent vector to the intersection curve
   const gp_Vec aCTan(aN1.Crossed(aN2));
   const Standard_Real aSqMagnFDer = aCTan.SquareMagnitude();
   

src/IntPatch/IntPatch_Polyhedron.hxx

@@ -63,11 +63,11 @@ public:
   //! triangles (nbdu*nbdv*2).
   Standard_EXPORT Standard_Integer NbTriangles() const;
   
-  //! Give the 3 points of the triangle of addresse Index in
+  //! Give the 3 points of the triangle of address Index in
   //! the double array of triangles.
   Standard_EXPORT void Triangle (const Standard_Integer Index, Standard_Integer& P1, Standard_Integer& P2, Standard_Integer& P3) const;
   
-  //! Give the addresse Tricon of the triangle connexe to the
+  //! Give the address Tricon of the triangle connexe to the
   //! triangle of address Triang by the edge Pivot Pedge and
   //! the third point of this connexe triangle. When we are
   //! on a free edge TriCon==0 but the function return the
@@ -113,10 +113,10 @@ public:
   
   Standard_EXPORT Standard_Boolean HasVMaxSingularity() const;
   
-  //! Give the plane equation of the triangle of addresse Triang.
+  //! Give the plane equation of the triangle of address Triang.
   Standard_EXPORT void PlaneEquation (const Standard_Integer Triang, gp_XYZ& NormalVector, Standard_Real& PolarDistance) const;
   
-  //! Give the plane equation of the triangle of addresse Triang.
+  //! Give the plane equation of the triangle of address Triang.
   Standard_EXPORT Standard_Boolean Contain (const Standard_Integer Triang, const gp_Pnt& ThePnt) const;
   
   Standard_EXPORT void Parameters (const Standard_Integer Index, Standard_Real& U, Standard_Real& V) const;

src/IntPatch/IntPatch_PolyhedronTool.hxx

@@ -30,7 +30,7 @@ class IntPatch_Polyhedron;
 class gp_Pnt;
 
 
-//! Describe  the signature  of  a  polyedral surface with
+//! Describe the signature of a polyhedral surface with
 //! only triangular  facets and the necessary information
 //! to compute the interferences.
 class IntPatch_PolyhedronTool 
@@ -50,17 +50,17 @@ public:
   //! Give the tolerance of the polygon.
     static Standard_Real DeflectionOverEstimation (const IntPatch_Polyhedron& thePolyh);
   
-  //! Give the number of triangles in this polyedral surface.
+  //! Give the number of triangles in this polyhedral surface.
     static Standard_Integer NbTriangles (const IntPatch_Polyhedron& thePolyh);
   
   //! Give the indices  of  the 3 points of  the triangle of
   //! address Index in the Polyhedron.
     static void Triangle (const IntPatch_Polyhedron& thePolyh, const Standard_Integer Index, Standard_Integer& P1, Standard_Integer& P2, Standard_Integer& P3);
   
-  //! Give the point of index i in the polyedral surface.
+  //! Give the point of index i in the polyhedral surface.
     static const gp_Pnt& Point (const IntPatch_Polyhedron& thePolyh, const Standard_Integer Index);
   
-  //! Gives the  addresse Tricon of   the triangle connexe to
+  //! Gives the address Tricon of the triangle connexe to
   //! the triangle of address Triang by the edge Pivot Pedge
   //! and the third point of this  connexe triangle. When we
   //! are on  a free edge TriCon==0  but the function return

src/IntPatch/IntPatch_PrmPrmIntersection.hxx

@@ -26,13 +26,11 @@ class IntPatch_Polyhedron;
 class IntPatch_PrmPrmIntersection_T3Bits;
 class IntSurf_LineOn2S;
 
-//! Implementation  of   the Intersection      between two
-//! bi-parametrised surfaces.
+//! Implementation of the Intersection between two bi-parametrised surfaces.
 //!
-//! To  avoid  multiple constructions of  the approximated
-//! polyhedron  of the    surfaces, the algorithm  can  be
-//! called whith the  two  surfaces  and their  associated
-//! polyhedron.
+//! To avoid multiple constructions of the approximated
+//! polyhedron of the surfaces, the algorithm can be
+//! called with the two surfaces and their associated polyhedron.
 class IntPatch_PrmPrmIntersection 
 {
 public:
@@ -86,7 +84,7 @@ public:
   //! computed.
   Standard_EXPORT void Perform (const Handle(Adaptor3d_Surface)& Caro1, const IntPatch_Polyhedron& Polyhedron1, const Handle(Adaptor3d_TopolTool)& Domain1, const Handle(Adaptor3d_Surface)& Caro2, const Handle(Adaptor3d_TopolTool)& Domain2, const Standard_Real TolTangency, const Standard_Real Epsilon, const Standard_Real Deflection, const Standard_Real Increment);
   
-  //! Returns true if the calculus was succesfull.
+  //! Returns true if the calculus was successful.
     Standard_Boolean IsDone() const;
   
   //! Returns true if the is no intersection.

src/IntPatch/IntPatch_RstInt.cxx

@@ -301,7 +301,7 @@ static Standard_Boolean FindParameter(const Handle(IntPatch_Line)& L,
     Standard_Integer inf[3],sup[3];
     // first search inside close bounding around ParamApproche;
     // then search to the nearest end of line;
-    // and then search to the farest end of line.
+    // and then search to the farthest end of line.
     inf[0] = ParamSearchInf; sup[0] = ParamSearchSup;
     if (ParamSearchInf-1 < nbpt-ParamSearchSup) {
       inf[1] = 1;              sup[1] = ParamSearchInf;

src/IntPatch/IntPatch_SpecialPoints.cxx

@@ -30,7 +30,7 @@
 #include <math_Matrix.hxx>
 
 // The function for searching intersection point, which 
-// lies in the seam-edge of the quadric definetely.
+// lies in the seam-edge of the quadric definitely.
 class FuncPreciseSeam: public math_FunctionSetWithDerivatives
 {
 public:
@@ -397,7 +397,7 @@ Then (indeterminate form is evaluated in accordance of L'Hospital rule),
   {\mathrm{d} V_{s}}+\frac{\partial S_{x}}
   {\partial V_{s}}).
 
-Analogicaly for @\sin (U_{q})@ (@S_{x}@ is substituted to @S_{y}@).
+Analogically for @\sin (U_{q})@ (@S_{x}@ is substituted to @S_{y}@).
 
 Let mean, that
   \cos (U_{q}) \left | _{V_{q} \to (-\pi /2+0)} = \cos (U_{q}) \left | _{V_{q} \to (\pi /2-0)}
@@ -451,7 +451,7 @@ Standard_Boolean IntPatch_SpecialPoints::ProcessSphere(const IntSurf_PntOn2S& th
     //Example of this case is an intersection of a plane with a sphere
     //when the plane tangents the sphere in some pole (i.e. only one 
     //intersection point, not line). In this case, U-coordinate of the
-    //sphere is undefined (can be realy anything).
+    //sphere is undefined (can be really anything).
     //Another reason is that we have tangent zone around the pole
     //(see bug #26576).
     //Computation of correct value of theUquad is impossible.

src/IntPatch/IntPatch_WLineTool.cxx

@@ -306,7 +306,7 @@ static Handle(IntPatch_WLine)
     return theWLine;
   }
 
-  // Build new line and modify geometry of necessary vertexes.
+  // Build new line and modify geometry of necessary vertices.
   Handle(IntPatch_WLine) aLocalWLine = MakeNewWLine(theWLine, aDelOuterPointsHash, Standard_True);
 
   if (aChangedFirst)