OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-14 13:30:48 +03:00
Code Activity

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

Browse Source 
Fix various typos

Fixed via `codespell v2.1.dev
This commit is contained in:
luz paz
2020-12-16 11:58:16 +03:00
committed by bugmaster
parent 7fb9d6d573
commit 0177fe2617
196 changed files with 476 additions and 1351 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/HLRBRep/HLRBRep_Data.cxx
View File

@@ -1118,7 +1118,7 @@ void HLRBRep_Data::NextInterference ()
((MinMaxFEdg->Max[7] - myLEMinMax->Min[7]) & 0x80008000) == 0) { //-- Rejection en Z
// not rejected perform intersection
Standard_Boolean rej = Standard_False;
if (myLE == myFE) { // test if an auto-intersection is not usefull
if (myLE == myFE) { // test if an auto-intersection is not useful
if (((HLRBRep_EdgeData*)myLEData)->AutoIntersectionDone()) {
((HLRBRep_EdgeData*)myLEData)->
AutoIntersectionDone(Standard_True);

27
src/HLRBRep/HLRBRep_Data.hxx
View File

@@ -52,11 +52,9 @@ class HLRBRep_FaceData;
class IntRes2d_IntersectionPoint;
class TableauRejection;
class HLRBRep_Data;
DEFINE_STANDARD_HANDLE(HLRBRep_Data, Standard_Transient)
class HLRBRep_Data : public Standard_Transient
{
@@ -166,10 +164,9 @@ public:
//! classification.
Standard_EXPORT TopAbs_State Compare (const Standard_Integer E, const HLRBRep_EdgeData& ED);
//! Simple classification of part of edge [p1, p2]
//! returns OUT if at least 1 of Nbp points of edge is out
//! othewise returns IN
//! It is used to check "suspision" hided part of edge.
//! Simple classification of part of edge [p1, p2].
//! Returns OUT if at least 1 of Nbp points of edge is out; otherwise returns IN.
//! It is used to check "suspicion" hidden part of edge.
Standard_EXPORT TopAbs_State SimplClassify (const Standard_Integer E, const HLRBRep_EdgeData& ED, const Standard_Integer Nbp, const Standard_Real p1, const Standard_Real p2);
//! Classification of an edge.
@@ -184,18 +181,10 @@ public:
Destroy();
}
DEFINE_STANDARD_RTTIEXT(HLRBRep_Data,Standard_Transient)
protected:
private:
//! Orient the OutLines ( left must be inside in
//! projection ). Returns True if the face of a closed
//! shell has been inverted;
@@ -208,10 +197,11 @@ private:
//! Returns True if the intersection is rejected.
Standard_EXPORT Standard_Boolean RejectedPoint (const IntRes2d_IntersectionPoint& PInter, const TopAbs_Orientation BoundOri, const Standard_Integer NumSeg);
//! returns True if there is a common vertex between
//! myLE and myFE dependig on <head1> and <head2>.
//! Returns True if there is a common vertex between myLE and myFE depending on <head1> and <head2>.
Standard_EXPORT Standard_Boolean SameVertex (const Standard_Boolean head1, const Standard_Boolean head2);
private:
Standard_Integer myNbVertices;
Standard_Integer myNbEdges;
Standard_Integer myNbFaces;
@@ -272,14 +262,9 @@ private:
Standard_Boolean myAboveIntf;
TableauRejection* myReject;
};
#include <HLRBRep_Data.lxx>
#endif // _HLRBRep_Data_HeaderFile

2
src/HLRBRep/HLRBRep_Hider.cxx
View File

@@ -698,7 +698,7 @@ void HLRBRep_Hider::Hide(const Standard_Integer FI,
catch(Standard_Failure const& anException) {
#ifdef OCCT_DEBUG
std::cout << "An exception was catched when hiding edge " << E;
std::cout << "An exception was caught when hiding edge " << E;
std::cout << " by the face " << FI << std::endl;
std::cout << anException << std::endl;
#endif

4
src/HLRBRep/HLRBRep_InternalAlgo.cxx
View File

@@ -114,7 +114,7 @@ void HLRBRep_InternalAlgo::Update ()
catch(Standard_Failure const& anException) {
if (myDebug)
{
std::cout << "An exception was catched when preparing the Shape " << i;
std::cout << "An exception was caught when preparing the Shape " << i;
std::cout << " and computing its OutLines " << std::endl;
std::cout << anException << std::endl;
}
@@ -721,7 +721,7 @@ void HLRBRep_InternalAlgo::HideSelected (const Standard_Integer I,
std::cout << "Vertices : " << std::setw(5) << myDS->NbVertices() << std::endl;
std::cout << "Edges : " << std::setw(5) << myDS->NbEdges() << " , ";
std::cout << "Selected : " << std::setw(5) << nbSelEdges << " , ";
std::cout << "Visibles : " << std::setw(5) << nbVisEdges << std::endl;
std::cout << "Visible : " << std::setw(5) << nbVisEdges << std::endl;
std::cout << "Faces : " << std::setw(5) << myDS->NbFaces() << " , ";
std::cout << "Selected : " << std::setw(5) << nbSelFaces << " , ";
std::cout << "Simple : " << std::setw(5) << nbFSimp << std::endl;

37
src/HLRBRep/HLRBRep_Intersector.hxx
View File

@@ -35,29 +35,22 @@ class IntCurveSurface_IntersectionPoint;
class IntRes2d_IntersectionSegment;
class IntCurveSurface_IntersectionSegment;
//! The Intersector computes 2D intersections of the
//! projections of 3D curves.
//!
//! It can also computes the intersection of a 3D line
//! and a surface.
//! The Intersector computes 2D intersections of the projections of 3D curves.
//! It can also computes the intersection of a 3D line and a surface.
class HLRBRep_Intersector
{
public:
DEFINE_STANDARD_ALLOC
Standard_EXPORT HLRBRep_Intersector();
//! Performs the auto intersection of an edge. The
//! edge domain is cutted at start with da1*(b-a) and
//! at end with db1*(b-a).
//! Performs the auto intersection of an edge.
//! The edge domain is cut at start with da1*(b-a) and at end with db1*(b-a).
Standard_EXPORT void Perform (const Standard_Address A1, const Standard_Real da1, const Standard_Real db1);
//! Performs the intersection between the two edges.
//! The edges domains are cutted at start with
//! da*(b-a) and at end with db*(b-a).
//! Performs the intersection between the two edges.
//! The edges domains are cut at start with da*(b-a) and at end with db*(b-a).
Standard_EXPORT void Perform (const Standard_Integer nA, const Standard_Address A1, const Standard_Real da1, const Standard_Real db1, const Standard_Integer nB, const Standard_Address A2, const Standard_Real da2, const Standard_Real db2, const Standard_Boolean NoBound);
//! Create a single IntersectionPoint (U on A1) (V on A2)
@@ -88,19 +81,8 @@ public:
Destroy();
}
protected:
private:
IntRes2d_IntersectionPoint mySinglePoint;
Standard_Integer myTypePerform;
HLRBRep_CInter myIntersector;
@@ -108,13 +90,6 @@ private:
Standard_Address mySurface;
HLRBRep_ThePolyhedronOfInterCSurf* myPolyhedron;
};
#endif // _HLRBRep_Intersector_HeaderFile

2
src/HLRBRep/HLRBRep_PCLocFOfTheLocateExtPCOfTheProjPCurOfCInter.hxx
View File

@@ -66,7 +66,7 @@ public:
//! Save the found extremum.
Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE;
//! Return the nunber of found extrema.
//! Return the number of found extrema.
Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the Nth distance.

39
src/HLRBRep/HLRBRep_TheLocateExtPCOfTheProjPCurOfCInter.hxx
View File

@@ -40,27 +40,22 @@ public:
DEFINE_STANDARD_ALLOC
Standard_EXPORT HLRBRep_TheLocateExtPCOfTheProjPCurOfCInter();
//! Calculates the distance with a close point.
//! The close point is defined by the parameter value
//! U0.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero
//! near the close point.
//! The close point is defined by the parameter value U0.
//! The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0.
//! The algorithm searches a zero near the close point.
//! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! abs(Un - Un-1) < TolU.
Standard_EXPORT HLRBRep_TheLocateExtPCOfTheProjPCurOfCInter(const gp_Pnt2d& P, const Standard_Address& C, const Standard_Real U0, const Standard_Real TolU);
//! Calculates the distance with a close point.
//! The close point is defined by the parameter value
//! U0.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero
//! near the close point.
//! Zeros are searched between Umin et Usup.
//! The close point is defined by the parameter value U0.
//! The function F(u)=distance(P,C(u)) has an extremum when g(u)=dF/du=0.
//! The algorithm searches a zero near the close point.
//! Zeros are searched between Umin and Usup.
//! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! abs(Un - Un-1) < TolU.
@@ -86,32 +81,14 @@ public:
//! Returns the point of the extremum distance.
Standard_EXPORT const Extrema_POnCurv2d& Point() const;
protected:
private:
Standard_Boolean myDone;
Standard_Real mytolU;
Standard_Real myumin;
Standard_Real myusup;
HLRBRep_PCLocFOfTheLocateExtPCOfTheProjPCurOfCInter myF;
};
#endif // _HLRBRep_TheLocateExtPCOfTheProjPCurOfCInter_HeaderFile

23
src/HLRBRep/HLRBRep_ThePolyhedronOfInterCSurf.hxx
View File

@@ -34,15 +34,12 @@ class gp_Pnt;
class Bnd_Box;
class gp_XYZ;
class HLRBRep_ThePolyhedronOfInterCSurf
{
public:
DEFINE_STANDARD_ALLOC
Standard_EXPORT HLRBRep_ThePolyhedronOfInterCSurf(const Standard_Address& Surface, const Standard_Integer nbdU, const Standard_Integer nbdV, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2);
Standard_EXPORT HLRBRep_ThePolyhedronOfInterCSurf(const Standard_Address& Surface, const TColStd_Array1OfReal& Upars, const TColStd_Array1OfReal& Vpars);
@@ -71,11 +68,11 @@ public:
//! Give the number of triangles in this double array of
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
@@ -121,10 +118,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;
@@ -140,9 +137,6 @@ public:
Standard_EXPORT void Dump() const;
protected:
@@ -150,16 +144,13 @@ protected:
Standard_EXPORT void Init (const Standard_Address& Surface, const TColStd_Array1OfReal& Upars, const TColStd_Array1OfReal& Vpars);
private:
//! This method computes and returns a deflection of isoline
//! of given parameter on Surface.
Standard_EXPORT Standard_Real ComputeBorderDeflection (const Standard_Address& Surface, const Standard_Real Parameter, const Standard_Real PMin, const Standard_Real PMax, const Standard_Boolean isUIso) const;
private:
Standard_Integer nbdeltaU;
Standard_Integer nbdeltaV;
@@ -176,7 +167,6 @@ private:
Standard_Real TheBorderDeflection;
Standard_Address C_MyIsOnBounds;
};
#define ThePSurface Standard_Address
@@ -195,7 +185,4 @@ private:
#undef IntCurveSurface_Polyhedron
#undef IntCurveSurface_Polyhedron_hxx
#endif // _HLRBRep_ThePolyhedronOfInterCSurf_HeaderFile

73
src/HLRBRep/HLRBRep_ThePolyhedronToolOfInterCSurf.hxx
View File

@@ -30,69 +30,50 @@ class HLRBRep_ThePolyhedronOfInterCSurf;
class Bnd_Box;
class gp_Pnt;
class HLRBRep_ThePolyhedronToolOfInterCSurf
{
public:
DEFINE_STANDARD_ALLOC
//! Give the bounding box of the PolyhedronTool.
static const Bnd_Box& Bounding (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
static const Bnd_Box& Bounding (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Give the array of boxes. The box <n> corresponding
//! to the triangle <n>.
static const Handle(Bnd_HArray1OfBox)& ComponentsBounding (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
static const Handle(Bnd_HArray1OfBox)& ComponentsBounding (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Give the tolerance of the polygon.
static Standard_Real DeflectionOverEstimation (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Give the number of triangles in this polyedral surface.
static Standard_Integer NbTriangles (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
static Standard_Real DeflectionOverEstimation (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Give the number of triangles in this polyhedral surface.
static Standard_Integer NbTriangles (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Give the indices of the 3 points of the triangle of
//! address Index in the PolyhedronTool.
static void Triangle (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index, Standard_Integer& P1, Standard_Integer& P2, Standard_Integer& P3);
//! Give the point of index i in the polyedral surface.
static const gp_Pnt& Point (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index);
//! Give the addresse Tricon of the triangle connexe to
static void Triangle (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index, Standard_Integer& P1, Standard_Integer& P2, Standard_Integer& P3);
//! Give the point of index i in the polyhedral surface.
static const gp_Pnt& Point (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index);
//! 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 value of the triangle in the other side of Pivot
//! on the free edge. Used to turn around a vertex.
static Standard_Integer TriConnex (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Triang, const Standard_Integer Pivot, const Standard_Integer Pedge, Standard_Integer& TriCon, Standard_Integer& OtherP);
//! and the third point of this connexe triangle.
//! When we are on a free edge TriCon==0 but the function return
//! the value of the triangle in the other side of Pivot on the free edge.
//! Used to turn around a vertex.
static Standard_Integer TriConnex (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Triang, const Standard_Integer Pivot, const Standard_Integer Pedge, Standard_Integer& TriCon, Standard_Integer& OtherP);
//! This method returns true if the edge based on points with
//! indices Index1 and Index2 represents a boundary edge. It is
//! necessary to take into account the boundary deflection for
//! this edge.
static Standard_Boolean IsOnBound (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index1, const Standard_Integer Index2);
//! indices Index1 and Index2 represents a boundary edge.
//! It is necessary to take into account the boundary deflection for this edge.
static Standard_Boolean IsOnBound (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh, const Standard_Integer Index1, const Standard_Integer Index2);
//! This method returns a border deflection of the polyhedron.
static Standard_Real GetBorderDeflection (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
static Standard_Real GetBorderDeflection (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
Standard_EXPORT static void Dump (const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
protected:
private:
};
#define ThePolyhedron HLRBRep_ThePolyhedronOfInterCSurf

30
src/HLRBRep/HLRBRep_TheProjPCurOfCInter.hxx
View File

@@ -29,31 +29,28 @@ class HLRBRep_TheLocateExtPCOfTheProjPCurOfCInter;
class HLRBRep_PCLocFOfTheLocateExtPCOfTheProjPCurOfCInter;
class gp_Pnt2d;
class HLRBRep_TheProjPCurOfCInter
{
public:
DEFINE_STANDARD_ALLOC
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt.
//! The Correspondance between Pnt and the point P(V)
//! The Correspondence between Pnt and the point P(V)
//! on the parametric curve must be coherent with the
//! way of determination of the signed distance
//! between a point and the implicit curve.
//! Tol is the tolerance on the distance between a point
//! and the parametrised curve.
//! In that case, no bounds are given. The research of
//! the rigth parameter has to be made on the natural
//! the right parameter has to be made on the natural
//! parametric domain of the curve.
Standard_EXPORT static Standard_Real FindParameter (const Standard_Address& C, const gp_Pnt2d& Pnt, const Standard_Real Tol);
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt.
//! The Correspondance between Pnt and the point P(V)
//! The Correspondence between Pnt and the point P(V)
//! on the parametric curve must be coherent with the
//! way of determination of the signed distance
//! between a point and the implicit curve.
@@ -67,27 +64,6 @@ public:
//! LowParameter <= Value <= HighParameter.
Standard_EXPORT static Standard_Real FindParameter (const Standard_Address& C, const gp_Pnt2d& Pnt, const Standard_Real LowParameter, const Standard_Real HighParameter, const Standard_Real Tol);
protected:
private:
};
#endif // _HLRBRep_TheProjPCurOfCInter_HeaderFile