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

Fix various typos

Fixed via `codespell v2.1.dev

src/IntTools/IntTools_BeanFaceIntersector.cxx

@@ -1157,7 +1157,7 @@ void IntTools_BeanFaceIntersector::ComputeRangeFromStartPoint(const Standard_Boo
     BoundaryCondition = Standard_False;
   }
 
-  Standard_Integer loopcounter = 0; // neccesary as infinite loop restricter
+  Standard_Integer loopcounter = 0; // necessary as infinite loop restricter
   Standard_Real U = theUParameter;
   Standard_Real V = theVParameter;
   Standard_Boolean anotherSolutionFound = Standard_False;

src/IntTools/IntTools_BeanFaceIntersector.hxx

@@ -101,11 +101,11 @@ public:
   Standard_EXPORT void Init (const BRepAdaptor_Curve& theCurve, const BRepAdaptor_Surface& theSurface, const Standard_Real theFirstParOnCurve, const Standard_Real theLastParOnCurve, const Standard_Real theUMinParameter, const Standard_Real theUMaxParameter, const Standard_Real theVMinParameter, const Standard_Real theVMaxParameter, const Standard_Real theBeanTolerance, const Standard_Real theFaceTolerance);
   
 
-  //! Sets the intersecton context
+  //! Sets the intersection context
   Standard_EXPORT void SetContext (const Handle(IntTools_Context)& theContext);
   
 
-  //! Gets the intersecton context
+  //! Gets the intersection context
   Standard_EXPORT const Handle(IntTools_Context)& Context() const;
   
 

src/IntTools/IntTools_CArray1OfInteger.hxx

@@ -104,7 +104,7 @@ Standard_Integer& operator () (const Standard_Integer Index)
 }
   
 
-  //! Applys the == operator on each array item
+  //! Applyies the == operator on each array item
   Standard_EXPORT Standard_Boolean IsEqual (const IntTools_CArray1OfInteger& Other) const;
 Standard_Boolean operator == (const IntTools_CArray1OfInteger& Other) const
 {

src/IntTools/IntTools_CArray1OfReal.hxx

@@ -105,7 +105,7 @@ Standard_Real& operator () (const Standard_Integer Index)
 }
   
 
-  //! Applys the == operator on each array item
+  //! Applies the == operator on each array item
   Standard_EXPORT Standard_Boolean IsEqual (const IntTools_CArray1OfReal& Other) const;
 Standard_Boolean operator == (const IntTools_CArray1OfReal& Other) const
 {

src/IntTools/IntTools_EdgeEdge.cxx

@@ -245,7 +245,7 @@ void IntTools_EdgeEdge::Perform()
 
   IntTools_SequenceOfRanges aRanges1, aRanges2;
   //
-  //3.2. Find ranges containig solutions
+  //3.2. Find ranges containing solutions
   Standard_Boolean bSplit2;
   FindSolutions(aRanges1, aRanges2, bSplit2);
   //

src/IntTools/IntTools_EdgeEdge.hxx

@@ -46,17 +46,17 @@ public:
 
   
 
-  //! Empty contructor
+  //! Empty constructor
   IntTools_EdgeEdge();
 
   //! Destructor
   ~IntTools_EdgeEdge();
 
-  //! Contructor
+  //! Constructor
   IntTools_EdgeEdge(const TopoDS_Edge& theEdge1, const TopoDS_Edge& theEdge2);
   
 
-  //! Contructor
+  //! Constructor
   IntTools_EdgeEdge(const TopoDS_Edge& theEdge1, const Standard_Real aT11,
       const Standard_Real aT12, const TopoDS_Edge& theEdge2, 
       const Standard_Real aT21, const Standard_Real aT22);

src/IntTools/IntTools_EdgeFace.cxx

@@ -135,7 +135,7 @@ Standard_Boolean IntTools_EdgeFace::IsCoincident()
     //be classified. Therefore, points with indexes in 
     //[aTreshIdxF, aTreshIdxL] range are made available 
     //for classification.
-    //isClassified == TRUE if MIDDLE point has been choosen and
+    //isClassified == TRUE if MIDDLE point has been chosen and
     //classified correctly.
 
     if(((0 < i) && (i < aTreshIdxF)) || ((aTreshIdxL < i ) && (i < aNbSeg)))
@@ -575,7 +575,7 @@ void IntTools_EdgeFace::Perform()
     MakeType (aCP); 
   }
   {
-    // Line\Cylinder's Common Parts treatement
+    // Line\Cylinder's Common Parts treatment
     GeomAbs_CurveType   aCType;
     GeomAbs_SurfaceType aSType;
     TopAbs_ShapeEnum aType;
@@ -607,7 +607,7 @@ void IntTools_EdgeFace::Perform()
       }
     }
     
-    // Circle\Plane's Common Parts treatement
+    // Circle\Plane's Common Parts treatment
     
     if (aCType==GeomAbs_Circle && aSType==GeomAbs_Plane) {
       Standard_Boolean bIsCoplanar, bIsRadius;

src/IntTools/IntTools_FaceFace.hxx

@@ -84,7 +84,7 @@ public:
   Standard_EXPORT void SetList (IntSurf_ListOfPntOn2S& ListOfPnts);
   
 
-  //! Sets the intersecton context
+  //! Sets the intersection context
   Standard_EXPORT void SetContext (const Handle(IntTools_Context)& aContext);
 
   //! Sets the Fuzzy value
@@ -94,7 +94,7 @@ public:
   //! Returns Fuzzy value
   Standard_EXPORT Standard_Real FuzzyValue() const;
 
-  //! Gets the intersecton context
+  //! Gets the intersection context
   Standard_EXPORT const Handle(IntTools_Context)& Context() const;
 
 protected:

src/IntTools/IntTools_Tools.hxx

@@ -123,11 +123,11 @@ public:
   Standard_EXPORT static void RejectLines (const IntTools_SequenceOfCurves& aSIn, IntTools_SequenceOfCurves& aSOut);
   
 
-  //! Returns True if D1 and D2 coinside
+  //! Returns True if D1 and D2 coincide
   Standard_EXPORT static Standard_Boolean IsDirsCoinside (const gp_Dir& D1, const gp_Dir& D2);
   
 
-  //! Returns True if D1 and D2 coinside with given tolerance
+  //! Returns True if D1 and D2 coincide with given tolerance
   Standard_EXPORT static Standard_Boolean IsDirsCoinside (const gp_Dir& D1, const gp_Dir& D2, const Standard_Real aTol);
   
 

src/IntTools/IntTools_TopolTool.hxx

@@ -78,7 +78,7 @@ public:
   //! by adaptive algorithm for BSpline surfaces. For other surfaces algorithm
   //! is the same as in method ComputeSamplePoints(), but only fill arrays of U
   //! and V sample parameters;
-  //! theDefl is a requred deflection
+  //! theDefl is a required deflection
   //! theNUmin, theNVmin are minimal nb points for U and V.
   Standard_EXPORT virtual void SamplePnts (const Standard_Real theDefl, const Standard_Integer theNUmin, const Standard_Integer theNVmin) Standard_OVERRIDE;
 

src/IntTools/IntTools_WLineTool.cxx

@@ -1325,7 +1325,7 @@ Standard_Boolean IntTools_WLineTool::
 
       if(!bIsFirstInside && !bIsLastInside) {
         if((ifprm < iFirst) && (ilprm > iLast)) {
-          // append whole line, and boundaries if neccesary
+          // append whole line, and boundaries if necessary
           if(bhasfirstpoint) {
             pit = aListOfFLIndex.First();
             const IntSurf_PntOn2S& aP = aSeqOfPntOn2S->Value(pit);