1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-09 13:22:24 +03:00

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

Fix various typos

Fixed via `codespell v2.1.dev0`
This commit is contained in:
luz paz
2020-12-10 11:40:53 +03:00
committed by bugmaster
parent 65cec1a6ef
commit a25d5aaa30
157 changed files with 329 additions and 309 deletions

View File

@@ -577,7 +577,7 @@ math_FunctionRoots::math_FunctionRoots(math_FunctionWithDerivative& F,
// calculate all the real roots of a function within the range
// A..B. whitout condition on A and B
// A..B. without condition on A and B
// a solution X is found when
// abs(Xi - Xi-1) <= EpsX and abs(F(Xi)-K) <= Epsf.
// The function is considered as null between A and B if

View File

@@ -44,7 +44,7 @@ public:
//! Calculates all the real roots of a function F-K within the range
//! A..B. whithout conditions on A and B
//! A..B. without conditions on A and B
//! A solution X is found when
//! abs(Xi - Xi-1) <= Epsx and abs(F(Xi)-K) <= EpsF.
//! The function is considered as null between A and B if

View File

@@ -43,7 +43,7 @@ public:
//! The Gauss-Legendre integration with Order = points of
//! integration for each unknow, is done on the function F
//! integration for each unknown, is done on the function F
//! between the bounds Lower and Upper.
Standard_EXPORT math_GaussMultipleIntegration(math_MultipleVarFunction& F, const math_Vector& Lower, const math_Vector& Upper, const math_IntegerVector& Order);

View File

@@ -43,7 +43,7 @@ public:
//! The Gauss-Legendre integration with Order = points of
//! integration for each unknow, is done on the function F
//! integration for each unknown, is done on the function F
//! between the bounds Lower and Upper.
Standard_EXPORT math_GaussSetIntegration(math_FunctionSet& F, const math_Vector& Lower, const math_Vector& Upper, const math_IntegerVector& Order);

View File

@@ -74,7 +74,7 @@ protected:
private:
//! perfoms actual computation
//! performs actual computation
Standard_EXPORT void Perform (math_Function& F, const Standard_Real Lower, const Standard_Real Upper, const Standard_Integer Order);

View File

@@ -94,7 +94,7 @@ public:
//! done.
const math_Matrix& AllValues() const;
//! Prints informations on the current state of the object.
//! Prints information on the current state of the object.
Standard_EXPORT void Dump (Standard_OStream& o) const;

View File

@@ -58,10 +58,10 @@ public:
DEFINE_STANDARD_ALLOC
//! contructs an IntegerVector in the range [Lower..Upper]
//! constructs an IntegerVector in the range [Lower..Upper]
Standard_EXPORT math_IntegerVector(const Standard_Integer theFirst, const Standard_Integer theLast);
//! contructs an IntegerVector in the range [Lower..Upper]
//! constructs an IntegerVector in the range [Lower..Upper]
//! with all the elements set to theInitialValue.
Standard_EXPORT math_IntegerVector(const Standard_Integer theFirst, const Standard_Integer theLast, const Standard_Integer theInitialValue);

View File

@@ -346,7 +346,7 @@ Standard_NODISCARD math_Matrix operator- (const math_Matrix& Right) const
}
//! Matrixes are copied through assignement.
//! An exception is raised if the dimensions are differents.
//! An exception is raised if the dimensions are different.
Standard_EXPORT math_Matrix& Initialized (const math_Matrix& Other);
math_Matrix& operator= (const math_Matrix& Other)
{

View File

@@ -159,7 +159,7 @@ void math_NewtonMinimum::Perform(math_MultipleVarFunctionWithHessian& F,
if (myIsBoundsDefined)
{
// Project point on bounds or nullify TheStep coords if point lies on boudary.
// Project point on bounds or nullify TheStep coords if point lies on boundary.
*suivant = *precedent - TheStep;
Standard_Real aMult = RealLast();

View File

@@ -66,18 +66,18 @@ public:
//! It can be redefined in a sub-class to implement a specific test.
virtual Standard_Boolean IsConverged() const;
//! Tests if an error has occured.
//! Tests if an error has occurred.
Standard_Boolean IsDone() const;
//! Tests if the Function is convexe during optimization.
Standard_Boolean IsConvex() const;
//! returns the location vector of the minimum.
//! Exception NotDone is raised if an error has occured.
//! Exception NotDone is raised if an error has occurred.
const math_Vector& Location() const;
//! outputs the location vector of the minimum in Loc.
//! Exception NotDone is raised if an error has occured.
//! Exception NotDone is raised if an error has occurred.
//! Exception DimensionError is raised if the range of Loc is not
//! equal to the range of the StartingPoint.
void Location (math_Vector& Loc) const;
@@ -90,7 +90,8 @@ public:
Standard_Real Minimum() const;
//! returns the gradient vector at the minimum.
//! Exception NotDone is raised if an error has occured.the minimum was not found.
//! Exception NotDone is raised if an error has occurred.
//! The minimum was not found.
const math_Vector& Gradient() const;
//! outputs the gradient vector at the minimum in Grad.
@@ -101,11 +102,11 @@ public:
//! returns the number of iterations really done in the
//! calculation of the minimum.
//! The exception NotDone is raised if an error has occured.
//! The exception NotDone is raised if an error has occurred.
Standard_Integer NbIterations() const;
//! Returns the Status of computation.
//! The exception NotDone is raised if an error has occured.
//! The exception NotDone is raised if an error has occurred.
math_Status GetStatus() const;

View File

@@ -40,7 +40,7 @@ Standard_EXPORT Standard_Integer LU_Decompose(math_Matrix& a,
// Given a matrix a(1..n, 1..n), this routine computes its LU decomposition,
// The matrix a is replaced by this LU decomposition and the vector indx(1..n)
// is an output which records the row permutation effected by the partial
// pivoting; d is output as +1 or -1 depending on wether the number of row
// pivoting; d is output as +1 or -1 depending on whether the number of row
// interchanges was even or odd.
Standard_EXPORT Standard_Integer LU_Decompose(math_Matrix& a,

View File

@@ -52,7 +52,7 @@ public:
//! Given an input matrix Cont, two input vectors Secont
//! and StartingPoint, it solves Cont*X = Secont (only
//! = equations) with a minimization of Norme(X-X0).
//! The maximun iterations number allowed is fixed to
//! The maximum iterations number allowed is fixed to
//! NbIterations.
//! The tolerance EpsLic is fixed for the dual variable
//! convergence. The tolerance EpsLix is used for the
@@ -66,7 +66,7 @@ public:
//! first equations are equal equations and the Nci last
//! equations are inequalities <) with a minimization
//! of Norme(X-X0).
//! The maximun iterations number allowed is fixed to
//! The maximum iterations number allowed is fixed to
//! NbIterations.
//! The tolerance EpsLic is fixed for the dual variable
//! convergence. The tolerance EpsLix is used for the

View File

@@ -61,11 +61,11 @@ public:
DEFINE_STANDARD_ALLOC
//! Contructs a non-initialized vector in the range [theLower..theUpper]
//! Constructs a non-initialized vector in the range [theLower..theUpper]
//! "theLower" and "theUpper" are the indexes of the lower and upper bounds of the constructed vector.
Standard_EXPORT math_Vector(const Standard_Integer theLower, const Standard_Integer theUpper);
//! Contructs a vector in the range [theLower..theUpper]
//! Constructs a vector in the range [theLower..theUpper]
//! whose values are all initialized with the value "theInitialValue"
Standard_EXPORT math_Vector(const Standard_Integer theLower, const Standard_Integer theUpper, const Standard_Real theInitialValue);
@@ -265,7 +265,7 @@ public:
}
//! Initialises a vector by copying "theOther".
//! An exception is raised if the Lengths are differents.
//! An exception is raised if the Lengths are different.
Standard_EXPORT math_Vector& Initialized(const math_Vector& theOther);
math_Vector& operator=(const math_Vector& theOther)