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

Fix various typos via codespell.

src/ShapeAnalysis/ShapeAnalysis.cxx

@@ -117,7 +117,7 @@ Standard_Real ShapeAnalysis::AdjustToPeriod(const Standard_Real Val,
 
 //=======================================================================
 //function : ReverceSeq
-//purpose  : auxilary
+//purpose  : auxiliary
 //=======================================================================
 template<class HSequence> 
 static inline void ReverseSeq (HSequence& Seq)

src/ShapeAnalysis/ShapeAnalysis_CheckSmallFace.hxx

@@ -57,7 +57,7 @@ public:
   //! to allow recovering connectivities after fixing or removing
   //! the small faces or parts of faces
   //! Enchains various checks on a face
-  //! inshell : to compute more informations, relevant to topology
+  //! inshell : to compute more information, relevant to topology
   Standard_EXPORT ShapeAnalysis_CheckSmallFace();
   
   //! Checks if a Face is as a Spot
@@ -86,7 +86,7 @@ public:
   //! tolerance, given or some of those of E1 and E2
   Standard_EXPORT Standard_Boolean CheckStripEdges (const TopoDS_Edge& E1, const TopoDS_Edge& E2, const Standard_Real tol, Standard_Real& dmax) const;
   
-  //! Searchs for two and only two edges up tolerance
+  //! Searches for two and only two edges up tolerance
   //! Returns True if OK, false if not 2 edges
   //! If True, returns the two edges and their maximum distance
   Standard_EXPORT Standard_Boolean FindStripEdges (const TopoDS_Face& F, TopoDS_Edge& E1, TopoDS_Edge& E2, const Standard_Real tol, Standard_Real& dmax);

src/ShapeAnalysis/ShapeAnalysis_Edge.hxx

@@ -185,8 +185,8 @@ public:
   
   //! Checks the first edge is overlapped with second edge.
   //! If distance between two edges is less then theTolOverlap
-  //! edges is overlapped.
-  //! theDomainDis - length of part of edges on wich edges is overlapped.
+  //! edges are overlapped.
+  //! theDomainDis - length of part of edges on which edges are overlapped.
   Standard_EXPORT Standard_Boolean CheckOverlapping (const TopoDS_Edge& theEdge1, const TopoDS_Edge& theEdge2, Standard_Real& theTolOverlap, const Standard_Real theDomainDist = 0.0);
 
 

src/ShapeAnalysis/ShapeAnalysis_Geom.hxx

@@ -43,7 +43,7 @@ public:
   //! plane and given points
   Standard_EXPORT static Standard_Boolean NearestPlane (const TColgp_Array1OfPnt& Pnts, gp_Pln& aPln, Standard_Real& Dmax);
   
-  //! Builds transfromation object out of matrix.
+  //! Builds transformation object out of matrix.
   //! Matrix must be 3 x 4.
   //! Unit is used as multiplier.
   Standard_EXPORT static Standard_Boolean PositionTrsf (const Handle(TColStd_HArray2OfReal)& coefs, gp_Trsf& trsf, const Standard_Real unit, const Standard_Real prec);

src/ShapeAnalysis/ShapeAnalysis_ShapeContents.hxx

@@ -38,7 +38,7 @@ public:
   //! Initialize fields and call ClearFlags()
   Standard_EXPORT ShapeAnalysis_ShapeContents();
   
-  //! Clears all accumulated statictics
+  //! Clears all accumulated statistics
   Standard_EXPORT void Clear();
   
   //! Clears all flags

src/ShapeAnalysis/ShapeAnalysis_Surface.cxx

@@ -1404,7 +1404,7 @@ Standard_Real ShapeAnalysis_Surface::UVFromIso(const gp_Pnt& P3d, const Standard
 
     //std::cout<<"Adaptor3d()->Surface().GetType() = "<<Adaptor3d()->Surface().GetType()<<std::endl;
 
-    //modified by rln on 04/12/97 in order to use theese variables later
+    //modified by rln on 04/12/97 in order to use these variables later
     Standard_Boolean UV = Standard_True;
     Standard_Real par = 0., other = 0., dist = 0.;
     Handle(Geom_Curve) iso;

src/ShapeAnalysis/ShapeAnalysis_Surface.hxx

@@ -112,7 +112,7 @@ public:
   
   //! Returns the characteristics of the singularity specified by
   //! its rank number <num>.
-  //! That means, that it is not neccessary for <num> to be in the
+  //! That means, that it is not necessary for <num> to be in the
   //! range [1, NbSingularities] but must be not greater than
   //! possible (see ComputeSingularities).
   //! The returned characteristics are:
@@ -192,7 +192,7 @@ public:
   //! computed.
   //! The pcurve (p2d1, p2d2) is considered as degenerate if:
   //! - max distance in 3d is less than <tol>
-  //! - max distance in 2d is at least <ratio> times greather than
+  //! - max distance in 2d is at least <ratio> times greater than
   //! the Resolution computed from max distance in 3d
   //! (max3d < tol && max2d > ratio * Resolution(max3d))
   //! NOTE: <ratio> should be >1 (e.g. 10)
@@ -268,7 +268,7 @@ public:
   //! If <maxpreci> >0. and distance between solution and
   //! P3D is greater than <maxpreci>, that solution is considered
   //! as bad, and ValueOfUV() is used.
-  //! If not succeded, calls ValueOfUV()
+  //! If not succeeded, calls ValueOfUV()
   Standard_EXPORT gp_Pnt2d NextValueOfUV (const gp_Pnt2d& p2dPrev,
                                           const gp_Pnt& P3D,
                                           const Standard_Real preci,

src/ShapeAnalysis/ShapeAnalysis_TransferParametersProj.cxx

@@ -237,7 +237,7 @@ Standard_Real ShapeAnalysis_TransferParametersProj::Perform(const Standard_Real
 
 //=======================================================================
 //function : CorrectParameter
-//purpose  : auxilary
+//purpose  : auxiliary
 //=======================================================================
 static Standard_Real CorrectParameter(const Handle(Geom2d_Curve) crv,
 				      const Standard_Real param)

src/ShapeAnalysis/ShapeAnalysis_TransferParametersProj.hxx

@@ -47,7 +47,7 @@ class ShapeAnalysis_TransferParametersProj : public ShapeAnalysis_TransferParame
 public:
 
   
-  //! Creats empty constructor.
+  //! Creates empty constructor.
   Standard_EXPORT ShapeAnalysis_TransferParametersProj();
   
   Standard_EXPORT ShapeAnalysis_TransferParametersProj(const TopoDS_Edge& E, const TopoDS_Face& F);

src/ShapeAnalysis/ShapeAnalysis_Wire.cxx

@@ -807,7 +807,7 @@ Standard_Boolean ShapeAnalysis_Wire::CheckDegenerated (const Standard_Integer nu
   //pdn allows to insert two sequences of degenerated edges (on separate bounds of surfaces)
   if ( n1 != n2 && BRep_Tool::Degenerated ( E1 ) && 
        ! sae.HasPCurve ( E1, Face() ) ) {
-    //:abv 13.05.02: OCC320 - fail (to remove edge) if two consequtive degenerated edges w/o pcurves
+    //:abv 13.05.02: OCC320 - fail (to remove edge) if two consecutive degenerated edges w/o pcurves
     if ( BRep_Tool::Degenerated ( E2 ) )
       myStatus |= ShapeExtend::EncodeStatus (ShapeExtend_FAIL2);
     return Standard_False;
@@ -931,7 +931,7 @@ Standard_Boolean ShapeAnalysis_Wire::CheckDegenerated (const Standard_Integer nu
   //#84 rln 18.03.99 if pcurve is not degenerate anymore, the fix is postponned
   //to ShapeFix_Wire::FixLacking
   if ( ! mySurf->IsDegenerated ( p2d1, p2d2, precVtx, 10. ) ) { //:s1 abv 22 Apr 99: PRO7226 #489490 //smh#9
-    //:abv 24.05.02: OCC320 - fail (to remove edge) if two consequtive degenerated edges w/o pcurves
+    //:abv 24.05.02: OCC320 - fail (to remove edge) if two consecutive degenerated edges w/o pcurves
     if ( BRep_Tool::Degenerated ( E2 ) )
       myStatus |= ShapeExtend::EncodeStatus (ShapeExtend_FAIL2);
     return Standard_False;
@@ -1235,7 +1235,7 @@ Standard_Boolean ShapeAnalysis_Wire::CheckIntersectingEdges (const Standard_Inte
 
   //:64 abv 25 Dec 97: Attention!
   // Since Intersection algorithm is not symmetrical, for consistency with BRepCheck 
-  // edge with lower order number shoud be intersecting with edge with higher one
+  // edge with lower order number should be intersecting with edge with higher one
   // i.e., for intersection of last and first edges, they should go in reversed order
   // Example: entity #38285 from bug CSR #CTS17806
   // NOTE: Tr1 and Tr2 are not reordered because they are used in the same manner

src/ShapeAnalysis/ShapeAnalysis_Wire.hxx

@@ -70,7 +70,7 @@ DEFINE_STANDARD_HANDLE(ShapeAnalysis_Wire, Standard_Transient)
 //!
 //! The methods of the given class match to ones of the class
 //! ShapeFix_Wire, e.g., CheckSmall and FixSmall.
-//! This class also includes some auxilary methods
+//! This class also includes some auxiliary methods
 //! (e.g., CheckOuterBound, etc.),
 //! which have no pair in ShapeFix_Wire.
 //!
@@ -84,7 +84,7 @@ DEFINE_STANDARD_HANDLE(ShapeAnalysis_Wire, Standard_Transient)
 //! corresponding Status... method.
 //! The 'advanced' functions share the single status field which
 //! contains the result of the last performed 'advanced' method.
-//! It is quried by the method LastCheckStatus().
+//! It is queried by the method LastCheckStatus().
 //!
 //! In order to prepare an analyzer, it is necessary to load a wire,
 //! set face and precision.
@@ -156,7 +156,7 @@ public:
     const Handle(ShapeAnalysis_Surface)& Surface() const;
   
   //! Performs all the checks in the following order :
-  //! CheckOrder, CheckSmall, CheckConected, CheckEdgeCurves,
+  //! CheckOrder, CheckSmall, CheckConnected, CheckEdgeCurves,
   //! CheckDegenerated, CheckSelfIntersection, CheckLacking,
   //! CheckClosed
   //! Returns: True if at least one method returned True;
@@ -178,7 +178,7 @@ public:
   //! Returns: True if at least one small edge was detected
   Standard_EXPORT Standard_Boolean CheckSmall (const Standard_Real precsmall = 0.0);
   
-  //! Checks edges geometry (consitency of 2d and 3d senses, adjasment
+  //! Checks edges geometry (consistency of 2d and 3d senses, adjasment
   //! of curves to the vertices, etc.).
   //! The order of the checks :
   //! Call ShapeAnalysis_Wire to check:
@@ -245,7 +245,7 @@ public:
   //! FAIL : algorithm failed (could not detect order)
   Standard_EXPORT Standard_Boolean CheckOrder (ShapeAnalysis_WireOrder& sawo, const Standard_Boolean isClosed = Standard_True, const Standard_Boolean mode3d = Standard_True);
   
-  //! Checks connected edges (num-th and preceeding).
+  //! Checks connected edges (num-th and preceding).
   //! Tests with starting preci from <SBWD> or  with <prec> if
   //! it is greater.
   //! Considers Vertices.
@@ -286,7 +286,7 @@ public:
   Standard_EXPORT Standard_Boolean CheckSeam (const Standard_Integer num);
   
   //! Checks for degenerated edge between two adjacent ones.
-  //! Fills parameters dgnr1 and dgnr2 with points in paramterical
+  //! Fills parameters dgnr1 and dgnr2 with points in parametric
   //! space that correspond to the singularity (either gap that
   //! needs to be filled by degenerated edge or that already filled)
   //! Returns: False if no singularity or edge is already degenerated,
@@ -309,7 +309,7 @@ public:
   
   //! Checks gap between edges in 3D (3d curves).
   //! Checks the distance between ends of 3d curves of the num-th
-  //! and preceeding edge.
+  //! and preceding edge.
   //! The distance can be queried by MinDistance3d.
   //!
   //! Returns: True if status is DONE
@@ -321,7 +321,7 @@ public:
   
   //! Checks gap between edges in 2D (pcurves).
   //! Checks the distance between ends of pcurves of the num-th
-  //! and preceeding edge.
+  //! and preceding edge.
   //! The distance can be queried by MinDistance2d.
   //!
   //! Returns: True if status is DONE
@@ -436,8 +436,8 @@ public:
   //! Status:
   //! DONE1 : If <shape> follows <SBWD>, direct sense (normal)
   //! DONE2 : If <shape> follows <SBWD>, but if reversed
-  //! DONE3 : If <shape> preceeds <SBWD>, direct sense
-  //! DONE4 : If <shape> preceeds <SBWD>, but if reversed
+  //! DONE3 : If <shape> precedes <SBWD>, direct sense
+  //! DONE4 : If <shape> precedes <SBWD>, but if reversed
   //! FAIL1 : If <shape> is neither an edge nor a wire
   //! FAIL2 : If <shape> cannot be connected to <SBWD>
   //!
@@ -464,7 +464,7 @@ public:
   //! Remark:  First method CheckShapeConnect calls this one
   Standard_EXPORT Standard_Boolean CheckShapeConnect (Standard_Real& tailhead, Standard_Real& tailtail, Standard_Real& headtail, Standard_Real& headhead, const TopoDS_Shape& shape, const Standard_Real prec = 0.0);
   
-  //! Checks existance of loop on wire and return vertices wich are loop vertices
+  //! Checks existence of loop on wire and return vertices which are loop vertices
   //! (vertices belonging to a few pairs of edges)
   Standard_EXPORT Standard_Boolean CheckLoop (TopTools_IndexedMapOfShape& aMapLoopVertices, TopTools_DataMapOfShapeListOfShape& aMapVertexEdges, TopTools_MapOfShape& aMapSmallEdges, TopTools_MapOfShape& aMapSeemEdges);
   
@@ -494,7 +494,7 @@ public:
   
     Standard_Boolean StatusLoop (const ShapeExtend_Status Status) const;
   
-  //! Querying the status of the LAST perfomed 'Advanced' checking procedure
+  //! Querying the status of the LAST performed 'Advanced' checking procedure
     Standard_Boolean LastCheckStatus (const ShapeExtend_Status Status) const;
   
   //! Returns the last lowest distance in 3D computed by

src/ShapeAnalysis/ShapeAnalysis_WireOrder.hxx

@@ -64,7 +64,7 @@ public:
   Standard_EXPORT ShapeAnalysis_WireOrder(const Standard_Boolean mode3d, const Standard_Real tol);
   
   //! Sets new values. Clears the connexion list
-  //! If <mode3d> changes, also clears the edge list (else, doesnt)
+  //! If <mode3d> changes, also clears the edge list (else, doesn't)
   Standard_EXPORT void SetMode (const Standard_Boolean mode3d, const Standard_Real tol);
   
   //! Returns the working tolerance
@@ -121,7 +121,7 @@ public:
   //! Returns the values of the couple <num>, as 2D values
   Standard_EXPORT void XY (const Standard_Integer num, gp_XY& start2d, gp_XY& end2d) const;
   
-  //! Returns the gap between a couple and its preceeding
+  //! Returns the gap between a couple and its preceding
   //! <num> is considered ordered
   //! If <num> = 0 (D), returns the greatest gap found
   Standard_EXPORT Standard_Real Gap (const Standard_Integer num = 0) const;

src/ShapeAnalysis/ShapeAnalysis_WireVertex.hxx

@@ -41,7 +41,7 @@ class gp_XYZ;
 //! The Wire has formerly been loaded in a ShapeExtend_WireData
 //! For each Vertex, a status and some data can be attached
 //! (case found, position and parameters)
-//! Then, these informations can be used to fix problems
+//! Then, these information can be used to fix problems
 class ShapeAnalysis_WireVertex 
 {
 public:
@@ -62,10 +62,10 @@ public:
   
   //! Sets the precision for work
   //! Analysing: for each Vertex, comparison between the end of the
-  //! preceeding edge and the start of the following edge
+  //! preceding edge and the start of the following edge
   //! Each Vertex rank corresponds to the End Vertex of the Edge of
   //! same rank, in the ShapeExtend_WireData. I.E. for Vertex <num>,
-  //! Edge <num> is the preceeding one, <num+1> is the following one
+  //! Edge <num> is the preceding one, <num+1> is the following one
   Standard_EXPORT void SetPrecision (const Standard_Real preci);
   
   Standard_EXPORT void Analyze();
@@ -79,18 +79,18 @@ public:
   //! Records status "Close Coords" (at the Precision of <me>)
   Standard_EXPORT void SetClose (const Standard_Integer num);
   
-  //! <num> is the End of preceeding Edge, and its projection on the
+  //! <num> is the End of preceding Edge, and its projection on the
   //! following one lies on it at the Precision of <me>
   //! <ufol> gives the parameter on the following edge
   Standard_EXPORT void SetEnd (const Standard_Integer num, const gp_XYZ& pos, const Standard_Real ufol);
   
   //! <num> is the Start of following Edge, its projection on the
-  //! preceeding one lies on it at the Precision of <me>
-  //! <upre> gives the parameter on the preceeding edge
+  //! preceding one lies on it at the Precision of <me>
+  //! <upre> gives the parameter on the preceding edge
   Standard_EXPORT void SetStart (const Standard_Integer num, const gp_XYZ& pos, const Standard_Real upre);
   
   //! <num> is the Intersection of both Edges
-  //! <upre> is the parameter on preceeding edge, <ufol> on
+  //! <upre> is the parameter on preceding edge, <ufol> on
   //! following edge
   Standard_EXPORT void SetInters (const Standard_Integer num, const gp_XYZ& pos, const Standard_Real upre, const Standard_Real ufol);
   
@@ -123,14 +123,14 @@ public:
   //! Returns the recorded status for a vertex
   //! With its recorded position and parameters on both edges
   //! These values are relevant regarding the status:
-  //! Status  Meaning   Position  Preceeding  Following
+  //! Status  Meaning    Position  Preceding   Following
   //! 0       Same       no        no          no
   //! 1       SameCoord  no        no          no
   //! 2       Close      no        no          no
   //! 3       End        yes       no          yes
   //! 4       Start      yes       yes         no
   //! 5       Inters     yes       yes         yes
-  //! -1       Disjoined  no        no          no
+  //! -1      Disjoined  no        no          no
   Standard_EXPORT Standard_Integer Data (const Standard_Integer num, gp_XYZ& pos, Standard_Real& upre, Standard_Real& ufol) const;
   
   //! For a given status, returns the rank of the vertex which