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

Browse Source 
Fix various typos

Fixed via `codespell v2.0.dev`
This commit is contained in:
luz paz 2020-11-13 10:46:02 -05:00 committed by bugmaster
parent 81ff49158a
commit 21c7c45701
262 changed files with 488 additions and 488 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/Adaptor2d/Adaptor2d_Curve2d.hxx
View File

@ -74,7 +74,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const;

2
src/Adaptor2d/Adaptor2d_Line2d.hxx
View File

@ -75,7 +75,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/Adaptor2d/Adaptor2d_OffsetCurve.hxx
View File

@ -93,7 +93,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/Adaptor3d/Adaptor3d_Curve.hxx
View File

@ -76,7 +76,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const;

2
src/Adaptor3d/Adaptor3d_CurveOnSurface.hxx
View File

@ -100,7 +100,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/Adaptor3d/Adaptor3d_HCurve.hxx
View File

@ -80,7 +80,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const;

2
src/Adaptor3d/Adaptor3d_InterFunc.hxx
View File

@ -31,7 +31,7 @@ class Standard_ConstructionError;
//! Used to find the points U(t) = U0 or V(t) = V0 in
//! order to determine the Cn discontinuities of an
//! Adpator_CurveOnSurface relativly to the
//! Adpator_CurveOnSurface relatively to the
//! discontinuities of the surface. Used to
//! find the roots of the functions
class Adaptor3d_InterFunc : public math_FunctionWithDerivative

2
src/Adaptor3d/Adaptor3d_IsoCurve.hxx
View File

@ -102,7 +102,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/AdvApp2Var/AdvApp2Var_ApproxAFunc2Var.hxx
View File

@ -146,7 +146,7 @@ public:
Standard_EXPORT Standard_Real CritError (const Standard_Integer Dimension, const Standard_Integer Index) const;
//! Prints on the stream o informations on the current state
//! Prints on the stream 'o' information on the current state
//! of the object.
Standard_EXPORT void Dump (Standard_OStream& o) const;

2
src/AdvApp2Var/AdvApp2Var_MathBase.cxx
View File

@ -2705,7 +2705,7 @@ int AdvApp2Var_MathBase::mmcvctx_(integer *ndimen,
/* it is preferable to call a routine based on */
/* Lagrange or Hermite interpolation depending on the case. */
/* (for a high degree the matrix of the system can be badly */
/* conditionned). */
/* conditioned). */
/* This routine returns a curve defined in (-1,1). */
/* In general case, it is necessary to use MCVCTG. */
/* > */

8
src/AdvApp2Var/AdvApp2Var_SysBase.cxx
View File

@ -1483,7 +1483,7 @@ int mamdlng_(char *,//cmdlng,
/* FUNCTION : */
/* ---------- */
/* CONTAINS INFORMATIONS ABOUT THE COMPOSITION OF */
/* CONTAINS INFORMATION ABOUT THE COMPOSITION OF */
/* THE EXECUTABLE AND ITS ENVIRONMENT : */
/* - LANGUAGES */
/* - PRESENT APPLICATIONS */
@ -1700,15 +1700,15 @@ int maoverf_(integer *nbentr,
/* NLONGR*8 specific COMMON not by a routine as */
/* the initialisation is done by DATA. */
/* * If NBENTR<NLONGR, a part of the buffer is transfered*/
/* * If NBENTR<NLONGR, a part of the buffer is transferred*/
/* DTABLE in DTABLE. */
/* __________ */
/* ! amorce ! * Otherwise, the entire buffer is transfered in DTABLE. */
/* ! amorce ! * Otherwise, the entire buffer is transferred in DTABLE. */
/* !__________! This initiates it. Then a loop is execute, which at each
*/
/* ! temps 1 ! iteration transfers the part of the already initialized table */
/* !__________! in the one that was not yet initialized. */
/* ! ! The size of the zone transfered by each call to MCRFILL
/* ! ! The size of the zone transferred by each call to MCRFILL
*/
/* ! temps 2 ! is NLONGR*2**(numero_de_l'iteration). When
*/

2
src/AppDef/AppDef_BSplineCompute.hxx
View File

@ -118,7 +118,7 @@ public:
Standard_EXPORT void SetConstraints (const AppParCurves_Constraint firstC, const AppParCurves_Constraint lastC);
//! Sets periodic flag.
//! If thePeriodic = Standard_True, algorith tries to build periodic
//! If thePeriodic = Standard_True, algorithm tries to build periodic
//! multicurve using corresponding C1 boundary condition for first and last multipoints.
//! Multiline must be closed.
Standard_EXPORT void SetPeriodic(const Standard_Boolean thePeriodic);

2
src/AppDef/AppDef_Variational.cxx
View File

@ -1327,7 +1327,7 @@ void AppDef_Variational::TheMotor(
while(ToOptim) {
Iter++;
// (2.1) Save curent results
// (2.1) Save current results
VOCRI[0] = VALCRI[0];
VOCRI[1] = VALCRI[1];
VOCRI[2] = VALCRI[2];

4
src/Approx/Approx_Curve3d.hxx
View File

@ -34,13 +34,13 @@ public:
//! Approximation of a curve with respect of the
//! requiered tolerance Tol3D.
//! required tolerance Tol3D.
Standard_EXPORT Approx_Curve3d(const Handle(Adaptor3d_HCurve)& Curve, const Standard_Real Tol3d, const GeomAbs_Shape Order, const Standard_Integer MaxSegments, const Standard_Integer MaxDegree);
Standard_EXPORT Handle(Geom_BSplineCurve) Curve() const;
//! returns Standard_True if the approximation has
//! been done within requiered tolerance
//! been done within required tolerance
Standard_EXPORT Standard_Boolean IsDone() const;
//! returns Standard_True if the approximation did come out

2
src/Approx/Approx_CurveOnSurface.hxx
View File

@ -68,7 +68,7 @@ public:
Standard_EXPORT Standard_Real MaxError2dU() const;
//! returns the maximum errors relativly to the U component or the V component of the
//! returns the maximum errors relatively to the U component or the V component of the
//! 2d Curve
Standard_EXPORT Standard_Real MaxError2dV() const;

8
src/Approx/Approx_CurvlinFunc.hxx
View File

@ -67,7 +67,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const;
@ -82,12 +82,12 @@ public:
Standard_EXPORT Standard_Real GetLength() const;
//! returns original parameter correponding S. if
//! returns original parameter corresponding S. if
//! Case == 1 computation is performed on myC2D1 and mySurf1,
//! otherwise it is done on myC2D2 and mySurf2.
Standard_EXPORT Standard_Real GetUParameter (Adaptor3d_Curve& C, const Standard_Real S, const Standard_Integer NumberOfCurve) const;
//! returns original parameter correponding S.
//! returns original parameter corresponding S.
Standard_EXPORT Standard_Real GetSParameter (const Standard_Real U) const;
//! if myCase != 1
@ -116,7 +116,7 @@ private:
Standard_EXPORT void Init (Adaptor3d_Curve& C, Handle(TColStd_HArray1OfReal)& Si, Handle(TColStd_HArray1OfReal)& Ui) const;
//! returns curvilinear parameter correponding U.
//! returns curvilinear parameter corresponding U.
Standard_EXPORT Standard_Real GetSParameter (Adaptor3d_Curve& C, const Standard_Real U, const Standard_Real Length) const;
Standard_EXPORT Standard_Boolean EvalCurOnSur (const Standard_Real S, const Standard_Integer Order, TColStd_Array1OfReal& Result, const Standard_Integer NumberOfCurve) const;

8
src/Approx/Approx_SweepApproximation.hxx
View File

@ -76,11 +76,11 @@ public:
//! 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
//! beetween tangents on the section law and
//! tangent of iso-v on approximed surface
//! between tangents on the section law and
//! tangent of iso-v on approximated surface
//! Continuity : The continuity in v waiting on the surface
//! Degmax : The maximum degree in v requiered on the surface
//! Segmax : The maximum number of span in v requiered on
//! Degmax : The maximum degree in v required on the surface
//! Segmax : The maximum number of span in v required on
//! the surface
//! Warning : The continuity ci can be obtained only if Ft is Ci
Standard_EXPORT void Perform (const Standard_Real First, const Standard_Real Last, const Standard_Real Tol3d, const Standard_Real BoundTol, const Standard_Real Tol2d, const Standard_Real TolAngular, const GeomAbs_Shape Continuity = GeomAbs_C0, const Standard_Integer Degmax = 11, const Standard_Integer Segmax = 50);

2
src/Approx/Approx_SweepFunction.hxx
View File

@ -83,7 +83,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const = 0;

2
src/BOPAlgo/BOPAlgo_BuilderShape.hxx
View File

@ -158,7 +158,7 @@ protected: //! @name Fields
TopoDS_Shape myShape; //!< Result of the operation
TopTools_ListOfShape myHistShapes; //!< Storer for the history shapes
TopTools_MapOfShape myMapShape; //!< Cashed map of all arguments shapes
TopTools_MapOfShape myMapShape; //!< cached map of all arguments shapes
Standard_Boolean myFillHistory; //!< Controls the history filling
Handle(BRepTools_History) myHistory; //!< History tool

2
src/BOPAlgo/BOPAlgo_Tools.hxx
View File

@ -192,7 +192,7 @@ public:
//! @param theSolids - The solids to put internals to
//! @param theParts - The parts to classify relatively solids
//! @param theImages - Possible images of the parts that has to be classified
//! @param theContext - Cashed geometrical tools to speed-up classifications
//! @param theContext - cached geometrical tools to speed-up classifications
Standard_EXPORT static void FillInternals(const TopTools_ListOfShape& theSolids,
const TopTools_ListOfShape& theParts,
const TopTools_DataMapOfShapeListOfShape& theImages,

6
src/BOPTools/BOPTools_AlgoTools.hxx
View File

@ -323,7 +323,7 @@ public: //! @name Choosing correct orientation for the split shape
//!
//! @param theSplit [in] Split shape
//! @param theShape [in] Original shape
//! @param theContext [in] Cashed geometrical tools
//! @param theContext [in] cached geometrical tools
//! @param theError [out] Error Status of the operation
Standard_EXPORT static Standard_Boolean IsSplitToReverse(const TopoDS_Shape& theSplit,
const TopoDS_Shape& theShape,
@ -356,7 +356,7 @@ public: //! @name Choosing correct orientation for the split shape
//!
//! @param theSplit [in] Split face
//! @param theShape [in] Original face
//! @param theContext [in] Cashed geometrical tools
//! @param theContext [in] cached geometrical tools
//! @param theError [out] Error Status of the operation
Standard_EXPORT static Standard_Boolean IsSplitToReverse(const TopoDS_Face& theSplit,
const TopoDS_Face& theShape,
@ -381,7 +381,7 @@ public: //! @name Choosing correct orientation for the split shape
//!
//! @param theSplit [in] Split edge
//! @param theShape [in] Original edge
//! @param theContext [in] Cashed geometrical tools
//! @param theContext [in] cached geometrical tools
//! @param theError [out] Error Status of the operation
Standard_EXPORT static Standard_Boolean IsSplitToReverse(const TopoDS_Edge& theSplit,
const TopoDS_Edge& theShape,

2
src/BRep/BRep_Curve3D.cxx
View File

@ -44,7 +44,7 @@ BRep_Curve3D::BRep_Curve3D(const Handle(Geom_Curve)& C,
void BRep_Curve3D::D0(const Standard_Real U, gp_Pnt& P) const
{
// shoud be D0 NYI
// should be D0 NYI
P = myCurve->Value(U);
}

2
src/BRep/BRep_CurveOnSurface.cxx
View File

@ -48,7 +48,7 @@ BRep_CurveOnSurface::BRep_CurveOnSurface(const Handle(Geom2d_Curve)& PC,
void BRep_CurveOnSurface::D0(const Standard_Real U, gp_Pnt& P) const
{
// shoud be D0 NYI
// should be D0 NYI
gp_Pnt2d P2d = myPCurve->Value(U);
P = mySurface->Value(P2d.X(),P2d.Y());
P.Transform(myLocation.Transformation());

2
src/BRepAdaptor/BRepAdaptor_CompCurve.hxx
View File

@ -101,7 +101,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/BRepAdaptor/BRepAdaptor_Curve.hxx
View File

@ -137,7 +137,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/BRepAlgo/BRepAlgo_NormalProjection.hxx
View File

@ -56,7 +56,7 @@ public:
Standard_EXPORT void Add (const TopoDS_Shape& ToProj);
//! Set the parameters used for computation
//! Tol3d is the requiered tolerance between the 3d projected
//! Tol3d is the required tolerance between the 3d projected
//! curve and its 2d representation
//! InternalContinuity is the order of constraints
//! used for approximation.

2
src/BRepApprox/BRepApprox_TheComputeLineOfApprox.hxx
View File

@ -118,7 +118,7 @@ public:
Standard_EXPORT void SetConstraints (const AppParCurves_Constraint firstC, const AppParCurves_Constraint lastC);
//! Sets periodic flag.
//! If thePeriodic = Standard_True, algorith tries to build periodic
//! If thePeriodic = Standard_True, algorithm tries to build periodic
//! multicurve using corresponding C1 boundary condition for first and last multipoints.
//! Multiline must be closed.
Standard_EXPORT void SetPeriodic(const Standard_Boolean thePeriodic);

8
src/BRepBlend/BRepBlend_AppFuncRoot.hxx
View File

@ -85,7 +85,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;
@ -113,17 +113,17 @@ public:
//! Get the barycentre of Surface. An very poor
//! estimation is sufficent. This information is usefull
//! to perform well conditionned rational approximation.
//! 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 conditionned rational
//! information is usefull 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
//! perform well conditionned rational approximation.
//! perform well conditioned rational approximation.
Standard_EXPORT virtual void GetMinimalWeight (TColStd_Array1OfReal& Weigths) const Standard_OVERRIDE;
Standard_EXPORT virtual void Point (const Blend_AppFunction& Func, const Standard_Real Param, const math_Vector& Sol, Blend_Point& Pnt) const = 0;

2
src/BRepBlend/BRepBlend_HCurve2dTool.hxx
View File

@ -65,7 +65,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals (const Handle(Adaptor2d_HCurve2d)& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);

2
src/BRepBlend/BRepBlend_HCurveTool.hxx
View File

@ -65,7 +65,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals (const Handle(Adaptor3d_HCurve)& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);

6
src/BRepBlend/BRepBlend_PointOnRst.hxx
View File

@ -30,9 +30,9 @@ class IntSurf_Transition;
//! Definition of an intersection point between a line
//! and a restriction on a surface.
//! Such a point is contains geometrical informations (see
//! the Value method) and logical informations.
class BRepBlend_PointOnRst
//! Such a point is contains geometrical information (see
//! the Value method) and logical information.
class BRepBlend_PointOnRst
{
public:

6
src/BRepBlend/BRepBlend_RstRstConstRad.hxx
View File

@ -104,8 +104,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnRst1() const Standard_OVERRIDE;
@ -167,7 +167,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BRepBlend/BRepBlend_RstRstEvolRad.hxx
View File

@ -105,8 +105,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnRst1() const Standard_OVERRIDE;
@ -168,7 +168,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BRepBlend/BRepBlend_SurfRstConstRad.hxx
View File

@ -103,8 +103,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnS() const Standard_OVERRIDE;
@ -161,7 +161,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BRepBlend/BRepBlend_SurfRstEvolRad.hxx
View File

@ -104,8 +104,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnS() const Standard_OVERRIDE;
@ -160,7 +160,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/BRepBndLib/BRepBndLib.hxx
View File

@ -70,7 +70,7 @@ public:
Standard_EXPORT static void AddClose (const TopoDS_Shape& S, Bnd_Box& B);
//! Adds the shape S to the bounding box B.
//! This algorith builds precise bounding box,
//! This algorithm builds precise bounding box,
//! which differs from exact geometry boundaries of shape only on shape entities tolerances
//! Algorithm is the same as for method Add(..), but uses more precise methods for building boxes
//! for geometry objects.

12
src/BRepBuilderAPI/BRepBuilderAPI_Sewing.cxx
View File

@ -1063,7 +1063,7 @@ void BRepBuilderAPI_Sewing::EvaluateAngulars(TopTools_SequenceOfShape& sequenceS
//=======================================================================
// function : EvaluateDistances
// purpose : internal use
// Evaluate distance beetween edges with indice indRef and the following edges in the list
// Evaluate distance between edges with indice indRef and the following edges in the list
// Remarks (lengSec - indRef) must be >= 1
//=======================================================================
void BRepBuilderAPI_Sewing::EvaluateDistances(TopTools_SequenceOfShape& sequenceSec,
@ -1397,7 +1397,7 @@ void BRepBuilderAPI_Sewing::AnalysisNearestEdges(const TopTools_SequenceOfShape&
isRemove = Standard_True;
}
}
if(!isRemove) i++;
if(!isRemove) i++;
}
if(seqIndCandidate.Length() == 0 || seqNotCandidate.Length() == 1) return;
if(!evalDist) return;
@ -1405,8 +1405,8 @@ void BRepBuilderAPI_Sewing::AnalysisNearestEdges(const TopTools_SequenceOfShape&
TColStd_MapOfInteger MapIndex;
TColStd_SequenceOfInteger seqForward;
// Definition and removing edges wich are not candidate for work edge
// ( they have other nearest edges belonging to the work face)
// Definition and removing edges which are not candidate for work edge
// (they have other nearest edges belonging to the work face)
for(Standard_Integer k = 1; k<= seqNotCandidate.Length(); k++) {
Standard_Integer index1 = seqNotCandidate.Value(k);
TopoDS_Shape edge = sequenceSec.Value(index1);
@ -1932,7 +1932,7 @@ void BRepBuilderAPI_Sewing::Perform(const Message_ProgressRange& theProgress)
#endif
}
// create edge informations for output
// create edge information for output
CreateOutputInformations();
if (!aPS.More())
{
@ -2201,7 +2201,7 @@ void BRepBuilderAPI_Sewing::Dump() const
}
}
std::cout << " " << std::endl;
std::cout << " Informations " << std::endl;
std::cout << " Information " << std::endl;
std::cout << " ===========================================================" << std::endl;
std::cout << " " << std::endl;
std::cout << " Number of input shapes : " << myOldShapes.Extent() << std::endl;

2
src/BRepBuilderAPI/BRepBuilderAPI_Sewing.hxx
View File

@ -171,7 +171,7 @@ public:
//! Gives a modifieded subshape
Standard_EXPORT TopoDS_Shape ModifiedSubShape (const TopoDS_Shape& shape) const;
//! print the informations
//! print the information
Standard_EXPORT void Dump() const;
//! Gives the number of deleted faces (faces smallest than tolerance)

6
src/BRepCheck/BRepCheck_Face.cxx
View File

@ -216,7 +216,7 @@ BRepCheck_Status BRepCheck_Face::IntersectWires(const Standard_Boolean Update)
{
const TopoDS_Edge& anEdge = TopoDS::Edge (exp2.Current());
aC.Load (BRep_Tool::CurveOnSurface (anEdge, TopoDS::Face (myShape), aFirst, aLast));
// To avoid exeption in Segment if C1 is BSpline
// To avoid exception in Segment if C1 is BSpline
if (aC.FirstParameter() > aFirst)
{
aFirst = aC.FirstParameter();
@ -602,7 +602,7 @@ static Standard_Boolean Intersect(const TopoDS_Wire& wir1,
const TopoDS_Edge& edg1 = TopoDS::Edge(exp1.Current());
// cur1.Initialize(edg1,F);
C1.Load( BRep_Tool::CurveOnSurface(edg1,F,first1,last1) );
// To avoid exeption in Segment if C1 is BSpline - IFV
// To avoid exception in Segment if C1 is BSpline - IFV
if(C1.FirstParameter() > first1) first1 = C1.FirstParameter();
if(C1.LastParameter() < last1 ) last1 = C1.LastParameter();
@ -622,7 +622,7 @@ static Standard_Boolean Intersect(const TopoDS_Wire& wir1,
{
//cur2.Initialize(edg2,F);
C2.Load( BRep_Tool::CurveOnSurface(edg2,F,first2,last2) );
// To avoid exeption in Segment if C2 is BSpline - IFV
// To avoid exception in Segment if C2 is BSpline - IFV
if(C2.FirstParameter() > first2) first2 = C2.FirstParameter();
if(C2.LastParameter() < last2 ) last2 = C2.LastParameter();

4
src/BRepCheck/BRepCheck_Wire.cxx
View File

@ -999,7 +999,7 @@ BRepCheck_Status BRepCheck_Wire::SelfIntersect(const TopoDS_Face& F,
}
//
C1.Load(pcu);
// To avoid exeption in Segment if C1 is BSpline - IFV
// To avoid exception in Segment if C1 is BSpline - IFV
if(!C1.IsPeriodic()) {
if(C1.FirstParameter() > first1) {
first1 = C1.FirstParameter();
@ -1088,7 +1088,7 @@ BRepCheck_Status BRepCheck_Wire::SelfIntersect(const TopoDS_Face& F,
tabCur(j) = BRep_Tool::CurveOnSurface(E2,F,first2,last2);
if (!tabCur(j).IsNull() && last2 > first2) {
C2.Load(tabCur(j));
// To avoid exeption in Segment if C2 is BSpline - IFV
// To avoid exception in Segment if C2 is BSpline - IFV
if(!C2.IsPeriodic()) {
if(C2.FirstParameter() > first2) {
first2 = C2.FirstParameter();

2
src/BRepClass3d/BRepClass3d_SolidExplorer.cxx
View File

@ -14,7 +14,7 @@
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
// Modifed: Porting NT 7-5-97 DPF (stdio.h)
// Modified: Porting NT 7-5-97 DPF (stdio.h)
// Apr 16 2002 eap, classification against infinite solid (occ299)

2
src/BRepFeat/BRepFeat_MakeRevolutionForm.cxx
View File

@ -1245,7 +1245,7 @@ void BRepFeat_MakeRevolutionForm::Perform()
//=======================================================================
//function : Propagate
//purpose : propagation on the faces of the inital shape, find faces
//purpose : propagation on the faces of the initial shape, find faces
// concerned by the rib
//=======================================================================

2
src/BRepFeat/BRepFeat_SplitShape.hxx
View File

@ -65,7 +65,7 @@ public:
BRepFeat_SplitShape(const TopoDS_Shape& S);
//! Add splitting edges or wires for whole initial shape
//! withot additional specification edge->face, edge->edge
//! without additional specification edge->face, edge->edge
//! This method puts edge on the corresponding faces from initial shape
Standard_Boolean Add(const TopTools_SequenceOfShape& theEdges);

4
src/BRepFill/BRepFill_Evolved.cxx
View File

@ -1618,7 +1618,7 @@ void BRepFill_Evolved::PrepareProfile(TopTools_ListOfShape& WorkProf,
}
if (YaModif) {
//Status = 0 for the begining
//Status = 0 for the beginning
// 3 vertical
// 2 horizontal
// 1 other
@ -2824,7 +2824,7 @@ void ComputeIntervals (const TopTools_SequenceOfShape& VOnF,
while ( IOnF <= VOnF.Length() || IOnL <= VOnL.Length()) {
//---------------------------------------------------------
// Return the smallest parameter on the bissectrice
// correponding to the current positions IOnF,IOnL.
// corresponding to the current positions IOnF,IOnL.
//---------------------------------------------------------
if ( IOnL > VOnL.Length() ||
(IOnF <= VOnF.Length() &&

2
src/BRepFill/BRepFill_Filling.hxx
View File

@ -98,7 +98,7 @@ public:
//! Degree: it is the order of energy criterion to minimize for computing
//! the deformation of the surface.
//! The default value is 3
//! The recommanded value is i+2 where i is the maximum order of the
//! The recommended value is i+2 where i is the maximum order of the
//! constraints.
//! NbPtsOnCur: it is the average number of points for discretisation
//! of the edges.

4
src/BRepFill/BRepFill_LocationLaw.hxx
View File

@ -54,7 +54,7 @@ public:
Standard_EXPORT GeomFill_PipeError GetStatus() const;
//! Apply a linear transformation on each law, to have
//! continuity of the global law beetween the edges.
//! continuity of the global law between the edges.
Standard_EXPORT virtual void TransformInG0Law();
//! Apply a linear transformation on each law, to reduce
@ -100,7 +100,7 @@ public:
Standard_EXPORT Standard_Boolean IsClosed() const;
//! Compute the Law's continuity beetween 2 edges of the path
//! Compute the Law's continuity between 2 edges of the path
//! The result can be :
//! -1 : Case Not connex
//! 0 : It is connex (G0)

4
src/BRepFill/BRepFill_PipeShell.hxx
View File

@ -125,9 +125,9 @@ public:
//! Possibilities are :
//! - Give one or sevral profile
//! - Give one profile and an homotetic law.
//! - Automatic compute of correspondance beetween profile, and section
//! - Automatic compute of correspondance between profile, and section
//! on the sweeped shape
//! - correspondance beetween profile, and section on the sweeped shape
//! - correspondance between profile, and section on the sweeped shape
//! defined by a vertex of the spine
Standard_EXPORT void SetForceApproxC1 (const Standard_Boolean ForceApproxC1);

14
src/BRepFill/BRepFill_Sweep.hxx
View File

@ -65,8 +65,8 @@ public:
//! 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
//! beetween tangents on the section law and
//! tangent of iso-v on approximed surface
//! between tangents on the section law and
//! tangent of iso-v on approximated surface
Standard_EXPORT void SetTolerance (const Standard_Real Tol3d, const Standard_Real BoundTol = 1.0, const Standard_Real Tol2d = 1.0e-5, const Standard_Real TolAngular = 1.0e-2);
//! Tolerance To controle Corner management.
@ -84,15 +84,15 @@ public:
//! Transition define Transition strategy
//! Approx define Approximation Strategy
//! - GeomFill_Section : The composed Function Location X Section
//! is directly approximed.
//! - GeomFill_Location : The location law is approximed, and the
//! is directly approximated.
//! - GeomFill_Location : The location law is approximated, and the
//! SweepSurface is bulid algebric composition
//! of approximed location law and section law
//! of approximated location law and section law
//! This option is Ok, if Section.Surface() methode
//! is effective.
//! Continuity : The continuity in v waiting on the surface
//! Degmax : The maximum degree in v requiered on the surface
//! Segmax : The maximum number of span in v requiered on
//! Degmax : The maximum degree in v required on the surface
//! Segmax : The maximum number of span in v required on
//! the surface.
Standard_EXPORT void Build (TopTools_MapOfShape& ReversedEdges, BRepFill_DataMapOfShapeHArray2OfShape& Tapes, BRepFill_DataMapOfShapeHArray2OfShape& Rails, const BRepFill_TransitionStyle Transition = BRepFill_Modified, const GeomAbs_Shape Continuity = GeomAbs_C2, const GeomFill_ApproxStyle Approx = GeomFill_Location, const Standard_Integer Degmax = 11, const Standard_Integer Segmax = 30);

2
src/BRepGProp/BRepGProp_EdgeTool.hxx
View File

@ -75,7 +75,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT static void Intervals (const BRepAdaptor_Curve& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);

2
src/BRepLib/BRepLib.hxx
View File

@ -228,7 +228,7 @@ public:
//! is done.
Standard_EXPORT static void EncodeRegularity(const TopoDS_Shape& S, const TopTools_ListOfShape& LE, const Standard_Real TolAng = 1.0e-10);
//! Encodes the Regularity beetween <F1> and <F2> by <E>
//! Encodes the Regularity between <F1> and <F2> by <E>
//! Warning: <TolAng> is an angular tolerance, expressed in Rad.
//! Warning: If the edge's regularity is coded before, nothing
//! is done.

2
src/BRepLib/BRepLib_MakePolygon.hxx
View File

@ -74,7 +74,7 @@ public:
Standard_EXPORT void Add (const TopoDS_Vertex& V);
//! Returns True if the last vertex or point was
//! succesfully added.
//! successfully added.
Standard_EXPORT Standard_Boolean Added() const;
Standard_EXPORT void Close();

2
src/BRepMesh/BRepMesh_BaseMeshAlgo.cxx
View File

@ -72,7 +72,7 @@ void BRepMesh_BaseMeshAlgo::Perform(
commitSurfaceTriangulation();
}
}
catch (Standard_Failure const& /*theExeption*/)
catch (Standard_Failure const& /*theException*/)
{
}

2
src/BRepMesh/BRepMesh_Delaun.cxx
View File

@ -419,7 +419,7 @@ void BRepMesh_Delaun::RemoveAuxElements ()
//=======================================================================
//function : createTriangles
//purpose : Creates the triangles beetween the node and the polyline.
//purpose : Creates the triangles between the node and the polyline.
//=======================================================================
void BRepMesh_Delaun::createTriangles(const Standard_Integer theVertexIndex,
IMeshData::MapOfIntegerInteger& thePoly)

2
src/BRepMesh/BRepMesh_Delaun.hxx
View File

@ -262,7 +262,7 @@ private:
//! Triangulation of closed polygon containing only three edges.
Standard_Boolean meshElementaryPolygon (const IMeshData::SequenceOfInteger& thePolygon);
//! Creates the triangles beetween the given node and the given polyline.
//! Creates the triangles between the given node and the given polyline.
void createTriangles (const Standard_Integer theVertexIndex,
IMeshData::MapOfIntegerInteger& thePoly);

2
src/BRepMesh/BRepMesh_MeshTool.hxx
View File

@ -127,7 +127,7 @@ public:
}
//! Adds new link to mesh.
//! Updates link index and link orientaion parameters.
//! Updates link index and link orientation parameters.
void AddLink(const Standard_Integer theFirstNode,
const Standard_Integer theLastNode,
Standard_Integer& theLinkIndex,

2
src/BRepOffset/BRepOffset_MakeOffset.cxx
View File

@ -3708,7 +3708,7 @@ void CorrectSolid(TopoDS_Solid& theSol, TopTools_ListOfShape& theSolList)
//=======================================================================
//function : CheckInputData
//purpose : Check input data for possiblity of offset perform.
//purpose : Check input data for possibility of offset perform.
//=======================================================================
Standard_Boolean BRepOffset_MakeOffset::CheckInputData()
{

4
src/BRepOffset/BRepOffset_Tool.cxx
View File

@ -782,7 +782,7 @@ void BRepOffset_Tool::PipeInter(const TopoDS_Face& F1,
//=======================================================================
//function : IsAutonomVertex
//purpose : Checks wether a vertex is "autonom" or not
//purpose : Checks whether a vertex is "autonom" or not
//=======================================================================
static Standard_Boolean IsAutonomVertex(const TopoDS_Shape& theVertex,
@ -808,7 +808,7 @@ static Standard_Boolean IsAutonomVertex(const TopoDS_Shape& theVertex,
//=======================================================================
//function : IsAutonomVertex
//purpose : Checks wether a vertex is "autonom" or not
//purpose : Checks whether a vertex is "autonom" or not
//=======================================================================
static Standard_Boolean IsAutonomVertex(const TopoDS_Shape& aVertex,

2
src/BRepOffsetAPI/BRepOffsetAPI_MakeFilling.hxx
View File

@ -108,7 +108,7 @@ public:
//! Degree: it is the order of energy criterion to minimize for computing
//! the deformation of the surface.
//! The default value is 3
//! The recommanded value is i+2 where i is the maximum order of the
//! The recommended value is i+2 where i is the maximum order of the
//! constraints.
//! NbPtsOnCur: it is the average number of points for discretisation
//! of the edges.

6
src/BRepOffsetAPI/BRepOffsetAPI_MakePipeShell.hxx
View File

@ -84,7 +84,7 @@ public:
Standard_EXPORT void SetMode (const gp_Ax2& Axe);
//! Sets a fixed BiNormal direction to perform the --
//! sweeping. Angular relations beetween the
//! sweeping. Angular relations between the
//! section(s) and <BiNormal> will be constant
Standard_EXPORT void SetMode (const gp_Dir& BiNormal);
@ -118,9 +118,9 @@ public:
//! Possibilities are :
//! - Give one or sevral section
//! - Give one profile and an homotetic law.
//! - Automatic compute of correspondance beetween spine, and section
//! - Automatic compute of correspondance between spine, and section
//! on the sweeped shape
//! - correspondance beetween spine, and section on the sweeped shape
//! - correspondance between spine, and section on the sweeped shape
//! defined by a vertex of the spine
Standard_EXPORT void SetMode (const TopoDS_Wire& AuxiliarySpine, const Standard_Boolean CurvilinearEquivalence, const BRepFill_TypeOfContact KeepContact = BRepFill_NoContact);

2
src/BRepOffsetAPI/BRepOffsetAPI_NormalProjection.hxx
View File

@ -68,7 +68,7 @@ public:
Standard_EXPORT void Add (const TopoDS_Shape& ToProj);
//! Sets the parameters used for computation
//! Tol3 is the requiered tolerance between the 3d projected
//! Tol3 is the required tolerance between the 3d projected
//! curve and its 2d representation
//! InternalContinuity is the order of constraints
//! used for approximation

2
src/BRepPrim/BRepPrim_Revolution.hxx
View File

@ -31,7 +31,7 @@ class TopoDS_Edge;
class gp_Pnt2d;
//! Implement the OneAxis algoritm for a revolution
//! Implement the OneAxis algorithm for a revolution
//! surface.
class BRepPrim_Revolution : public BRepPrim_OneAxis
{

4
src/BRepTest/BRepTest_CheckCommands.cxx
View File

@ -357,7 +357,7 @@ static Standard_Integer checksection(Draw_Interpretor& di,
//=======================================================================
//function : checkdiff
//purpose : Checks the differences beetween a result and his arguments
//purpose : Checks the differences between a result and his arguments
//=======================================================================
static Standard_Integer checkdiff(Draw_Interpretor& di,
Standard_Integer narg, const char** a)
@ -1751,7 +1751,7 @@ void BRepTest::CheckCommands(Draw_Interpretor& theCommands)
g);
theCommands.Add("checkdiff",
"checks the validity of the diff beetween the shapes arg1..argn and result :\n checkdiff arg1 [arg2..argn] result [closedSolid (1/0)] [geomCtrl (1/0)]",
"checks the validity of the diff between the shapes arg1..argn and result :\n checkdiff arg1 [arg2..argn] result [closedSolid (1/0)] [geomCtrl (1/0)]",
__FILE__,
checkdiff,
g);

2
src/BRepTest/BRepTest_FeatureCommands.cxx
View File

@ -358,7 +358,7 @@ static void reportOffsetState(Draw_Interpretor& theCommands,
{
case BRepOffset_NoError:
{
theCommands << "OK. Offset performed succesfully.";
theCommands << "OK. Offset performed successfully.";
break;
}
case BRepOffset_BadNormalsOnGeometry:

2
src/BRepTools/BRepTools.hxx
View File

@ -148,7 +148,7 @@ public:
//! edge on the face.
Standard_EXPORT static void UpdateFaceUVPoints (const TopoDS_Face& theF);
//! Removes all cashed polygonal representation of the shape,
//! Removes all cached polygonal representation of the shape,
//! i.e. the triangulations of the faces of <S> and polygons on
//! triangulations and polygons 3d of the edges.
//! In case polygonal representation is the only available representation

2
src/BRepTools/BRepTools_ShapeSet.cxx
View File

@ -14,7 +14,7 @@
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
// Modifed: Portage NT 7-5-97 DPF (strcasecmp)
// Modified: Portage NT 7-5-97 DPF (strcasecmp)
#include <BRep_Builder.hxx>
#include <BRep_CurveOnClosedSurface.hxx>

18
src/BSplCLib/BSplCLib.hxx
View File

@ -68,7 +68,7 @@ class math_Matrix;
//!
//! Those methods have the following structure :
//!
//! - They extract the pole informations in a working array.
//! - They extract the pole information in a working array.
//!
//! - They process the working array with the
//! multi-dimension methods. (for example a 3d rational
@ -820,7 +820,7 @@ public:
//! same as the range of F(t)
//!
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//!
@ -847,7 +847,7 @@ public:
//! same as the range of F(t)
//!
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//!
@ -870,7 +870,7 @@ public:
//! of BSplineFlatKnots which is the
//! same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index
@ -892,7 +892,7 @@ public:
//! of BSplineFlatKnots which is the
//! same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index
@ -911,7 +911,7 @@ public:
//! NewDegree on the knots FlatKnots 2. the range of a(t)
//! is the same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index
@ -930,7 +930,7 @@ public:
//! NewDegree on the knots FlatKnots 2. the range of a(t)
//! is the same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index
@ -949,7 +949,7 @@ public:
//! NewDegree on the knots FlatKnots 2. the range of a(t)
//! is the same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index
@ -968,7 +968,7 @@ public:
//! NewDegree on the knots FlatKnots 2. the range of a(t)
//! is the same as the range of F(t)
//! Warning: it is
//! the caller's responsability to insure that conditions
//! the caller's responsibility to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//! theStatus will return 0 if OK else it will return the pivot index

4
src/BSplSLib/BSplSLib.cxx
View File

@ -14,8 +14,8 @@
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
// Modifed RLE Aug 93 - Complete rewrite
// xab 21-Mar-95 implemented cache mecanism
// Modified RLE Aug 93 - Complete rewrite
// xab 21-Mar-95 implemented cache mechanism
// pmn 25-09-96 Interpolation
// jct 25-09-96 : Correction de l'alloc de LocalArray dans RationalDerivative.
// pmn 07-10-96 : Correction de DN dans le cas rationnal.

4
src/BSplSLib/BSplSLib.hxx
View File

@ -59,7 +59,7 @@ class gp_Vec;
//!
//! Warnings : The bounds of UKnots and UMults should be the
//! same, the bounds of VKnots and VMults should be the same,
//! the bounds of Poles and Weights shoud be the same.
//! the bounds of Poles and Weights should be the same.
//!
//! The Control points representation is :
//! Poles(Uorigin,Vorigin) ...................Poles(Uorigin,Vend)
@ -399,7 +399,7 @@ public:
//! degree U/VNewDegree on the knots U/VFlatKnots 2. the range
//! of a(u,v) is the same as the range of N(u,v)
//! or D(u,v)
//! ---Warning: it is the caller's responsability to
//! ---Warning: it is the caller's responsibility to
//! insure that conditions 1. and 2. above are satisfied
//! : no check whatsoever is made in this method --
//! theStatus will return 0 if OK else it will return the

2
src/BSplSLib/BSplSLib_EvaluatorFunction.hxx
View File

@ -27,7 +27,7 @@
#include <Standard_PrimitiveTypes.hxx>
#endif
// Histroy - C function pointer converted to a virtual class
// History - C function pointer converted to a virtual class
// in order to get rid of usage of static functions and static data
class BSplSLib_EvaluatorFunction
{

2
src/BiTgte/BiTgte_Blend.cxx
View File

@ -1059,7 +1059,7 @@ void BiTgte_Blend::Perform(const Standard_Boolean BuildShape)
ChFi3d_ResultChron(ch, t_shape);
#endif
// Finally construct curves 3d from edges to be transfered
// Finally construct curves 3d from edges to be transferred
// since the partition is provided ( A Priori);
BRepLib::BuildCurves3d(myResult, Precision::Confusion());

2
src/BiTgte/BiTgte_CurveOnEdge.hxx
View File

@ -75,7 +75,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/BiTgte/BiTgte_CurveOnVertex.hxx
View File

@ -74,7 +74,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

2
src/BinDrivers/BinDrivers_DocumentStorageDriver.hxx
View File

@ -29,7 +29,7 @@ class BinLDrivers_DocumentSection;
class BinDrivers_DocumentStorageDriver;
DEFINE_STANDARD_HANDLE(BinDrivers_DocumentStorageDriver, BinLDrivers_DocumentStorageDriver)
//! persistent implemention of storage a document in a binary file
//! persistent implementation of storage a document in a binary file
class BinDrivers_DocumentStorageDriver : public BinLDrivers_DocumentStorageDriver
{

2
src/BinLDrivers/BinLDrivers_DocumentStorageDriver.hxx
View File

@ -41,7 +41,7 @@ class BinLDrivers_DocumentSection;
class BinLDrivers_DocumentStorageDriver;
DEFINE_STANDARD_HANDLE(BinLDrivers_DocumentStorageDriver, PCDM_StorageDriver)
//! persistent implemention of storage a document in a binary file
//! persistent implementation of storage a document in a binary file
class BinLDrivers_DocumentStorageDriver : public PCDM_StorageDriver
{

2
src/Bisector/Bisector_BisecPC.hxx
View File

@ -41,7 +41,7 @@ DEFINE_STANDARD_HANDLE(Bisector_BisecPC, Bisector_Curve)
//! Provides the bisector between a point and a curve.
//! the curvature on the curve has to be monoton.
//! the point can't be on the curve exept at the extremitys.
//! the point can't be on the curve exept at the extremities.
class Bisector_BisecPC : public Bisector_Curve
{

6
src/Blend/Blend_AppFunction.hxx
View File

@ -108,8 +108,8 @@ public:
Standard_EXPORT virtual Standard_Boolean IsSolution (const math_Vector& Sol,
const Standard_Real Tol) = 0;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const = 0;
//! Returns the point on the first support.
@ -135,7 +135,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
//! raises
//! OutOfRange from Standard

4
src/Blend/Blend_CSFunction.hxx
View File

@ -106,8 +106,8 @@ public:
//! the parameter on the guide line.
Standard_EXPORT virtual Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE = 0;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT virtual Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
//! Returns the point on the first support.

6
src/Blend/Blend_RstRstFunction.hxx
View File

@ -108,8 +108,8 @@ public:
//! the parameter on the guide line.
Standard_EXPORT virtual Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) = 0;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const;
//! Returns the point on the first support.
@ -178,7 +178,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const = 0;

6
src/Blend/Blend_SurfRstFunction.hxx
View File

@ -107,8 +107,8 @@ public:
//! the parameter on the guide line.
Standard_EXPORT virtual Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) = 0;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const;
//! Returns the point on the first support.
@ -172,7 +172,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT virtual void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const = 0;

2
src/BlendFunc/BlendFunc_CSCircular.hxx
View File

@ -159,7 +159,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
//! raises
//! OutOfRange from Standard

2
src/BlendFunc/BlendFunc_CSConstRad.hxx
View File

@ -146,7 +146,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
//! raises
//! OutOfRange from Standard

6
src/BlendFunc/BlendFunc_ChAsym.hxx
View File

@ -70,8 +70,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
//! computes the values <F> of the derivatives for the
@ -142,7 +142,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BlendFunc/BlendFunc_ConstRad.hxx
View File

@ -92,8 +92,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnS1() const Standard_OVERRIDE;
@ -147,7 +147,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BlendFunc/BlendFunc_EvolRad.hxx
View File

@ -92,8 +92,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnS1() const Standard_OVERRIDE;
@ -146,7 +146,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
Standard_EXPORT void Intervals (TColStd_Array1OfReal& T, const GeomAbs_Shape S) const Standard_OVERRIDE;

6
src/BlendFunc/BlendFunc_GenChamfer.hxx
View File

@ -82,8 +82,8 @@ public:
Standard_EXPORT void GetBounds (math_Vector& InfBound,
math_Vector& SupBound) const Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
//! Sets the distances and the "quadrant".
@ -105,7 +105,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
//! raises
//! OutOfRange from Standard

6
src/BlendFunc/BlendFunc_Ruled.hxx
View File

@ -87,8 +87,8 @@ public:
Standard_EXPORT Standard_Boolean IsSolution (const math_Vector& Sol, const Standard_Real Tol) Standard_OVERRIDE;
//! Returns the minimal Distance beetween two
//! extremitys of calculed sections.
//! Returns the minimal Distance between two
//! extremities of calculated sections.
Standard_EXPORT Standard_Real GetMinimalDistance() const Standard_OVERRIDE;
Standard_EXPORT const gp_Pnt& PointOnS1() const Standard_OVERRIDE;
@ -130,7 +130,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
//! raises
//! OutOfRange from Standard

6
src/Bnd/Bnd_B3x.gxx
View File

@ -363,7 +363,7 @@ Standard_Boolean Bnd_B3x::IsOut (const gp_Ax1& theLine,
(Standard_Real)myCenter[1] - theLine.Location().Y(),
(Standard_Real)myCenter[2] - theLine.Location().Z());
// Find the parameter interval in X dimention
// Find the parameter interval in X dimension
Standard_Real aHSize = (Standard_Real)myHSize[0]+theOverthickness;
if (aDir.X() > aRes) {
anInter0[0]= (aDiff.X() - aHSize) / aDir.X();
@ -376,7 +376,7 @@ Standard_Boolean Bnd_B3x::IsOut (const gp_Ax1& theLine,
if (Abs(aDiff.X()) > aHSize)
return Standard_True;
// Find the parameter interval in Y dimention
// Find the parameter interval in Y dimension
aHSize = (Standard_Real)myHSize[1]+theOverthickness;
if (aDir.Y() > aRes) {
anInter1[0]= (aDiff.Y() - aHSize) / aDir.Y();
@ -399,7 +399,7 @@ Standard_Boolean Bnd_B3x::IsOut (const gp_Ax1& theLine,
if (isRay && anInter0[1] < -aRes)
return Standard_True;
// Find the parameter interval in Z dimention
// Find the parameter interval in Z dimension
aHSize = (Standard_Real)myHSize[2]+theOverthickness;
if (aDir.Z() > aRes) {
anInter1[0]= (aDiff.Z() - aHSize) / aDir.Z();

2
src/BndLib/BndLib.hxx
View File

@ -72,7 +72,7 @@ public:
//! Adds the segment of the line L limited by the two
//! parameter values P1 and P2, to the bounding box B, and
//! then enlarges B by the tolerance value Tol.
//! Tol is the tolerance value to enlarge the minimun and maximum dimension
//! Tol is the tolerance value to enlarge the minimum and maximum dimension
//! P1 and P2 may represent infinite values.
//! Exceptions
//! Standard_Failure if P1 and P2 are either two negative

2
src/BndLib/BndLib_Add3dCurve.cxx
View File

@ -221,7 +221,7 @@ void BndLib_Add3dCurve::Add( const Adaptor3d_Curve& C,
else {
////////////////////////////////////////////////
// modified by NIZHNY-EAP Fri Dec 3 14:29:14 1999 ___BEGIN___
// To avoid exeption in Segment
// To avoid exception in Segment
if(Bsaux->FirstParameter() > U1) u1 = Bsaux->FirstParameter();
if(Bsaux->LastParameter() < U2 ) u2 = Bsaux->LastParameter();
// modified by NIZHNY-EAP Fri Dec 3 14:29:18 1999 ___END___

2
src/BndLib/BndLib_AddSurface.hxx
View File

@ -102,7 +102,7 @@ public:
Standard_EXPORT static void Add (const Adaptor3d_Surface& S, const Standard_Real UMin, const Standard_Real UMax, const Standard_Real VMin, const Standard_Real VMax, const Standard_Real Tol, Bnd_Box& B);
//! Adds the surface S to the bounding box B.
//! This algorith builds precise bounding box
//! This algorithm builds precise bounding box
Standard_EXPORT static void AddOptimal (const Adaptor3d_Surface& S, const Standard_Real Tol, Bnd_Box& B);

8
src/CPnts/CPnts_UniformDeflection.hxx
View File

@ -96,19 +96,19 @@ public:
//! As above with 2d curve
Standard_EXPORT CPnts_UniformDeflection(const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const Standard_Real Resolution, const Standard_Boolean WithControl);
//! Initialize the algoritms with <C>, <Deflection>, <UStep>,
//! Initialize the algorithms with <C>, <Deflection>, <UStep>,
//! <Resolution> and <WithControl>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const Standard_Real Resolution, const Standard_Boolean WithControl);
//! Initialize the algoritms with <C>, <Deflection>, <UStep>,
//! Initialize the algorithms with <C>, <Deflection>, <UStep>,
//! <Resolution> and <WithControl>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Real Resolution, const Standard_Boolean WithControl);
//! Initialize the algoritms with <C>, <Deflection>, <UStep>,
//! Initialize the algorithms with <C>, <Deflection>, <UStep>,
//! <U1>, <U2> and <WithControl>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const Standard_Real Resolution, const Standard_Boolean WithControl);
//! Initialize the algoritms with <C>, <Deflection>, <UStep>,
//! Initialize the algorithms with <C>, <Deflection>, <UStep>,
//! <U1>, <U2> and <WithControl>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const Standard_Real Resolution, const Standard_Boolean WithControl);

12
src/ChFi2d/ChFi2d_Builder.hxx
View File

@ -144,19 +144,19 @@ protected:
private:
//! Is internaly used by <AddFillet>.
//! Is internally used by <AddFillet>.
//! Warning: <TrimE1>, <TrimE2>, <Fillet> has sense only if the
//! status <status> is equal to <IsDone>
Standard_EXPORT void ComputeFillet (const TopoDS_Vertex& V, const TopoDS_Edge& E1, const TopoDS_Edge& E2, const Standard_Real Radius, TopoDS_Edge& TrimE1, TopoDS_Edge& TrimE2, TopoDS_Edge& Fillet);
//! Is internaly used by <AddChamfer>. The chamfer is
//! Is internally used by <AddChamfer>. The chamfer is
//! computed from a vertex, two edges and two
//! distances
//! Warning: <TrimE1>, <TrimE2> and <Chamfer> has sense only if
//! if the status <status> is equal to <IsDone>
Standard_EXPORT void ComputeChamfer (const TopoDS_Vertex& V, const TopoDS_Edge& E1, const TopoDS_Edge& E2, const Standard_Real D1, const Standard_Real D2, TopoDS_Edge& TrimE1, TopoDS_Edge& TrimE2, TopoDS_Edge& Chamfer);
//! Is internaly used by <AddChamfer>. The chamfer is
//! Is internally used by <AddChamfer>. The chamfer is
//! computed from an edge, a vertex, a distance
//! and an angle
//! Warning: <TrimE1>, <TrimE2>, and <Chamfer> has
@ -164,7 +164,7 @@ private:
//! <IsDone>
Standard_EXPORT void ComputeChamfer (const TopoDS_Vertex& V, const TopoDS_Edge& E1, const Standard_Real D, const Standard_Real Ang, const TopoDS_Edge& E2, TopoDS_Edge& TrimE1, TopoDS_Edge& TrimE2, TopoDS_Edge& Chamfer);
//! Is internaly used by <ComputeFillet>.
//! Is internally used by <ComputeFillet>.
//! <NewExtr1> and <NewExtr2> will contains the new
//! extremities of <AdjEdge1> and <AdjEdge2>
//! Warning: The returned edge has sense only if the status
@ -175,14 +175,14 @@ private:
//! <BothEdgesDegenerated>
Standard_EXPORT TopoDS_Edge BuildFilletEdge (const TopoDS_Vertex& V, const TopoDS_Edge& AdjEdge1, const TopoDS_Edge& AdjEdge2, const Standard_Real Radius, TopoDS_Vertex& NewExtr1, TopoDS_Vertex& NewExtr2);
//! Is internaly used by <ComputeFillet>.
//! Is internally used by <ComputeFillet>.
//! <NewExtr1> and <NewExtr2> will contains the new
//! extremities of <AdjEdge1> and <AdjEdge2>
//! Warning: The returned edge has sense only if the status
//! <status> is equal to <IsDone>
Standard_EXPORT TopoDS_Edge BuildChamferEdge (const TopoDS_Vertex& V, const TopoDS_Edge& AdjEdge1, const TopoDS_Edge& AdjEdge2, const Standard_Real D1, const Standard_Real D2, TopoDS_Vertex& NewExtr1, TopoDS_Vertex& NewExtr2);
//! Is internaly used by <ComputeFillet>.
//! Is internally used by <ComputeFillet>.
//! <NewExtr1> and <NewExtr2> will contains the new
//! extremities of <AdjEdge1> and <AdjEdge2>
//! Warning: The returned edge has sense only if the status

2
src/ChFi2d/ChFi2d_FilletAPI.cxx
View File

@ -113,7 +113,7 @@ Standard_Boolean ChFi2d_FilletAPI::IsAnalytical(const TopoDS_Edge& theEdge1,
(AC2.GetType() == GeomAbs_Line || AC2.GetType() == GeomAbs_Circle))
{
// The edges are lines or arcs of circle.
// Now check wether they have a common point.
// Now check whether they have a common point.
gp_Pnt p11 = AC1.Value(AC1.FirstParameter());
gp_Pnt p12 = AC1.Value(AC1.LastParameter());
gp_Pnt p21 = AC2.Value(AC2.FirstParameter());

2
src/ChFi2d/ChFi2d_FilletAlgo.cxx
View File

@ -507,7 +507,7 @@ int ChFi2d_FilletAlgo::NbResults(const gp_Pnt& thePoint)
return nb;
}
// returns result (fillet edge, modified edge1, modified edge2), neares to the given point <thePoint>
// returns result (fillet edge, modified edge1, modified edge2), nearest to the given point <thePoint>
TopoDS_Edge ChFi2d_FilletAlgo::Result(const gp_Pnt& thePoint, TopoDS_Edge& theEdge1, TopoDS_Edge& theEdge2, const int iSolution)
{
TopoDS_Edge aResult;

14
src/ChFi2d/ChFi2d_FilletAlgo.hxx
View File

@ -87,18 +87,18 @@ public:
Standard_EXPORT Standard_Boolean Perform(const Standard_Real theRadius);
//! Returns number of possible solutions.
//! <thePoint> chooses a particular fillet in case of several fillets
//! <thePoint> chooses a particular fillet in case of several fillets
//! may be constructed (for example, a circle intersecting a segment in 2 points).
//! Put the intersecting (or common) point of the edges.
Standard_EXPORT Standard_Integer NbResults(const gp_Pnt& thePoint);
//! Returns result (fillet edge, modified edge1, modified edge2),
//! neares to the given point <thePoint> if iSolution == -1.
//! <thePoint> chooses a particular fillet in case of several fillets
//! Returns result (fillet edge, modified edge1, modified edge2),
//! nearest to the given point <thePoint> if iSolution == -1.
//! <thePoint> chooses a particular fillet in case of several fillets
//! may be constructed (for example, a circle intersecting a segment in 2 points).
//! Put the intersecting (or common) point of the edges.
Standard_EXPORT TopoDS_Edge Result(const gp_Pnt& thePoint,
TopoDS_Edge& theEdge1, TopoDS_Edge& theEdge2,
Standard_EXPORT TopoDS_Edge Result(const gp_Pnt& thePoint,
TopoDS_Edge& theEdge1, TopoDS_Edge& theEdge2,
const Standard_Integer iSolution = -1);
private:
@ -107,7 +107,7 @@ private:
void FillPoint(FilletPoint*, const Standard_Real theLimit);
//! Computes the derivative value of the function in the current point.
//! <theDiffStep> is small step for approximate derivative computation
//! <theFront> is direction of the step: from or reverced
//! <theFront> is direction of the step: from or reversed
void FillDiff(FilletPoint*, Standard_Real theDiffStep, Standard_Boolean theFront);
//! Using Newton methods computes optimal point, that can be root of the
//! function taking into account two input points, functions value and derivatives.

4
src/ChFiDS/ChFiDS_SurfData.hxx
View File

@ -107,11 +107,11 @@ public:
Standard_EXPORT Standard_Integer Index (const Standard_Integer OfS) const;
//! returns one of the four vertices wether First is true
//! returns one of the four vertices whether First is true
//! or wrong and OnS equals 1 or 2.
Standard_EXPORT const ChFiDS_CommonPoint& Vertex (const Standard_Boolean First, const Standard_Integer OnS) const;
//! returns one of the four vertices wether First is true
//! returns one of the four vertices whether First is true
//! or wrong and OnS equals 1 or 2.
Standard_EXPORT ChFiDS_CommonPoint& ChangeVertex (const Standard_Boolean First, const Standard_Integer OnS);

2
src/Contap/Contap_HCurve2dTool.hxx
View File

@ -65,7 +65,7 @@ public:
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accomodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals (const Handle(Adaptor2d_HCurve2d)& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);

4
src/Contap/Contap_Point.hxx
View File

@ -36,8 +36,8 @@ class IntSurf_Transition;
//! Most of the time, such a point is an intersection
//! between the contour and a restriction of the surface.
//! When it is not tyhe method IsOnArc return False.
//! Such a point is contains geometrical informations (see
//! the Value method) and logical informations.
//! Such a point is contains geometrical information (see
//! the Value method) and logical information.
class Contap_Point
{
public:

8
src/Convert/Convert_GridPolynomialToPoles.cxx
View File

@ -53,9 +53,9 @@ Convert_GridPolynomialToPoles(
myVDegree = NumCoeffPerSurface->Value(2)-1;
if (myUDegree > MaxUDegree)
throw Standard_DomainError("Convert : Incoherence beetween NumCoeffPerSurface and MaxUDegree");
throw Standard_DomainError("Convert : Incoherence between NumCoeffPerSurface and MaxUDegree");
if (myVDegree > MaxVDegree)
throw Standard_DomainError("Convert : Incoherence beetween NumCoeffPerSurface and MaxVDegree");
throw Standard_DomainError("Convert : Incoherence between NumCoeffPerSurface and MaxVDegree");
Handle(TColStd_HArray2OfInteger) NumCoeff =
new (TColStd_HArray2OfInteger)(1, 1, 1, 2);
@ -119,9 +119,9 @@ Convert_GridPolynomialToPoles(
}
if (myUDegree > RealUDegree)
throw Standard_DomainError("Convert : Incoherence beetween NumCoeffPerSurface and MaxUDegree");
throw Standard_DomainError("Convert : Incoherence between NumCoeffPerSurface and MaxUDegree");
if (myVDegree > RealVDegree)
throw Standard_DomainError("Convert : Incoherence beetween NumCoeffPerSurface and MaxVDegree");
throw Standard_DomainError("Convert : Incoherence between NumCoeffPerSurface and MaxVDegree");
Perform (UContinuity, VContinuity,
RealUDegree, RealVDegree,

2
src/DBRep/DBRep_HideData.hxx
View File

@ -33,7 +33,7 @@ class Draw_Display;
class Draw_Color;
//! This class stores all the informations concerning
//! This class stores all the information concerning
//! hidden lines on a view.
//!
//! * View number

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