OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-03 17:56:21 +03:00
Code Packages Releases Activity

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

Browse Source 
Fix various typos

Fixed via `codespell v2.1.dev
This commit is contained in:
luz paz 2020-12-21 11:48:18 +03:00 committed by bugmaster
parent 3b1129a546
commit b81b237fa4
165 changed files with 413 additions and 455 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/AIS/AIS_InteractiveContext.hxx
View File

@ -1128,7 +1128,7 @@ public:
//! Allows to add or remove the object given to the list of current and highlight/unhighlight it correspondingly.
//! Is valid for global context only; for local context use method AddOrRemoveSelected.
//! Since this method makes sence only for neutral point selection of a whole object,
//! Since this method makes sense only for neutral point selection of a whole object,
//! if 0 selection of the object is empty this method simply does nothing.
Standard_DEPRECATED ("Local Context is deprecated - local selection should be used without Local Context")
void AddOrRemoveCurrentObject (const Handle(AIS_InteractiveObject)& theObj,

4
src/AIS/AIS_InteractiveContext_1.cxx
View File

@ -1010,9 +1010,7 @@ void AIS_InteractiveContext::SetSelected (const Handle(SelectMgr_EntityOwner)& t
//=======================================================================
//function : AddOrRemoveSelected
//purpose : Adds or removes current object from AIS selection and highlights/unhighlights it.
// Since this method makes sence only for neutral point selection of a whole object,
// if 0 selection of the object is empty this method simply does nothing.
//purpose :
//=======================================================================
void AIS_InteractiveContext::AddOrRemoveSelected (const Handle(AIS_InteractiveObject)& theObject,
const Standard_Boolean theToUpdateViewer)

2
src/AIS/AIS_Manipulator.hxx
View File

@ -203,7 +203,7 @@ public:
//! Computes transformation of parent object according to the active mode and input motion vector.
//! You can use this method to get object transformation according to current mode or use own algorithm
//! to implement any other tranformation for modes.
//! to implement any other transformation for modes.
//! @return transformation of parent object.
Standard_EXPORT Standard_Boolean ObjectTransformation (const Standard_Integer theX, const Standard_Integer theY,
const Handle(V3d_View)& theView, gp_Trsf& theTrsf);

14
src/Adaptor3d/Adaptor3d_Surface.hxx
View File

@ -46,16 +46,14 @@ DEFINE_STANDARD_HANDLE(Adaptor3d_Surface, Standard_Transient)
//! of a surface for generic algorithms.
//!
//! The Surface can be decomposed in intervals of any
//! continuity in U and V using the method
//! NbIntervals. A current interval can be set. Most
//! of the methods apply to the current interval.
//! continuity in U and V using the method NbIntervals.
//! A current interval can be set.
//! Most of the methods apply to the current interval.
//! Warning: All the methods are virtual and implemented with a
//! raise to allow to redefined only the methods realy
//! used.
//! raise to allow to redefined only the methods really used.
//!
//! Polynomial coefficients of BSpline surfaces used for their evaluation are
//! cached for better performance. Therefore these evaluations are not
//! thread-safe and parallel evaluations need to be prevented.
//! Polynomial coefficients of BSpline surfaces used for their evaluation are cached for better performance.
//! Therefore these evaluations are not thread-safe and parallel evaluations need to be prevented.
class Adaptor3d_Surface : public Standard_Transient
{
DEFINE_STANDARD_RTTIEXT(Adaptor3d_Surface, Standard_Transient)

58
src/Adaptor3d/Adaptor3d_TopolTool.hxx
View File

@ -30,18 +30,14 @@ class Adaptor3d_HVertex;
DEFINE_STANDARD_HANDLE(Adaptor3d_TopolTool, Standard_Transient)
//! This class provides a default topological tool,
//! based on the Umin,Vmin,Umax,Vmax of an HSurface
//! from Adaptor3d.
//! All methods and fields may be redefined when
//! inheriting from this class.
//! This class is used to instantiate algorithmes
//! as Intersection, outlines,...
//! based on the Umin,Vmin,Umax,Vmax of an HSurface from Adaptor3d.
//! All methods and fields may be redefined when inheriting from this class.
//! This class is used to instantiate algorithms as Intersection, outlines,...
class Adaptor3d_TopolTool : public Standard_Transient
{
public:
Standard_EXPORT Adaptor3d_TopolTool();
Standard_EXPORT Adaptor3d_TopolTool(const Handle(Adaptor3d_Surface)& Surface);
@ -127,42 +123,41 @@ public:
Standard_EXPORT virtual Standard_Boolean DomainIsInfinite();
Standard_EXPORT virtual Standard_Address Edge() const;
//! compute the sample-points for the intersections algorithms
//! 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
//! 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);
//! compute the sample-points for the intersections algorithms
//! by adaptive algorithm for BSpline surfaces - is used in SamplePnts
//! theDefl is a requred deflection
//! theNUmin, theNVmin are minimal nb points for U and V.
Standard_EXPORT virtual void BSplSamplePnts (const Standard_Real theDefl, const Standard_Integer theNUmin, const Standard_Integer theNVmin);
//! Compute the sample-points for the intersections algorithms 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;
//! @param theDefl [in] a required deflection
//! @param theNUmin [in] minimal nb points for U
//! @param theNVmin [in] minimal nb points for V
Standard_EXPORT virtual void SamplePnts (const Standard_Real theDefl,
const Standard_Integer theNUmin,
const Standard_Integer theNVmin);
//! Compute the sample-points for the intersections algorithms
//! by adaptive algorithm for BSpline surfaces - is used in SamplePnts
//! @param theDefl [in] required deflection
//! @param theNUmin [in] minimal nb points for U
//! @param theNVmin [in] minimal nb points for V
Standard_EXPORT virtual void BSplSamplePnts (const Standard_Real theDefl,
const Standard_Integer theNUmin,
const Standard_Integer theNVmin);
//! Returns true if provide uniform sampling of points.
Standard_EXPORT virtual Standard_Boolean IsUniformSampling() const;
DEFINE_STANDARD_RTTIEXT(Adaptor3d_TopolTool,Standard_Transient)
protected:
Handle(Adaptor3d_Surface) myS;
Standard_Integer myNbSamplesU;
Standard_Integer myNbSamplesV;
Handle(TColStd_HArray1OfReal) myUPars;
Handle(TColStd_HArray1OfReal) myVPars;
private:
Standard_Integer nbRestr;
Standard_Integer idRestr;
Standard_Real Uinf;
@ -174,13 +169,6 @@ private:
Standard_Integer idVtx;
Handle(Adaptor3d_HVertex) myVtx[2];
};
#endif // _Adaptor3d_TopolTool_HeaderFile

4
src/AdvApp2Var/AdvApp2Var_ApproxAFunc2Var.cxx
View File

@ -416,7 +416,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputePatches(const AdvApprox_Cutting& UChoice
myConstraints.UpdateInV(Vdec);
break;
case 3 :
// It is necesary to cut in U and V
// It is necessary to cut in U and V
myResult.UpdateInU(Udec);
myConstraints.UpdateInU(Udec);
myResult.UpdateInV(Vdec);
@ -796,7 +796,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputeCritError()
//=======================================================================
//function : ConvertBS
//purpose : Convertion of the approximation in BSpline Surface
//purpose : Conversion of the approximation in BSpline Surface
//=======================================================================
void AdvApp2Var_ApproxAFunc2Var::ConvertBS()

4
src/AdvApp2Var/AdvApp2Var_ApproxAFunc2Var.hxx
View File

@ -51,7 +51,7 @@ class Geom_BSplineSurface;
//! [FirstInU, LastInU]: The Bounds in U of the Approximation
//! [FirstInV, LastInV]: The Bounds in V of the Approximation
//! FavorIso : Give preference to extract u-iso or v-iso on F(U,V)
//! This can be usefull to optimize the <Func> methode
//! This can be useful to optimize the <Func> method
//! ContInU, ContInV : Continuity waiting in u and v
//! PrecisCode : Precision on approximation's error mesurement
//! 1 : Fast computation and average precision
@ -64,7 +64,7 @@ class Geom_BSplineSurface;
//! where iu (resp. iv) = 0 if ContInU (resp. ContInV) = GeomAbs_C0,
//! = 1 if = GeomAbs_C1,
//! = 2 if = GeomAbs_C2.
//! MaxPatch : Maximun number of Patch waiting
//! MaxPatch : Maximum number of Patch waiting
//! number of Patch is number of u span * number of v span
//! Func : The external method to evaluate F(U,V)
//! Crit : To (re)defined condition of convergence

4
src/AdvApp2Var/AdvApp2Var_SysBase.cxx
View File

@ -1675,7 +1675,7 @@ int maoverf_(integer *nbentr,
/* Other types of tables (INTEGER*2, INTEGER, REAL, ...) */
/* are not managed by the routine. */
/* It is usable in phase of developpement to detect the */
/* It is usable in phase of development to detect the */
/* errors of initialization. */
/* In official version, these calls will be inactive. */
@ -1770,7 +1770,7 @@ int maoverf_(integer *nbentr,
/* TABLES */
/* DATAS */
/* DATA */
/* Parameter adjustments */
--dtable;

2
src/AdvApprox/AdvApprox_ApproxAFunction.hxx
View File

@ -122,7 +122,7 @@ public:
Standard_EXPORT Standard_Real AverageError (const Standard_Integer Dimension, const Standard_Integer Index) const;
//! diplay information on approximation.
//! display information on approximation.
Standard_EXPORT void Dump (Standard_OStream& o) const;

6
src/AppDef/AppDef_BSpParLeastSquareOfMyBSplGradientOfBSplineCompute.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

5
src/AppDef/AppDef_MyLineTool.hxx
View File

@ -31,9 +31,8 @@
class AppDef_MultiLine;
//! example of MultiLine tool corresponding to the tools of the packages
//! AppParCurves and Approx. For Approx, the tool will not addd points
//! if the algorithms want some.
//! Example of MultiLine tool corresponding to the tools of the packages AppParCurves and Approx.
//! For Approx, the tool will not add points if the algorithms want some.
class AppDef_MyLineTool
{
public:

6
src/AppDef/AppDef_ParLeastSquareOfMyGradientOfCompute.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/AppDef/AppDef_ParLeastSquareOfMyGradientbisOfBSplineCompute.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/AppDef/AppDef_ParLeastSquareOfTheGradient.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/AppDef/AppDef_TheLeastSquares.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const AppDef_MultiLine& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const AppDef_MultiLine& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

10
src/AppDef/AppDef_Variational.cxx
View File

@ -921,11 +921,13 @@ void AppDef_Variational::Dump(Standard_OStream& o) const
o << " NbSegments " << myKnots->Length()-1 << std::endl;
}
else
{ if (myIsOverConstr) o << "The probleme is overconstraint " << std::endl;
else o << " Erreur dans l''approximation" << std::endl;
}
{
o << (myIsOverConstr
? " The problem is overconstraint"
: " Error in approximation") << std::endl;
}
}
//
//=======================================================================
//function : SetConstraints
//purpose : Define the constraints to approximate

4
src/Approx/Approx_SweepApproximation.cxx
View File

@ -406,7 +406,7 @@ Standard_Boolean Approx_SweepApproximation::D0(const Standard_Real Param,
myPoles2d->ChangeArray1(),
myWeigths->ChangeArray1());
// poles3d are multiplied by weight after tranlation.
// poles3d are multiplied by weight after translation.
for (ii=1; ii<=Num1DSS; ii++) {
myPoles->ChangeValue(ii).ChangeCoord()
-= Translation.XYZ();
@ -553,7 +553,7 @@ Standard_Boolean Approx_SweepApproximation::D2(const Standard_Real Param,
myDWeigths->ChangeArray1(),
myD2Weigths->ChangeArray1());
// Multiply poles3d by the weight after tranlations.
// Multiply poles3d by the weight after translations.
for (ii=1; ii<=Num1DSS; ii++) {
// First translate
myPoles->ChangeValue(ii).ChangeCoord()

6
src/Approx/Approx_SweepApproximation.hxx
View File

@ -72,7 +72,7 @@ public:
//! [First, Last] : Approx_SweepApproximation.cdl
//! Tol3d : Tolerance to surface approximation
//! Tol2d : Tolerance used to perform curve approximation
//! Normaly the 2d curve are approximated with a
//! Normally the 2d curve are approximated with a
//! tolerance given by the resolution on support surfaces,
//! but if this tolerance is too large Tol2d is used.
//! TolAngular : Tolerance (in radian) to control the angle
@ -111,10 +111,10 @@ public:
const TColStd_Array1OfInteger& SurfVMults() const;
//! returns the maximum error in the suface approximation.
//! returns the maximum error in the surface approximation.
Standard_EXPORT Standard_Real MaxErrorOnSurf() const;
//! returns the average error in the suface approximation.
//! returns the average error in the surface approximation.
Standard_EXPORT Standard_Real AverageErrorOnSurf() const;
Standard_Integer NbCurves2d() const;

22
src/Approx/Approx_SweepFunction.hxx
View File

@ -52,12 +52,12 @@ public:
//! compute the first derivative in v direction of the
//! section for v = param
//! Warning : It used only for C1 or C2 aproximation
//! Warning : It used only for C1 or C2 approximation
Standard_EXPORT virtual Standard_Boolean D1 (const Standard_Real Param, const Standard_Real First, const Standard_Real Last, TColgp_Array1OfPnt& Poles, TColgp_Array1OfVec& DPoles, TColgp_Array1OfPnt2d& Poles2d, TColgp_Array1OfVec2d& DPoles2d, TColStd_Array1OfReal& Weigths, TColStd_Array1OfReal& DWeigths);
//! compute the second derivative in v direction of the
//! section for v = param
//! Warning : It used only for C2 aproximation
//! Warning : It used only for C2 approximation
Standard_EXPORT virtual Standard_Boolean D2 (const Standard_Real Param, const Standard_Real First, const Standard_Real Last, TColgp_Array1OfPnt& Poles, TColgp_Array1OfVec& DPoles, TColgp_Array1OfVec& D2Poles, TColgp_Array1OfPnt2d& Poles2d, TColgp_Array1OfVec2d& DPoles2d, TColgp_Array1OfVec2d& D2Poles2d, TColStd_Array1OfReal& Weigths, TColStd_Array1OfReal& DWeigths, TColStd_Array1OfReal& D2Weigths);
//! get the number of 2d curves to approximate.
@ -105,26 +105,22 @@ public:
//! SurfTol error inside the surface.
Standard_EXPORT virtual void GetTolerance (const Standard_Real BoundTol, const Standard_Real SurfTol, const Standard_Real AngleTol, TColStd_Array1OfReal& Tol3d) const = 0;
//! Is usefull, if (me) have to run numerical
//! algorithm to perform D0, D1 or D2
//! Is useful, if (me) have to run numerical algorithm to perform D0, D1 or D2
Standard_EXPORT virtual void SetTolerance (const Standard_Real Tol3d, const Standard_Real Tol2d) = 0;
//! Get the barycentre of Surface.
//! An very poor estimation is sufficent.
//! This information is usefull to perform well
//! conditioned rational approximation.
//! An very poor estimation is sufficient.
//! This information is useful to perform well conditioned rational approximation.
//! Warning: Used only if <me> IsRational
Standard_EXPORT virtual gp_Pnt BarycentreOfSurf() const;
//! Returns the length of the greater section. This
//! information is usefull to G1's control.
//! Returns the length of the greater section.
//! Thisinformation is useful to G1's control.
//! Warning: With an little value, approximation can be slower.
Standard_EXPORT virtual Standard_Real MaximalSection() const;
//! Compute the minimal value of weight for each poles
//! in all sections.
//! This information is usefull to control error
//! in rational approximation.
//! Compute the minimal value of weight for each poles in all sections.
//! This information is useful to control error in rational approximation.
//! Warning: Used only if <me> IsRational
Standard_EXPORT virtual void GetMinimalWeight (TColStd_Array1OfReal& Weigths) const;

16
src/ApproxInt/ApproxInt_ImpPrmSvSurfaces.gxx
View File

@ -72,7 +72,7 @@ static Standard_Boolean IsSingular( const gp_Vec& theDU,
// Condition
// Tg=theDU*theTg2D.X()+theDV*theTg2D.Y()
// has to be satisfied strictly.
// More over, vector Tg has to be NORMALYZED
// More over, vector Tg has to be NORMALIZED
// (if theIsTo3DTgCompute == TRUE then new computed vector will
// always have magnitude 1.0).
//=======================================================================
@ -86,7 +86,7 @@ static Standard_Boolean SingularProcessing( const gp_Vec& theDU,
{
//Attention: @ \sin theAngTol \approx theAngTol @ (for cross-product)
//Really, vector theTg3D has to be normalyzed (if theIsTo3DTgCompute == FALSE).
//Really, vector theTg3D has to be normalized (if theIsTo3DTgCompute == FALSE).
const Standard_Real aSQTan = theTg3D.SquareMagnitude();
const Standard_Real aSqMagnDU = theDU.SquareMagnitude(),
@ -113,7 +113,7 @@ static Standard_Boolean SingularProcessing( const gp_Vec& theDU,
if(theIsTo3DTgCompute)
{
//theTg3D will be normalyzed. Its magnitude is
//theTg3D will be normalized. Its magnitude is
const Standard_Real aTgMagn = 1.0;
const Standard_Real aNorm = sqrt(aSqMagnDV);
@ -156,7 +156,7 @@ static Standard_Boolean SingularProcessing( const gp_Vec& theDU,
if(theIsTo3DTgCompute)
{
//theTg3D will be normalyzed. Its magnitude is
//theTg3D will be normalized. Its magnitude is
const Standard_Real aTgMagn = 1.0;
const Standard_Real aNorm = sqrt(aSqMagnDU);
@ -286,7 +286,7 @@ static Standard_Boolean SingularProcessing( const gp_Vec& theDU,
// Condition
// Tg=theDU*theTg2D.X()+theDV*theTg2D.Y()
// has to be satisfied strictly.
// More over, vector Tg has always to be NORMALYZED.
// More over, vector Tg has always to be NORMALIZED.
//=======================================================================
static Standard_Boolean NonSingularProcessing(const gp_Vec& theDU,
const gp_Vec& theDV,
@ -621,7 +621,7 @@ Standard_Boolean ApproxInt_ImpPrmSvSurfaces::Compute( Standard_Real& u1,
aNormalPrm.Divide(sqrt(aSQMagnPrm));
}
//Analogicaly for implicit surface
//Analogically for implicit surface
if(aSQMagnImp < aNullValue)
{
isImpSingular = Standard_True;
@ -657,7 +657,7 @@ Standard_Boolean ApproxInt_ImpPrmSvSurfaces::Compute( Standard_Real& u1,
//(3D- and 2D-tangents are still not defined)
//Ask to pay attention to the fact that here
//aNormalImp and aNormalPrm are normalyzed.
//aNormalImp and aNormalPrm are normalized.
//Therefore, @ \left \| \vec{Tg} \right \| = 0.0 @
//if and only if (aNormalImp || aNormalPrm).
Tg = aNormalImp.Crossed(aNormalPrm);
@ -672,7 +672,7 @@ Standard_Boolean ApproxInt_ImpPrmSvSurfaces::Compute( Standard_Real& u1,
return Standard_False;
}
//Normalyze Tg vector
//Normalize Tg vector
Tg.Divide(sqrt(aSQMagnTg));
MyTg = Tg;

2
src/ApproxInt/ApproxInt_KnotTools.cxx
View File

@ -243,7 +243,7 @@ void ApproxInt_KnotTools::ComputeKnotInds(const NCollection_LocalArray<Standard_
}
while(i < theInds.Length());
//IV: Cheking feature points.
//IV: Checking feature points.
j = 2;
for(i = 1; i <= aFeatureInds.Length(); ++i)
{

2
src/Aspect/Aspect_Window.hxx
View File

@ -122,7 +122,7 @@ public:
protected:
//! Initializes the datas of a Window.
//! Initializes the data of a Window.
Standard_EXPORT Aspect_Window();
protected:

2
src/BOPAlgo/BOPAlgo_Builder.hxx
View File

@ -338,7 +338,7 @@ public: //! @name Images/Origins
protected: //! @name Methods for building the result
//! Performs the building of the result.
//! The method calls the PerfromInternal1() method surrounded by a try-catch block.
//! The method calls the PerformInternal1() method surrounded by a try-catch block.
Standard_EXPORT virtual void PerformInternal (const BOPAlgo_PaveFiller& thePF);
//! Performs the building of the result.

6
src/BOPAlgo/BOPAlgo_MakerVolume.hxx
View File

@ -49,7 +49,7 @@ class BOPAlgo_PaveFiller;
//!
//! 3. Build solids from <myFaces> using BOPAlgo_BuilderSolid algorithm;
//!
//! 4. Treat the result: Eliminate solid containig faces from <mySBox>;
//! 4. Treat the result: Eliminate solid containing faces from <mySBox>;
//!
//! 5. Fill internal shapes: add internal vertices and edges into
//! created solids;
@ -115,11 +115,11 @@ public:
//! Empty contructor.
//! Empty constructor.
BOPAlgo_MakerVolume();
virtual ~BOPAlgo_MakerVolume();
//! Empty contructor.
//! Empty constructor.
BOPAlgo_MakerVolume(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Clears the data.

9
src/BOPAlgo/BOPAlgo_WireSplitter_1.cxx
View File

@ -239,9 +239,10 @@ void BOPAlgo_WireSplitter::SplitBlock(const TopoDS_Face& myFace,
}
}
//
// Each vertex has one edge In and one - Out. Good. But it is not enought
// to consider that nothing to do with this. We must check edges on TShape
// coinsidence. If there are such edges there is something to do with.
// Each vertex has one edge In and one - Out. Good.
// But it is not enough to consider that nothing to do with this.
// We must check edges on TShape coincidence.
// If there are such edges there is something to do with.
if (bNothingToDo) {
Standard_Integer aNbE, aNbMapEE;
Standard_Boolean bFlag;
@ -1085,4 +1086,4 @@ Standard_Boolean RefineAngle2D(const TopoDS_Vertex& aV,
}
}// for (i=0; i<2; ++i) {
return !bRet;
}
}

6
src/BOPDS/BOPDS_CommonBlock.hxx
View File

@ -45,12 +45,12 @@ public:
//! Empty contructor
//! Empty constructor
Standard_EXPORT BOPDS_CommonBlock();
//! Contructor
//! <theAllocator> - the allocator to manage the memory
//! Constructor
//! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_CommonBlock(const Handle(NCollection_BaseAllocator)& theAllocator);

13
src/BOPDS/BOPDS_Curve.hxx
View File

@ -41,14 +41,15 @@ public:
//! Empty contructor
BOPDS_Curve();
virtual ~BOPDS_Curve();
//! Empty constructor
BOPDS_Curve();
virtual ~BOPDS_Curve();
//! Contructor
//! <theAllocator> - the allocator to manage the memory
BOPDS_Curve(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Constructor
//! @param theAllocator the allocator to manage the memory
BOPDS_Curve(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier

10
src/BOPDS/BOPDS_DS.hxx
View File

@ -86,13 +86,13 @@ public:
//! Empty contructor
//! Empty constructor
Standard_EXPORT BOPDS_DS();
Standard_EXPORT virtual ~BOPDS_DS();
//! Contructor
//! theAllocator - the allocator to manage the memory
Standard_EXPORT virtual ~BOPDS_DS();
//! Constructor
//! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_DS(const Handle(NCollection_BaseAllocator)& theAllocator);

14
src/BOPDS/BOPDS_FaceInfo.hxx
View File

@ -39,14 +39,14 @@ public:
//! Empty contructor
BOPDS_FaceInfo();
virtual ~BOPDS_FaceInfo();
//! Empty constructor
BOPDS_FaceInfo();
//! Contructor
//! theAllocator - the allocator to manage the memory
BOPDS_FaceInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
virtual ~BOPDS_FaceInfo();
//! Constructor
//! @param theAllocator the allocator to manage the memory
BOPDS_FaceInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Clears the contents

2
src/BOPDS/BOPDS_IndexRange.hxx
View File

@ -34,7 +34,7 @@ public:
//! Empty contructor
//! Empty constructor
BOPDS_IndexRange();
//! Modifier

6
src/BOPDS/BOPDS_Iterator.hxx
View File

@ -46,12 +46,12 @@ public:
DEFINE_STANDARD_ALLOC
//! Empty contructor
//! Empty constructor
Standard_EXPORT BOPDS_Iterator();
Standard_EXPORT virtual ~BOPDS_Iterator();
//! Contructor
//! theAllocator - the allocator to manage the memory
//! Constructor
//! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_Iterator(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier

10
src/BOPDS/BOPDS_IteratorSI.hxx
View File

@ -42,13 +42,13 @@ public:
//! Empty contructor
//! Empty constructor
Standard_EXPORT BOPDS_IteratorSI();
Standard_EXPORT virtual ~BOPDS_IteratorSI();
//! Contructor
//! theAllocator - the allocator to manage the memory
Standard_EXPORT virtual ~BOPDS_IteratorSI();
//! Constructor
//! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_IteratorSI(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Updates the lists of possible intersections

2
src/BOPDS/BOPDS_Pave.hxx
View File

@ -35,7 +35,7 @@ public:
//! Empty contructor
//! Empty constructor
BOPDS_Pave();
//! Modifier

10
src/BOPDS/BOPDS_PaveBlock.hxx
View File

@ -44,16 +44,12 @@ class BOPDS_PaveBlock : public Standard_Transient
public:
//! Empty contructor
//! Empty constructor
Standard_EXPORT BOPDS_PaveBlock();
//! Contructor
//! <theAllocator> - the allocator to manage the memory
//! Constructor
//! @param theAllocator the allocator to manage the memory
Standard_EXPORT BOPDS_PaveBlock(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier
//! Sets the first pave <thePave>

2
src/BOPDS/BOPDS_Point.hxx
View File

@ -37,7 +37,7 @@ public:
//! Empty contructor
//! Empty constructor
BOPDS_Point();
virtual ~BOPDS_Point();

14
src/BOPDS/BOPDS_ShapeInfo.hxx
View File

@ -36,16 +36,14 @@ public:
DEFINE_STANDARD_ALLOC
//! Empty constructor
BOPDS_ShapeInfo();
//! Empty contructor
BOPDS_ShapeInfo();
virtual ~BOPDS_ShapeInfo();
virtual ~BOPDS_ShapeInfo();
//! Contructor
//! theAllocator - the allocator to manage the memory
BOPDS_ShapeInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Constructor
//! @param theAllocator the allocator to manage the memory
BOPDS_ShapeInfo(const Handle(NCollection_BaseAllocator)& theAllocator);
//! Modifier

2
src/BOPTools/BOPTools_AlgoTools2D.cxx
View File

@ -691,7 +691,7 @@ void BOPTools_AlgoTools2D::IsEdgeIsoline( const TopoDS_Edge& theE,
if(aSqMagn <= gp::Resolution())
return;
//Normalyze aT
//Normalize aT
aT /= sqrt(aSqMagn);
//sin(da) ~ da, when da->0.

2
src/BRep/BRep_TFace.hxx
View File

@ -36,7 +36,7 @@ DEFINE_STANDARD_HANDLE(BRep_TFace, TopoDS_TFace)
//! The Tface from BRep is based on the TFace from
//! TopoDS. The TFace contains :
//!
//! * A suface, a tolerance and a Location.
//! * A surface, a tolerance and a Location.
//!
//! * A NaturalRestriction flag, when this flag is
//! True the boundary of the face is known to be the

2
src/BRepAdaptor/BRepAdaptor_CompCurve.cxx
View File

@ -116,7 +116,7 @@ BRepAdaptor_CompCurve::BRepAdaptor_CompCurve(const TopoDS_Wire& theWire,
}
}
Forward = Standard_True; // Defaut ; The Reverse Edges are parsed.
Forward = Standard_True; // Default ; The Reverse Edges are parsed.
if((NbEdge > 2) || ((NbEdge==2) && (!myWire.Closed())) ) {
TopAbs_Orientation Or = myCurves->Value(1).Edge().Orientation();
TopoDS_Vertex VI, VL;

14
src/BRepAdaptor/BRepAdaptor_Curve.hxx
View File

@ -206,17 +206,15 @@ public:
Standard_EXPORT Standard_Integer NbKnots() const Standard_OVERRIDE;
//! Warning :
//! This will make a copy of the Bezier Curve
//! since it applies to it myTsrf . Be carefull when
//! using this method
//! Warning:
//! This will make a copy of the Bezier Curve since it applies to it myTsrf.
//! Be careful when using this method.
Standard_EXPORT Handle(Geom_BezierCurve) Bezier() const Standard_OVERRIDE;
//! Warning :
//! This will make a copy of the BSpline Curve
//! since it applies to it myTsrf . Be carefull when
//! using this method
//! Warning:
//! This will make a copy of the BSpline Curve since it applies to it myTsrf.
//! Be careful when using this method.
Standard_EXPORT Handle(Geom_BSplineCurve) BSpline() const Standard_OVERRIDE;
Standard_EXPORT Handle(Geom_OffsetCurve) OffsetCurve() const Standard_OVERRIDE;

2
src/BRepAlgo/BRepAlgo.cxx
View File

@ -111,7 +111,7 @@ TopoDS_Wire BRepAlgo::ConcatenateWire(const TopoDS_Wire& W,
if(index==0){ //storage of the first edge features
First0=First;
if(edge.Orientation()==TopAbs_REVERSED){ //(usefull for the closed wire)
if(edge.Orientation()==TopAbs_REVERSED){ //(useful for the closed wire)
Vfirst=TopExp::LastVertex(edge);
tab(index)->Reverse();
}

4
src/BRepAlgo/BRepAlgo_Tool.hxx
View File

@ -37,8 +37,8 @@ public:
//! 1 - Remove all the free boundary and the faces
//! connex to such edges.
//! 2 - Remove all the shapes not valid in the result
//! (according to the side of offseting)
//! in this verion only the first point is implemented.
//! (according to the side of offsetting)
//! in this version only the first point is implemented.
Standard_EXPORT static TopoDS_Shape Deboucle3D (const TopoDS_Shape& S, const TopTools_MapOfShape& Boundary);

14
src/BRepAlgoAPI/BRepAlgoAPI_Section.hxx
View File

@ -30,7 +30,7 @@ class Geom_Surface;
//! The algorithm is to build a Secton operation between arguments and tools.
//! The algorithm is to build a Section operation between arguments and tools.
//! The result of Section operation consists of vertices and edges.
//! The result of Section operation contains:
//! 1. new vertices that are subjects of V/V, E/E, E/F, F/F interferences
@ -56,7 +56,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <S1> -argument
//! <S2> -tool
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const TopoDS_Shape& S2, const Standard_Boolean PerformNow = Standard_True);
@ -65,7 +65,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <S2> -tool
//! <PF> - PaveFiller object that is carried out
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const TopoDS_Shape& S2, const BOPAlgo_PaveFiller& aDSF, const Standard_Boolean PerformNow = Standard_True);
@ -73,7 +73,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <S1> - argument
//! <Pl> - tool
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const gp_Pln& Pl, const Standard_Boolean PerformNow = Standard_True);
@ -81,7 +81,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <S1> - argument
//! <Sf> - tool
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const TopoDS_Shape& S1, const Handle(Geom_Surface)& Sf, const Standard_Boolean PerformNow = Standard_True);
@ -89,7 +89,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <Sf> - argument
//! <S2> - tool
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const Handle(Geom_Surface)& Sf, const TopoDS_Shape& S2, const Standard_Boolean PerformNow = Standard_True);
@ -97,7 +97,7 @@ Standard_EXPORT virtual ~BRepAlgoAPI_Section();
//! <Sf1> - argument
//! <Sf2> - tool
//! <PerformNow> - the flag:
//! if <PerformNow>=True - the algorithm is performed immediatly
//! if <PerformNow>=True - the algorithm is performed immediately
//! Obsolete
Standard_EXPORT BRepAlgoAPI_Section(const Handle(Geom_Surface)& Sf1, const Handle(Geom_Surface)& Sf2, const Standard_Boolean PerformNow = Standard_True);

6
src/BRepApprox/BRepApprox_BSpParLeastSquareOfMyBSplGradientOfTheComputeLineOfApprox.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/BRepApprox/BRepApprox_ParLeastSquareOfMyGradientOfTheComputeLineBezierOfApprox.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/BRepApprox/BRepApprox_ParLeastSquareOfMyGradientbisOfTheComputeLineOfApprox.hxx
View File

@ -174,17 +174,17 @@ public:
protected:
//! is used by the constuctors above.
//! is used by the constructors above.
Standard_EXPORT void Init (const BRepApprox_TheMultiLineOfApprox& SSP, const Standard_Integer FirstPoint, const Standard_Integer LastPoint);
//! returns the number of second member columns.
//! Is used internally to initialize the fields.
Standard_EXPORT Standard_Integer NbBColumns (const BRepApprox_TheMultiLineOfApprox& SSP) const;
//! returns the first point beeing fitted.
//! returns the first point being fitted.
Standard_EXPORT Standard_Integer TheFirstPoint (const AppParCurves_Constraint FirstCons, const Standard_Integer FirstPoint) const;
//! returns the last point beeing fitted.
//! returns the last point being fitted.
Standard_EXPORT Standard_Integer TheLastPoint (const AppParCurves_Constraint LastCons, const Standard_Integer LastPoint) const;
//! Affects the fields in the case of a constraint point.

6
src/BRepBlend/BRepBlend_AppFuncRoot.hxx
View File

@ -112,17 +112,17 @@ public:
Standard_EXPORT virtual void SetTolerance (const Standard_Real Tol3d, const Standard_Real Tol2d) Standard_OVERRIDE;
//! Get the barycentre of Surface. An very poor
//! estimation is sufficent. This information is usefull
//! estimation is sufficient. This information is useful
//! to perform well conditioned rational approximation.
Standard_EXPORT virtual gp_Pnt BarycentreOfSurf() const Standard_OVERRIDE;
//! Returns the length of the maximum section. This
//! information is usefull to perform well conditioned rational
//! information is useful to perform well conditioned rational
//! approximation.
Standard_EXPORT virtual Standard_Real MaximalSection() const Standard_OVERRIDE;
//! Compute the minimal value of weight for each poles
//! of all sections. This information is usefull to
//! of all sections. This information is useful to
//! perform well conditioned rational approximation.
Standard_EXPORT virtual void GetMinimalWeight (TColStd_Array1OfReal& Weigths) const Standard_OVERRIDE;

6
src/BRepBlend/BRepBlend_AppSurface.hxx
View File

@ -50,7 +50,7 @@ public:
//! Approximation of the new Surface (and
//! eventually the 2d Curves on the support
//! surfaces).
//! Normaly the 2d curve are
//! Normally the 2d curve are
//! approximated with an tolerance given by the
//! resolution on support surfaces, but if this
//! tolerance is too large Tol2d is used.
@ -78,7 +78,7 @@ public:
const TColStd_Array1OfInteger& SurfVMults() const;
//! returns the maximum error in the suface approximation.
//! returns the maximum error in the surface approximation.
Standard_EXPORT Standard_Real MaxErrorOnSurf() const;
Standard_Integer NbCurves2d() const;
@ -102,7 +102,7 @@ public:
Standard_EXPORT Standard_Real TolCurveOnSurf (const Standard_Integer Index) const;
//! diplay information on approximation.
//! display information on approximation.
Standard_EXPORT void Dump (Standard_OStream& o) const;

2
src/BRepBlend/BRepBlend_SurfRstEvolRad.cxx
View File

@ -112,7 +112,7 @@ static void FusionneIntervalles(const TColStd_Array1OfReal& I1,
//=======================================================================
//function : BRepBlend_SurfRstEvolRad
//purpose : Contructor
//purpose : Constructor
//=======================================================================
BRepBlend_SurfRstEvolRad::BRepBlend_SurfRstEvolRad
(const Handle(Adaptor3d_Surface)& Surf,

2
src/BRepBuilderAPI/BRepBuilderAPI_MakeFace.hxx
View File

@ -72,7 +72,7 @@ public:
//! Not done.
Standard_EXPORT BRepBuilderAPI_MakeFace();
//! Load a face. Usefull to add wires.
//! Load a face. useful to add wires.
Standard_EXPORT BRepBuilderAPI_MakeFace(const TopoDS_Face& F);
//! Make a face from a plane.

2
src/BRepBuilderAPI/BRepBuilderAPI_MakeSolid.hxx
View File

@ -79,7 +79,7 @@ public:
//! these previous ones. Each must bound a closed volume.
Standard_EXPORT BRepBuilderAPI_MakeSolid(const TopoDS_Shell& S1, const TopoDS_Shell& S2, const TopoDS_Shell& S3);
//! Make a solid from a solid. Usefull for adding later.
//! Make a solid from a solid. useful for adding later.
Standard_EXPORT BRepBuilderAPI_MakeSolid(const TopoDS_Solid& So);
//! Add a shell to a solid.

2
src/BRepBuilderAPI/BRepBuilderAPI_MakeWire.hxx
View File

@ -112,7 +112,7 @@ public:
//! will raise an error, until a new connectable edge is added.
Standard_EXPORT BRepBuilderAPI_MakeWire(const TopoDS_Edge& E1, const TopoDS_Edge& E2, const TopoDS_Edge& E3, const TopoDS_Edge& E4);
//! Make a Wire from a Wire. Usefull for adding later.
//! Make a Wire from a Wire. useful for adding later.
Standard_EXPORT BRepBuilderAPI_MakeWire(const TopoDS_Wire& W);
//! Add an edge to a wire.

4
src/BRepBuilderAPI/BRepBuilderAPI_Sewing.cxx
View File

@ -3518,7 +3518,7 @@ Standard_Boolean BRepBuilderAPI_Sewing::MergedNearestEdges(const TopoDS_Shape& e
}
}
// Find all possible contigous edges
// Find all possible contiguous edges
TopTools_SequenceOfShape seqEdges;
seqEdges.Append(edge);
TopTools_MapOfShape mapEdges;
@ -3977,7 +3977,7 @@ static TopoDS_Edge DegeneratedSection(const TopoDS_Shape& section, const TopoDS_
// . if multiple edge
// - length < 100.*myTolerance -> several free edge
// . if no multiple edge
// - make the contigous edges sameparameter
// - make the contiguous edges sameparameter
//=======================================================================
void BRepBuilderAPI_Sewing::EdgeProcessing(const Message_ProgressRange& theProgress)

10
src/BRepBuilderAPI/BRepBuilderAPI_Sewing.hxx
View File

@ -60,10 +60,10 @@ DEFINE_STANDARD_HANDLE(BRepBuilderAPI_Sewing, Standard_Transient)
//! Provides methods to
//!
//! - identify possible contigous boundaries (for control
//! - identify possible contiguous boundaries (for control
//! afterwards (of continuity: C0, C1, ...))
//!
//! - assemble contigous shapes into one shape.
//! - assemble contiguous shapes into one shape.
//! Only manifold shapes will be found. Sewing will not
//! be done in case of multiple edges.
//!
@ -131,13 +131,13 @@ public:
//! Gives each multiple edge
Standard_EXPORT const TopoDS_Edge& MultipleEdge (const Standard_Integer index) const;
//! Gives the number of contigous edges (edge shared by two faces)
//! Gives the number of contiguous edges (edge shared by two faces)
Standard_EXPORT Standard_Integer NbContigousEdges() const;
//! Gives each contigous edge
//! Gives each contiguous edge
Standard_EXPORT const TopoDS_Edge& ContigousEdge (const Standard_Integer index) const;
//! Gives the sections (edge) belonging to a contigous edge
//! Gives the sections (edge) belonging to a contiguous edge
Standard_EXPORT const TopTools_ListOfShape& ContigousEdgeCouple (const Standard_Integer index) const;
//! Indicates if a section is bound (before use SectionToBoundary)

2
src/BRepCheck/BRepCheck_Wire.cxx
View File

@ -326,7 +326,7 @@ BRepCheck_Status BRepCheck_Wire::Closed(const Standard_Boolean Update)
return myCstat;
}
// Checks the number of occurence of an edge : maximum 2, and in this
// Checks the number of occurrence of an edge : maximum 2, and in this
// case, one time FORWARD and one time REVERSED
Standard_Boolean yabug = Standard_False;

2
src/BRepCheck/BRepCheck_Wire.hxx
View File

@ -64,7 +64,7 @@ public:
//! **BRepCheck_NotConnected, if wire is not
//! topologically closed
//! **BRepCheck_RedundantEdge, if an edge is in wire
//! more than 3 times or in case of 2 occurences if
//! more than 3 times or in case of 2 occurrences if
//! not with FORWARD and REVERSED orientation.
//! **BRepCheck_NoError
Standard_EXPORT BRepCheck_Status Closed (const Standard_Boolean Update = Standard_False);

2
src/BRepClass3d/BRepClass3d_Intersector3d.hxx
View File

@ -84,7 +84,7 @@ public:
//! The values can be either TopAbs_IN
//! ( the point is in the face)
//! or TopAbs_ON
//! ( the point is on a boudary of the face).
//! ( the point is on a boundary of the face).
TopAbs_State State() const;
//! Returns the significant face used to determine

2
src/BRepExtrema/BRepExtrema_OverlapTool.hxx
View File

@ -39,7 +39,7 @@ class BRepExtrema_OverlapTool : public BVH_PairTraverse <Standard_Real, 3>
{
public:
//! Creates new unitialized overlap tool.
//! Creates new uninitialized overlap tool.
BRepExtrema_OverlapTool();
//! Creates new overlap tool for the given element sets.

2
src/BRepExtrema/BRepExtrema_SelfIntersection.hxx
View File

@ -35,7 +35,7 @@ class BRepExtrema_SelfIntersection : public BRepExtrema_ElementFilter
public:
//! Creates unitialized self-intersection tool.
//! Creates uninitialized self-intersection tool.
Standard_EXPORT BRepExtrema_SelfIntersection (const Standard_Real theTolerance = 0.0);
//! Creates self-intersection tool for the given shape.

6
src/BRepFeat/BRepFeat_Builder.hxx
View File

@ -60,10 +60,10 @@ Standard_EXPORT virtual ~BRepFeat_Builder();
//! Clears internal fields and arguments.
Standard_EXPORT virtual void Clear() Standard_OVERRIDE;
//! Initialyzes the object of local boolean operation.
//! Initializes the object of local boolean operation.
Standard_EXPORT void Init (const TopoDS_Shape& theShape);
//! Initialyzes the arguments of local boolean operation.
//! Initializes the arguments of local boolean operation.
Standard_EXPORT void Init (const TopoDS_Shape& theShape, const TopoDS_Shape& theTool);
//! Sets the operation of local boolean operation.
@ -80,7 +80,7 @@ Standard_EXPORT virtual ~BRepFeat_Builder();
//! Collects parts of the tool.
Standard_EXPORT void PartsOfTool (TopTools_ListOfShape& theLT);
//! Initialyzes parts of the tool for second step of algorithm.
//! Initializes parts of the tool for second step of algorithm.
//! Collects shapes and all sub-shapes into myShapes map.
Standard_EXPORT void KeepParts (const TopTools_ListOfShape& theIm);

2
src/BRepFeat/BRepFeat_RibSlot.cxx
View File

@ -1300,7 +1300,7 @@ Standard_Boolean BRepFeat_RibSlot::SlidingProfile(TopoDS_Face& Prof,
Standard_Real par1 = ElCLib::Parameter(ln1->Lin(), myFirstPnt);
Standard_Real par2 = ElCLib::Parameter(ln2->Lin(), myLastPnt);
if(par1 >= myTol || par2 >= myTol) {
Concavite = 2; //paralel and concave
Concavite = 2; //parallel and concave
BRepLib_MakeEdge e1(myLastPnt, myFirstPnt);
WW.Add(e1);
}

2
src/BRepFill/BRepFill.cxx
View File

@ -1017,7 +1017,7 @@ TopoDS_Wire BRepFill::InsertACR(const TopoDS_Wire& wire,
TColStd_SequenceOfReal SR;
SR.Clear();
// the wire is always FORWARD
// it is necesary to modify the parameter of cut6 if the edge is REVERSED
// it is necessary to modify the parameter of cut6 if the edge is REVERSED
if (E.Orientation() == TopAbs_FORWARD) {
for (j=1; j<=ndec; j++) SR.Append(paradec(j));
}

2
src/BRepFill/BRepFill_CompatibleWires.cxx
View File

@ -1372,7 +1372,7 @@ void BRepFill_CompatibleWires::SameNumberByACR(const Standard_Boolean report)
dec2(k) = dec(k);
}
//Check of cuts: are all the new edges long enouph or not
//Check of cuts: are all the new edges long enough or not
TColStd_MapOfInteger CutsToRemove;
for (k = 1; k <= nbdec; k++)
{

2
src/BRepFill/BRepFill_Evolved.cxx
View File

@ -1084,7 +1084,7 @@ void BRepFill_Evolved::ElementaryPerform (const TopoDS_Face& Sp,
// Find if one of two faces connected to the edge
// belongs to volevo. The edges on this face serve
// to eliminate certain vertices that can appear twice
// on the parallel edge. These Vertices corespond to the
// on the parallel edge. These Vertices correspond to the
// nodes of the map.
//---------------------------------------------------------
TopoDS_Shape FaceControle;

11
src/BRepFill/BRepFill_LocationLaw.hxx
View File

@ -106,14 +106,13 @@ public:
//! 0 : It is connex (G0)
//! 1 : It is tangent (G1)
Standard_EXPORT Standard_Integer IsG1 (const Standard_Integer Index, const Standard_Real SpatialTolerance = 1.0e-7, const Standard_Real AngularTolerance = 1.0e-4) const;
//! Apply the Law to a shape, for a given Curnilinear abscissa
//! Apply the Law to a shape, for a given Curvilinear abscissa
Standard_EXPORT void D0 (const Standard_Real Abscissa, TopoDS_Shape& Section);
//! Find the index Law and the parmaeter, for a given
//! Curnilinear abscissa
//! Find the index Law and the parameter, for a given Curvilinear abscissa
Standard_EXPORT void Parameter (const Standard_Real Abscissa, Standard_Integer& Index, Standard_Real& Param);
//! Return the curvilinear abscissa corresponding to a point
//! of the path, defined by <Index> of Edge and a
//! parameter on the edge.

2
src/BRepFill/BRepFill_NSections.hxx
View File

@ -57,7 +57,7 @@ public:
//! Say if the Law is Constant.
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
//! Give the law build on a concatened section
//! Give the law build on a concatenated section
Standard_EXPORT virtual Handle(GeomFill_SectionLaw) ConcatenedLaw() const Standard_OVERRIDE;
Standard_EXPORT virtual GeomAbs_Shape Continuity (const Standard_Integer Index, const Standard_Real TolAngular) const Standard_OVERRIDE;

2
src/BRepFill/BRepFill_OffsetWire.hxx
View File

@ -67,7 +67,7 @@ public:
Standard_EXPORT BRepFill_OffsetWire(const TopoDS_Face& Spine, const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
//! Initialize the evaluation of Offseting.
//! Initialize the evaluation of Offsetting.
Standard_EXPORT void Init (const TopoDS_Face& Spine, const GeomAbs_JoinType Join = GeomAbs_Arc, const Standard_Boolean IsOpenResult = Standard_False);
//! Performs an OffsetWire at an altitude <Alt> from

16
src/BRepFill/BRepFill_PipeShell.hxx
View File

@ -125,18 +125,14 @@ public:
//! Possibilities are :
//! - Give one or sevral profile
//! - Give one profile and an homotetic law.
//! - Automatic compute of correspondance between profile, and section
//! on the sweeped shape
//! - correspondance between profile, and section on the sweeped shape
//! defined by a vertex of the spine
//! - Automatic compute of correspondence between profile, and section on the sweeped shape
//! - correspondence between profile, and section on the sweeped shape defined by a vertex of the spine
Standard_EXPORT void SetForceApproxC1 (const Standard_Boolean ForceApproxC1);
//! Set an section. The corespondance with the spine, will
//! be automaticaly performed.
//! Set an section. The correspondence with the spine, will be automaticaly performed.
Standard_EXPORT void Add (const TopoDS_Shape& Profile, const Standard_Boolean WithContact = Standard_False, const Standard_Boolean WithCorrection = Standard_False);
//! Set an section. The corespondance with the spine, is
//! given by <Location>
//! Set an section. The correspondence with the spine, is given by Location.
Standard_EXPORT void Add (const TopoDS_Shape& Profile, const TopoDS_Vertex& Location, const Standard_Boolean WithContact = Standard_False, const Standard_Boolean WithCorrection = Standard_False);
//! Set an section and an homotetic law.

2
src/BRepFill/BRepFill_ShapeLaw.hxx
View File

@ -60,7 +60,7 @@ public:
//! Say if the Law is Constant.
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
//! Give the law build on a concaneted section
//! Give the law build on a concatenated section
Standard_EXPORT virtual Handle(GeomFill_SectionLaw) ConcatenedLaw() const Standard_OVERRIDE;
Standard_EXPORT virtual GeomAbs_Shape Continuity (const Standard_Integer Index, const Standard_Real TolAngular) const Standard_OVERRIDE;

2
src/BRepFill/BRepFill_Sweep.cxx
View File

@ -2758,7 +2758,7 @@ BRepFill_Sweep::BRepFill_Sweep(const Handle(BRepFill_SectionLaw)& Section,
}
}
// (3.1) Reverse the faces that have been built ealier
// (3.1) Reverse the faces that have been built earlier
for (ipath = 1; ipath <= NbPath; ipath++)
for (isec = 1; isec <= NbLaw; isec++)
if (IsBuilt(isec))

2
src/BRepFill/BRepFill_Sweep.hxx
View File

@ -61,7 +61,7 @@ public:
//! Set Approximation Tolerance
//! Tol3d : Tolerance to surface approximation
//! Tol2d : Tolerance used to perform curve approximation
//! Normaly the 2d curve are approximated with a
//! Normally the 2d curve are approximated with a
//! tolerance given by the resolution on support surfaces,
//! but if this tolerance is too large Tol2d is used.
//! TolAngular : Tolerance (in radian) to control the angle

2
src/BRepFilletAPI/BRepFilletAPI_MakeChamfer.hxx
View File

@ -136,7 +136,7 @@ public:
//! Sets the mode of chamfer
Standard_EXPORT void SetMode (const ChFiDS_ChamfMode theMode);
//! return True if chamfer symetric false else.
//! return True if chamfer symmetric false else.
Standard_EXPORT Standard_Boolean IsSymetric (const Standard_Integer IC) const;
//! return True if chamfer is made with two distances false else.

12
src/BRepFilletAPI/BRepFilletAPI_MakeFillet2d.hxx
View File

@ -91,14 +91,12 @@ public:
//! - ChFi2d_NotPlanar if F is not planar,
//! - ChFi2d_NoFace if F is a null face.
Standard_EXPORT void Init (const TopoDS_Face& F);
//! This initialize method allow to init the builder
//! from a face <RefFace> and another face <ModFace>
//! which derive from <RefFace>. This is usefull to
//! modify a fillet or a chamfer already created on
//! <ModFace> .
//! This initialize method allow to init the builder
//! from a face RefFace and another face ModFace which derive from RefFace.
//! This is useful to modify a fillet or a chamfer already created on ModFace.
Standard_EXPORT void Init (const TopoDS_Face& RefFace, const TopoDS_Face& ModFace);
//! Adds a fillet of radius Radius between the two edges
//! adjacent to the vertex V on the face modified by this
//! algorithm. The two edges do not need to be rectilinear.

2
src/BRepGProp/BRepGProp_Cinert.hxx
View File

@ -32,7 +32,7 @@ class gp_Pnt;
//! It can be a curve as defined in the template CurveTool from
//! package GProp. This template gives the minimum of methods
//! required to evaluate the global properties of a curve 3D with
//! the algorithmes of GProp.
//! the algorithms of GProp.
class BRepGProp_Cinert : public GProp_GProps
{
public:

3
src/BRepLProp/BRepLProp.hxx
View File

@ -46,8 +46,7 @@ public:
//! tolerance used two compare the derivative.
Standard_EXPORT static GeomAbs_Shape Continuity (const BRepAdaptor_Curve& C1, const BRepAdaptor_Curve& C2, const Standard_Real u1, const Standard_Real u2, const Standard_Real tl, const Standard_Real ta);
//! The same as preciding but using the standard
//! tolerances from package Precision.
//! The same as preceding but using the standard tolerances from package Precision.
Standard_EXPORT static GeomAbs_Shape Continuity (const BRepAdaptor_Curve& C1, const BRepAdaptor_Curve& C2, const Standard_Real u1, const Standard_Real u2);

10
src/BRepLib/BRepLib.hxx
View File

@ -137,9 +137,9 @@ public:
//! -- -- MaxToleranceToCheck if so it will compute the
//! radius of -- the cylindrical pipe surface that
//! MinToleranceRequest is the minimum tolerance before it
//! is usefull to start testing. Usually it should be arround
//! 10e-5
//! contains all -- the curve represenation of the edge
//! is useful to start testing.
//! Usually it should be arround 10e-5
//! contains all -- the curve representation of the edge
//! returns True if the Edge tolerance had to be updated
Standard_EXPORT static Standard_Boolean UpdateEdgeTol (const TopoDS_Edge& E, const Standard_Real MinToleranceRequest, const Standard_Real MaxToleranceToCheck);
@ -147,8 +147,8 @@ public:
//! Tolerance is smaller than MaxToleranceToCheck --
//! Returns True if at least one edge was updated --
//! MinToleranceRequest is the minimum tolerance before
//! -- it -- is usefull to start testing. Usually it
//! should be arround -- 10e-5--
//! -- it -- is useful to start testing.
//! Usually it should be arround -- 10e-5--
//!
//! Warning :The method is very slow as it checks all.
//! Use only in interfaces or processing assimilate batch

4
src/BRepLib/BRepLib_CheckCurveOnSurface.hxx
View File

@ -26,10 +26,10 @@ public:
DEFINE_STANDARD_ALLOC
//! Default contructor
//! Default constructor
BRepLib_CheckCurveOnSurface() {}
//! Contructor
//! Constructor
Standard_EXPORT BRepLib_CheckCurveOnSurface(const TopoDS_Edge& theEdge,
const TopoDS_Face& theFace);

4
src/BRepLib/BRepLib_FuseEdges.cxx
View File

@ -594,9 +594,9 @@ void BRepLib_FuseEdges::Perform()
//=======================================================================
//function : BuildListConnexEdge
//purpose : giving one edge, build the list of connex edges which have
// vertices that have only two connex edges. All the edges that are addes
// vertices that have only two connex edges. All the edges that are added
// to the list must be added also to the mapUniq, in order for the caller
// to not treat again theses edges.
// to not treat again these edges.
// This list is always oriented in the "Forward" direction.
//=======================================================================

2
src/BRepLib/BRepLib_MakeFace.hxx
View File

@ -72,7 +72,7 @@ public:
//! Not done.
Standard_EXPORT BRepLib_MakeFace();
//! Load a face. Usefull to add wires.
//! Load a face. Useful to add wires.
Standard_EXPORT BRepLib_MakeFace(const TopoDS_Face& F);
//! Make a face from a plane.

2
src/BRepLib/BRepLib_MakeSolid.hxx
View File

@ -54,7 +54,7 @@ public:
//! Make a solid from three shells.
Standard_EXPORT BRepLib_MakeSolid(const TopoDS_Shell& S1, const TopoDS_Shell& S2, const TopoDS_Shell& S3);
//! Make a solid from a solid. Usefull for adding later.
//! Make a solid from a solid. Useful for adding later.
Standard_EXPORT BRepLib_MakeSolid(const TopoDS_Solid& So);
//! Add a shell to a solid.

2
src/BRepLib/BRepLib_MakeWire.hxx
View File

@ -101,7 +101,7 @@ public:
//! Make a Wire from four edges.
Standard_EXPORT BRepLib_MakeWire(const TopoDS_Edge& E1, const TopoDS_Edge& E2, const TopoDS_Edge& E3, const TopoDS_Edge& E4);
//! Make a Wire from a Wire. Usefull for adding later.
//! Make a Wire from a Wire. Useful for adding later.
Standard_EXPORT BRepLib_MakeWire(const TopoDS_Wire& W);
//! Add an edge to a wire.

2
src/BRepMesh/BRepMesh_CircleInspector.hxx
View File

@ -23,7 +23,7 @@
#include <gp_XYZ.hxx>
#include <NCollection_CellFilter.hxx>
//! Auxilary class to find circles shot by the given point.
//! Auxiliary class to find circles shot by the given point.
class BRepMesh_CircleInspector : public NCollection_CellFilter_InspectorXY
{
public:

2
src/BRepMesh/BRepMesh_CircleTool.hxx
View File

@ -83,7 +83,7 @@ public:
myFaceMax = theMax;
}
//! Retruns true if cell filter contains no circle.
//! Returns true if cell filter contains no circle.
Standard_Boolean IsEmpty () const
{
return mySelector.Circles ().IsEmpty ();

2
src/BRepMesh/BRepMesh_Classifier.hxx
View File

@ -27,7 +27,7 @@
class gp_Pnt2d;
class CSLib_Class2d;
//! Auxilary class intended for classification of points
//! Auxiliary class intended for classification of points
//! regarding internals of discrete face.
class BRepMesh_Classifier : public Standard_Transient
{

2
src/BRepMesh/BRepMesh_Context.hxx
View File

@ -18,7 +18,7 @@
#include <IMeshTools_Context.hxx>
//! Class implemeting default context of BRepMesh algorithm.
//! Class implementing default context of BRepMesh algorithm.
//! Initializes context by default algorithms.
class BRepMesh_Context : public IMeshTools_Context
{

2
src/BRepMesh/BRepMesh_CurveTessellator.hxx
View File

@ -70,7 +70,7 @@ private:
//! Adds internal vertices to discrete polygon.
void addInternalVertices ();
//Check deflection in 2d space for improvement of edge tesselation.
//Check deflection in 2d space for improvement of edge tessellation.
void splitByDeflection2d ();
void splitSegment (

6
src/BRepMesh/BRepMesh_DataStructureOfDelaun.hxx
View File

@ -162,9 +162,9 @@ public: //! @name API for accessing mesh links.
Standard_EXPORT void RemoveLink(const Standard_Integer theIndex,
const Standard_Boolean isForce = Standard_False);
//! Returns indices of elements conected to the link with the given index.
//! Returns indices of elements connected to the link with the given index.
//! @param theLinkIndex index of link whose data should be retrieved.
//! @return indices of elements conected to the link.
//! @return indices of elements connected to the link.
const BRepMesh_PairOfIndex& ElementsConnectedTo(
const Standard_Integer theLinkIndex) const
{
@ -222,7 +222,7 @@ public: //! @name API for accessing mesh elements.
public: //! @name Auxilary API
public: //! @name Auxiliary API
//! Dumps information about this structure.
//! @param theStream stream to be used for dump.

18
src/BRepMesh/BRepMesh_Delaun.cxx
View File

@ -936,7 +936,7 @@ void BRepMesh_Delaun::frontierAdjust()
cleanupMesh();
// When the mesh has been cleaned up, try to process frontier edges
// once again to fill the possible gaps that might be occured in case of "saw" -
// once again to fill the possible gaps that might be occurred in case of "saw" -
// situation when frontier edge has a triangle at a right side, but its free
// links cross another frontieres and meshLeftPolygonOf itself can't collect
// a closed polygon.
@ -953,7 +953,7 @@ void BRepMesh_Delaun::frontierAdjust()
//=======================================================================
//function : fillBndBox
//purpose : Add boundig box for edge defined by start & end point to
//purpose : Add bounding box for edge defined by start & end point to
// the given vector of bounding boxes for triangulation edges
//=======================================================================
void BRepMesh_Delaun::fillBndBox(IMeshData::SequenceOfBndB2d& theBoxes,
@ -1004,7 +1004,7 @@ Standard_Boolean BRepMesh_Delaun::meshLeftPolygonOf(
if ( aRefLinkDir.SquareMagnitude() < Precision2 )
return Standard_True;
// Auxilary structures.
// Auxiliary structures.
// Bounding boxes of polygon links to be used for preliminary
// analysis of intersections
IMeshData::SequenceOfBndB2d aBoxes;
@ -1096,7 +1096,7 @@ Standard_Boolean BRepMesh_Delaun::meshLeftPolygonOf(
// angle respect the given reference link.
// Each time the next link is found other neighbor links at the
// pivot node are marked as leprous and will be excluded from
// consideration next time until a hanging end is occured.
// consideration next time until a hanging end is occurred.
//=======================================================================
Standard_Integer BRepMesh_Delaun::findNextPolygonLink(
const Standard_Integer& theFirstNode,
@ -1204,7 +1204,7 @@ Standard_Integer BRepMesh_Delaun::findNextPolygonLink(
//=======================================================================
//function : checkIntersection
//purpose : Check is the given link intersects the polygon boundaries.
// Returns bounding box for the given link trough the
// Returns bounding box for the given link through the
// <theLinkBndBox> parameter.
//=======================================================================
Standard_Boolean BRepMesh_Delaun::checkIntersection(
@ -1454,7 +1454,7 @@ void BRepMesh_Delaun::killTrianglesAroundVertex(
}
}
// Add link to the survivers to avoid cycling
// Add link to the survivors to avoid cycling
theSurvivedLinks.Add( aNeighborLinkId );
killLinkTriangles( aNeighborLinkId, theLoopEdges );
}
@ -1760,7 +1760,7 @@ void BRepMesh_Delaun::meshPolygon(IMeshData::SequenceOfInteger& thePolygon,
// In this context only intersections between frontier edges
// are possible. If intersection between edges of different
// types occured - treat this case as invalid (i.e. result
// types occurred - treat this case as invalid (i.e. result
// might not reflect the expectations).
if ( !theSkipped.IsNull() )
{
@ -1771,7 +1771,7 @@ void BRepMesh_Delaun::meshPolygon(IMeshData::SequenceOfInteger& thePolygon,
}
else if ( aIntFlag == BRepMesh_GeomTool::PointOnSegment )
{
// Indentify chopping link
// Identify chopping link
Standard_Boolean isFirstChopping = Standard_False;
Standard_Integer aCheckPointIt = 0;
for ( ; aCheckPointIt < 2; ++aCheckPointIt )
@ -2034,7 +2034,7 @@ void BRepMesh_Delaun::decomposeSimplePolygon(
continue;
}
// Check is the test link crosses the polygon boudaries
// Check is the test link crosses the polygon boundaries
Standard_Boolean isIntersect = Standard_False;
for ( Standard_Integer aRefLinkNodeIt = 0; aRefLinkNodeIt < 2; ++aRefLinkNodeIt )
{

6
src/BRepMesh/BRepMesh_Delaun.hxx
View File

@ -176,7 +176,7 @@ private:
const Standard_Integer theCellsCountU,
const Standard_Integer theCellsCountV);
//! Add boundig box for edge defined by start & end point to
//! Add bounding box for edge defined by start & end point to
//! the given vector of bounding boxes for triangulation edges.
void fillBndBox (IMeshData::SequenceOfBndB2d& theBoxes,
const BRepMesh_Vertex& theV1,
@ -212,7 +212,7 @@ private:
//! angle respect the given reference link.
//! Each time the next link is found other neighbor links at the pivot
//! node are marked as leprous and will be excluded from consideration
//! next time until a hanging end is occured.
//! next time until a hanging end is occurred.
Standard_Integer findNextPolygonLink (const Standard_Integer& theFirstNode,
const Standard_Integer& thePivotNode,
const BRepMesh_Vertex& thePivotVertex,
@ -228,7 +228,7 @@ private:
Bnd_B2d& theNextLinkBndBox);
//! Check is the given link intersects the polygon boundaries.
//! Returns bounding box for the given link trough the theLinkBndBox parameter.
//! Returns bounding box for the given link through the theLinkBndBox parameter.
Standard_Boolean checkIntersection (const BRepMesh_Edge& theLink,
const IMeshData::SequenceOfInteger& thePolygon,
const IMeshData::SequenceOfBndB2d& thePolyBoxes,

2
src/BRepMesh/BRepMesh_Edge.hxx
View File

@ -57,7 +57,7 @@ public:
//! Checks if the given edge and this one have the same orientation.
//! @param theOther edge to be checked against this one.
//! \retrun TRUE if edges have the same orientation, FALSE if not.
//! \return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsSameOrientation(const BRepMesh_Edge& theOther) const
{
return BRepMesh_OrientedEdge::IsEqual(theOther);

2
src/BRepMesh/BRepMesh_FaceChecker.hxx
View File

@ -25,7 +25,7 @@
//! Auxiliary class checking wires of target face for self-intersections.
//! Explodes wires of discrete face on sets of segments using tessellation
//! data stored in model. Each segment is then checked for intersection with
//! other ones. All collisions are registerd and returned as result of check.
//! other ones. All collisions are registered and returned as result of check.
class BRepMesh_FaceChecker : public Standard_Transient
{
public: //! @name mesher API

2
src/BRepMesh/BRepMesh_GeomTool.cxx
View File

@ -505,7 +505,7 @@ Standard_Integer BRepMesh_GeomTool::classifyPoint(
if (thePointToCheck.IsEqual(thePoint1, aPrec) ||
thePointToCheck.IsEqual(thePoint2, aPrec))
{
return -1; //coinsides with an end point
return -1; //coincides with an end point
}
return 1;

4
src/BRepMesh/BRepMesh_GeomTool.hxx
View File

@ -57,7 +57,7 @@ public:
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
//! @param theMinPointsNb minimum nuber of points to be produced.
//! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const BRepAdaptor_Curve& theCurve,
const Standard_Real theFirstParam,
@ -77,7 +77,7 @@ public:
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
//! @param theMinPointsNb minimum nuber of points to be produced.
//! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const Handle(BRepAdaptor_Surface)& theSurface,
const GeomAbs_IsoType theIsoType,

2
src/BRepMesh/BRepMesh_IncrementalMesh.hxx
View File

@ -53,7 +53,7 @@ public: //! @name mesher API
const IMeshTools_Parameters& theParameters,
const Message_ProgressRange& theRange = Message_ProgressRange());
//! Performs meshing ot the shape.
//! Performs meshing of the shape.
Standard_EXPORT virtual void Perform(const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Performs meshing using custom context;

2
src/BRepMesh/BRepMesh_MeshTool.hxx
View File

@ -151,7 +151,7 @@ public:
Standard_EXPORT void CleanFrontierLinks();
//! Erases the given set of triangles.
//! Fills map of loop edges forming the countour surrounding the erased triangles.
//! Fills map of loop edges forming the contour surrounding the erased triangles.
void EraseTriangles(const IMeshData::MapOfInteger& theTriangles,
IMeshData::MapOfIntegerInteger& theLoopEdges);

2
src/BRepMesh/BRepMesh_ModelBuilder.hxx
View File

@ -23,7 +23,7 @@
//! Class implements interface representing tool for discrete model building.
//!
//! The following statuses should be used by default:
//! Message_Done1 - model has been sucessfully built.
//! Message_Done1 - model has been successfully built.
//! Message_Fail1 - empty shape.
//! Message_Fail2 - model has not been build due to unexpected reason.
class BRepMesh_ModelBuilder : public IMeshTools_ModelBuilder

4
src/BRepMesh/BRepMesh_ModelHealer.hxx
View File

@ -32,7 +32,7 @@
//! tolerances of 3D space only. This means that there are no specific
//! computations are made for the sake of determination of U and V tolerance.
//! Registers intersections on edges forming the face's shape and tries to
//! amplify discrete represenation by decreasing of deflection for the target edge.
//! amplify discrete representation by decreasing of deflection for the target edge.
//! Checks can be performed in parallel mode.
class BRepMesh_ModelHealer : public IMeshTools_ModelAlgo
{
@ -86,7 +86,7 @@ private:
//! Connects pcurves of previous and current edge on the specified face
//! according to topological connectivity. Uses next edge in order to
//! identify closest point in case of signle vertex shared between both
//! identify closest point in case of single vertex shared between both
//! ends of edge (degenerative edge)
Standard_Boolean connectClosestPoints(
const IMeshData::IPCurveHandle& thePrevDEdge,

2
src/BRepMesh/BRepMesh_ModelPreProcessor.cxx
View File

@ -172,7 +172,7 @@ namespace
return aSteps.second;
}
//! Splits 3D and all pcurves accoring using the specified step.
//! Splits 3D and all pcurves accordingly using the specified step.
Standard_Boolean splitEdge(const IMeshData::IEdgePtr& theDEdge,
const Standard_Real theDU) const
{

2
src/BRepMesh/BRepMesh_OrientedEdge.hxx
View File

@ -64,7 +64,7 @@ public:
//! Checks this and other edge for equality.
//! @param theOther edge to be checked against this one.
//! @retrun TRUE if edges have the same orientation, FALSE if not.
//! @return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsEqual(const BRepMesh_OrientedEdge& theOther) const
{
return (myFirstNode == theOther.myFirstNode && myLastNode == theOther.myLastNode);

2
src/BRepMesh/BRepMesh_PairOfIndex.hxx
View File

@ -69,7 +69,7 @@ public:
return (myIndex[0] < 0);
}
//! Returns number of initialized indeces.
//! Returns number of initialized indices.
Standard_Integer Extent() const
{
return (myIndex[0] < 0 ? 0 : (myIndex[1] < 0 ? 1 : 2));

Some files were not shown because too many files have changed in this diff Show More