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

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

Browse Source 
Fix various typos

Fixed via `codespell v2.1.dev
This commit is contained in:
luz paz
2021-01-11 12:29:28 +03:00
committed by bugmaster
parent 83746de803
commit 54adc5e979
162 changed files with 295 additions and 294 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/Extrema/Extrema_ELPCOfLocateExtPC.hxx
View File

@@ -57,7 +57,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Zeros are searched between uinf and usup.
//! Tol is used to decide to stop the
@@ -68,7 +68,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Tol is used to decide to stop the
//! iterations according to the following condition:

4
src/Extrema/Extrema_ELPCOfLocateExtPC2d.hxx
View File

@@ -57,7 +57,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Zeros are searched between uinf and usup.
//! Tol is used to decide to stop the
@@ -68,7 +68,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Tol is used to decide to stop the
//! iterations according to the following condition:

4
src/Extrema/Extrema_EPCOfELPCOfLocateExtPC.hxx
View File

@@ -46,7 +46,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.
@@ -58,7 +58,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.

4
src/Extrema/Extrema_EPCOfELPCOfLocateExtPC2d.hxx
View File

@@ -46,7 +46,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.
@@ -58,7 +58,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.

4
src/Extrema/Extrema_EPCOfExtPC.hxx
View File

@@ -46,7 +46,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.
@@ -58,7 +58,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.

4
src/Extrema/Extrema_EPCOfExtPC2d.hxx
View File

@@ -46,7 +46,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.
@@ -58,7 +58,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! NbU is used to locate the close points to
//! find the zeros.

2
src/Extrema/Extrema_ExtElC.hxx
View File

@@ -56,7 +56,7 @@ public:
Standard_EXPORT Extrema_ExtElC(const gp_Lin& C1, const gp_Circ& C2, const Standard_Real Tol);
//! Calculates the distance between a line and an
//! elipse.
//! ellipse.
Standard_EXPORT Extrema_ExtElC(const gp_Lin& C1, const gp_Elips& C2);
//! Calculates the distance between a line and a

4
src/Extrema/Extrema_ExtElC2d.hxx
View File

@@ -56,7 +56,7 @@ public:
Standard_EXPORT Extrema_ExtElC2d(const gp_Lin2d& C1, const gp_Circ2d& C2, const Standard_Real Tol);
//! Calculates the distance between a line and an
//! elipse.
//! ellipse.
Standard_EXPORT Extrema_ExtElC2d(const gp_Lin2d& C1, const gp_Elips2d& C2);
//! Calculates the distance between a line and a
@@ -72,7 +72,7 @@ public:
Standard_EXPORT Extrema_ExtElC2d(const gp_Circ2d& C1, const gp_Circ2d& C2);
//! Calculates the distance between a circle and an
//! elipse.
//! ellipse.
Standard_EXPORT Extrema_ExtElC2d(const gp_Circ2d& C1, const gp_Elips2d& C2);
//! Calculates the distance between a circle and a

4
src/Extrema/Extrema_ExtPC.hxx
View File

@@ -57,7 +57,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Zeros are searched between uinf and usup.
//! Tol is used to decide to stop the
@@ -68,7 +68,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Tol is used to decide to stop the
//! iterations according to the following condition:

4
src/Extrema/Extrema_ExtPC2d.hxx
View File

@@ -57,7 +57,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Zeros are searched between uinf and usup.
//! Tol is used to decide to stop the
@@ -68,7 +68,7 @@ public:
//! It calculates all the distances.
//! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs all the
//! when g(u)=dF/du=0. The algorithm searches all the
//! zeros inside the definition range of the curve.
//! Tol is used to decide to stop the
//! iterations according to the following condition:

6
src/Extrema/Extrema_ExtPElC.hxx
View File

@@ -70,12 +70,12 @@ public:
Standard_EXPORT void Perform (const gp_Pnt& P, const gp_Circ& C, const Standard_Real Tol, const Standard_Real Uinf, const Standard_Real Usup);
//! Calculates the 4 extremum distances between the
//! point P and the segment [Uinf,Usup] of the elipse C.
//! point P and the segment [Uinf,Usup] of the ellipse C.
//! Tol is used to determine
//! if the point is on the axis of the elipse and
//! if the point is on the axis of the ellipse and
//! if the major radius is equal to the minor radius or
//! if an extremum is on an endpoint of the segment.
//! If P is on the axis of the elipse,
//! If P is on the axis of the ellipse,
//! there are infinite solution then IsDone(me)=False.
//! The conditions on the Uinf and Usup are:
//! 0. <= Uinf <= 2.*PI and Usup > Uinf.

6
src/Extrema/Extrema_ExtPElC2d.hxx
View File

@@ -70,12 +70,12 @@ public:
Standard_EXPORT void Perform (const gp_Pnt2d& P, const gp_Circ2d& C, const Standard_Real Tol, const Standard_Real Uinf, const Standard_Real Usup);
//! Calculates the 4 extremum distances between the
//! point P and the segment [Uinf,Usup] of the elipse C.
//! point P and the segment [Uinf,Usup] of the ellipse C.
//! Tol is used to determine
//! if the point is on the axis of the elipse and
//! if the point is on the axis of the ellipse and
//! if the major radius is equal to the minor radius or
//! if an extremum is on an endpoint of the segment.
//! If P is on the axis of the elipse,
//! If P is on the axis of the ellipse,
//! there are infinite solution then IsDone(me)=False.
//! The conditions on the Uinf and Usup are:
//! 0. <= Uinf <= 2.*PI and Usup > Uinf.

2
src/Extrema/Extrema_ExtPRevS.cxx
View File

@@ -51,7 +51,7 @@ static gp_Ax2 GetPosition (const GeomAdaptor_SurfaceOfRevolution& S)//const Hand
if (OO.Magnitude() <= gp::Resolution()) {
OO = gp_Vec(L.Location(), ElCLib::Value(100,L));
if (N.IsParallel(OO, Precision::Angular()))
return gp_Ax2(); // Line and axe of revolution coinside
return gp_Ax2(); // Line and axe of revolution coincide
}
N ^= OO;
}

2
src/Extrema/Extrema_GExtPC.gxx
View File

@@ -156,7 +156,7 @@ void Extrema_GExtPC::Perform(const ThePoint& P)
if (mysample == 2)
{
//BSpline of first degree, direct seaching extrema for each knot interval
//BSpline of first degree, direct searching extrema for each knot interval
ThePoint aPmin;
Standard_Real tmin = 0., distmin = RealLast();
Standard_Real aMin1 = 0., aMin2 = 0.;

4
src/Extrema/Extrema_GenExtCS.hxx
View File

@@ -52,7 +52,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(S1(u1,v1),S2(u2,v2)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surfaces.
//! NbU and NbV are used to locate the close points on the
@@ -61,7 +61,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(P,S(u,v)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surface.
//! NbT,NbU and NbV are used to locate the close points

4
src/Extrema/Extrema_GenExtPS.hxx
View File

@@ -56,7 +56,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(P,S(u,v)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surface.
//! NbU and NbV are used to locate the close points
@@ -70,7 +70,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(P,S(u,v)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surface.
//! NbU and NbV are used to locate the close points

4
src/Extrema/Extrema_GenExtSS.hxx
View File

@@ -48,7 +48,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(S1(u1,v1),S2(u2,v2)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surfaces.
//! NbU and NbV are used to locate the close points
@@ -57,7 +57,7 @@ public:
//! It calculates all the distances.
//! The function F(u,v)=distance(P,S(u,v)) has an
//! extremum when gradient(F)=0. The algorithm searchs
//! extremum when gradient(F)=0. The algorithm searches
//! all the zeros inside the definition ranges of the
//! surface.
//! NbU and NbV are used to locate the close points

2
src/Extrema/Extrema_GenLocateExtCS.hxx
View File

@@ -49,7 +49,7 @@ public:
//! The close points are defined by the parameter values
//! T for C and (U,V) for S.
//! The function F(t,u,v)=distance(C(t),S(u,v))
//! has an extremun when gradient(F)=0. The algorithm searchs
//! has an extremun when gradient(F)=0. The algorithm searches
//! a zero near the close points.
Standard_EXPORT Extrema_GenLocateExtCS(const Adaptor3d_Curve& C, const Adaptor3d_Surface& S, const Standard_Real T, const Standard_Real U, const Standard_Real V, const Standard_Real Tol1, const Standard_Real Tol2);

2
src/Extrema/Extrema_GenLocateExtSS.hxx
View File

@@ -46,7 +46,7 @@ public:
//! The close points are defined by the parameter values
//! (U1,V1) for S1 and (U2,V2) for S2.
//! The function F(u1,v1,u2,v2)=distance(S1(u1,v1),S2(u2,v2))
//! has an extremun when gradient(F)=0. The algorithm searchs
//! has an extremun when gradient(F)=0. The algorithm searches
//! a zero near the close points.
Standard_EXPORT Extrema_GenLocateExtSS(const Adaptor3d_Surface& S1, const Adaptor3d_Surface& S2, const Standard_Real U1, const Standard_Real V1, const Standard_Real U2, const Standard_Real V2, const Standard_Real Tol1, const Standard_Real Tol2);

2
src/Extrema/Extrema_LocECC.hxx
View File

@@ -46,7 +46,7 @@ public:
//! close point is defined by a parameter value on each
//! curve.
//! The function F(u,v)=distance(C1(u),C2(v)) has an
//! extremun when gradient(f)=0. The algorithm searchs
//! extremun when gradient(f)=0. The algorithm searches
//! the zero near the close point.
Standard_EXPORT Extrema_LocECC(const Adaptor3d_Curve& C1, const Adaptor3d_Curve& C2, const Standard_Real U0, const Standard_Real V0, const Standard_Real TolU, const Standard_Real TolV);

2
src/Extrema/Extrema_LocECC2d.hxx
View File

@@ -46,7 +46,7 @@ public:
//! close point is defined by a parameter value on each
//! curve.
//! The function F(u,v)=distance(C1(u),C2(v)) has an
//! extremun when gradient(f)=0. The algorithm searchs
//! extremun when gradient(f)=0. The algorithm searches
//! the zero near the close point.
Standard_EXPORT Extrema_LocECC2d(const Adaptor2d_Curve2d& C1, const Adaptor2d_Curve2d& C2, const Standard_Real U0, const Standard_Real V0, const Standard_Real TolU, const Standard_Real TolV);

4
src/Extrema/Extrema_LocEPCOfLocateExtPC.hxx
View File

@@ -47,7 +47,7 @@ public:
//! 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
//! 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:
@@ -58,7 +58,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations.

4
src/Extrema/Extrema_LocEPCOfLocateExtPC2d.hxx
View File

@@ -47,7 +47,7 @@ public:
//! 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
//! 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:
@@ -58,7 +58,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations.

2
src/Extrema/Extrema_LocateExtCC.hxx
View File

@@ -44,7 +44,7 @@ public:
//! close point is defined by a parameter value on each
//! curve.
//! The function F(u,v)=distance(C1(u),C2(v)) has an
//! extremun when gradient(f)=0. The algorithm searchs
//! extremun when gradient(f)=0. The algorithm searches
//! the zero near the close point.
Standard_EXPORT Extrema_LocateExtCC(const Adaptor3d_Curve& C1, const Adaptor3d_Curve& C2, const Standard_Real U0, const Standard_Real V0);

2
src/Extrema/Extrema_LocateExtCC2d.hxx
View File

@@ -44,7 +44,7 @@ public:
//! close point is defined by a parameter value on each
//! curve.
//! The function F(u,v)=distance(C1(u),C2(v)) has an
//! extremun when gradient(f)=0. The algorithm searchs
//! extremun when gradient(f)=0. The algorithm searches
//! the zero near the close point.
Standard_EXPORT Extrema_LocateExtCC2d(const Adaptor2d_Curve2d& C1, const Adaptor2d_Curve2d& C2, const Standard_Real U0, const Standard_Real V0);

4
src/Extrema/Extrema_LocateExtPC.hxx
View File

@@ -58,7 +58,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
@@ -69,7 +69,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations.

4
src/Extrema/Extrema_LocateExtPC2d.hxx
View File

@@ -58,7 +58,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
@@ -69,7 +69,7 @@ public:
//! 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
//! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point.
//! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations.

2
src/Extrema/Extrema_PCFOfEPCOfELPCOfLocateExtPC.hxx
View File

@@ -67,7 +67,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.

2
src/Extrema/Extrema_PCFOfEPCOfELPCOfLocateExtPC2d.hxx
View File

@@ -67,7 +67,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.

2
src/Extrema/Extrema_PCFOfEPCOfExtPC.hxx
View File

@@ -67,7 +67,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.

2
src/Extrema/Extrema_PCFOfEPCOfExtPC2d.hxx
View File

@@ -67,7 +67,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.

2
src/Extrema/Extrema_PCLocFOfLocEPCOfLocateExtPC.hxx
View File

@@ -67,7 +67,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.

2
src/Extrema/Extrema_PCLocFOfLocEPCOfLocateExtPC2d.hxx
View File

@@ -67,7 +67,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.