//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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
//! 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;
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;
/* 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. */
/* > */
/* FUNCTION : */
/* ---------- */
-/* CONTAINS INFORMATIONS ABOUT THE COMPOSITION OF */
+/* CONTAINS INFORMATION ABOUT THE COMPOSITION OF */
/* THE EXECUTABLE AND ITS ENVIRONMENT : */
/* - LANGUAGES */
/* - PRESENT APPLICATIONS */
/* 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
*/
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);
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];
//! 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
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;
//! 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_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
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;
//! 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);
//! 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;
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
//! @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,
//!
//! @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,
//!
//! @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,
//!
//! @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,
void BRep_Curve3D::D0(const Standard_Real U, gp_Pnt& P) const
{
- // shoud be D0 NYI
+ // should be D0 NYI
P = myCurve->Value(U);
}
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());
//! 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;
//! 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;
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.
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);
//! 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;
//! 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;
//! 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);
//! 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);
//! 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:
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;
//! 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;
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;
//! 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;
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;
//! 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;
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;
//! 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;
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.
//=======================================================================
// 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,
isRemove = Standard_True;
}
}
- if(!isRemove) i++;
+ if(!isRemove) i++;
}
if(seqIndCandidate.Length() == 0 || seqNotCandidate.Length() == 1) return;
if(!evalDist) return;
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);
#endif
}
- // create edge informations for output
+ // create edge information for output
CreateOutputInformations();
if (!aPS.More())
{
}
}
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;
//! 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)
{
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();
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();
{
//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();
}
//
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();
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();
// 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)
//=======================================================================
//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
//=======================================================================
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);
}
if (YaModif) {
- //Status = 0 for the begining
+ //Status = 0 for the beginning
// 3 vertical
// 2 horizontal
// 1 other
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() &&
//! 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.
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
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)
//! 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);
//! 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.
//! 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);
//! 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);
//! 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.
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();
commitSurfaceTriangulation();
}
}
- catch (Standard_Failure const& /*theExeption*/)
+ catch (Standard_Failure const& /*theException*/)
{
}
//=======================================================================
//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)
//! 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);
}
//! 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,
//=======================================================================
//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()
{
//=======================================================================
//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,
//=======================================================================
//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,
//! 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.
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);
//! 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);
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
class gp_Pnt2d;
-//! Implement the OneAxis algoritm for a revolution
+//! Implement the OneAxis algorithm for a revolution
//! surface.
class BRepPrim_Revolution : public BRepPrim_OneAxis
{
//=======================================================================
//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)
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);
{
case BRepOffset_NoError:
{
- theCommands << "OK. Offset performed succesfully.";
+ theCommands << "OK. Offset performed successfully.";
break;
}
case BRepOffset_BadNormalsOnGeometry:
//! 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
// 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>
//!
//! 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
//! 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
//!
//! 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
//!
//! 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
//! 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
//! 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
//! 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
//! 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
//! 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
// 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.
//!
//! 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)
//! 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
#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
{
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());
//! 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;
//! 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;
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
{
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
{
//! 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
{
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.
//! 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
//! 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.
//! 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.
//! 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;
//! 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.
//! 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;
//! 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
//! 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
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
//! 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;
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;
//! 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;
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;
//! 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;
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".
//! 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
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;
//! 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
(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();
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();
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();
//! 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
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___
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);
//! 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);
private:
- //! Is internaly used by <AddFillet>.
+ //! Is internal
ly 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 internal
ly 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 internal
ly used by <AddChamfer>. The chamfer is
//! computed from an edge, a vertex, a distance
//! and an angle
//! Warning: <TrimE1>, <TrimE2>, and <Chamfer> has
//! <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
//! <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
(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());
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;
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:
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.
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);
//! 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);
//! 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:
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);
}
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,
class Draw_Color;
-//! This class stores all the informations concerning
+//! This class stores all the information concerning
//! hidden lines on a view.
//!
//! * View number
//! Returns a string composed with the list of
//! referenced attribute index of the attribute
//! <anIndex>. For exemple, it is usefull for
- //! TDataStd_Group. It uses a mecanism based on a
+ //! TDataStd_Group. It uses a mechanism based on a
//! DDF_AttributeBrowser.
Standard_EXPORT TCollection_AsciiString OpenAttribute (const Standard_Integer anIndex = 0);
else {
TDF_Tool::Entry(funLabel, entry);
try {
- // We clear the logbook because the execution starts not from the begining of the function list (some functions ar skipped).
+ // We clear the logbook because the execution starts not from the beginning of the function list (some functions ar skipped).
logbook->Clear();
Standard_Integer aRes = ComputeFunction(aFun, logbook);
if(aRes != 0) {
//! be given by ProblematicShape
Standard_EXPORT void Perform();
- //! Returns True if Perform has been succesfully
+ //! Returns True if Perform has been successfully
//! called. Otherwise more information can be obtained
//! using the methods Error() and ProblematicShape().
Standard_EXPORT Standard_Boolean IsDone() const;
}
catch (Standard_Failure const&) {
#ifdef OCCT_DEBUG
- std::cout <<"Tcl_Exit have an exeption" << std::endl;
+ std::cout <<"Tcl_Exit have an exception" << std::endl;
#endif
}
#else
char c = *p;
*p = '\0';
- if (Numeric(*name)) // numeric litteral
+ if (Numeric(*name)) // numeric literal
x = Atof(name);
else if (!Draw::Get((Standard_CString) name,x)) { // variable
static Standard_Boolean SaveBitmap (HBITMAP theHBitmap,
const char* theFileName)
{
- // Get informations about the bitmap
+ // Get information about the bitmap
BITMAP aBitmap;
if (GetObjectW (theHBitmap, sizeof(BITMAP), &aBitmap) == 0)
{
//! 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 (Adaptor3d_Curve& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);
Standard_EXPORT virtual Standard_Real Value() = 0;
//! To Compute J(E) the coefficients of Hessian matrix of
- //! J(E) wich are crossed derivatives in dimensions <Dim1>
+ //! J(E) which are crossed derivatives in dimensions <Dim1>
//! and <Dim2>.
//! If DependenceTable(Dimension1,Dimension2) is False
Standard_EXPORT virtual void Hessian (const Standard_Integer Dim1, const Standard_Integer Dim2, math_Matrix& H) = 0;
//! successfully, False otherwise.
Standard_EXPORT virtual Standard_Boolean Values (const math_Vector& X, Standard_Real& E, math_Vector& G, math_Matrix& H) Standard_OVERRIDE;
- //! compute the variables <X> wich correspond with the field <MyPoles>
+ //! compute the variables <X> which correspond with the field <MyPoles>
Standard_EXPORT virtual Standard_Boolean Variable (math_Vector& X) const;
//! return the poles
//! ConstrOrder1(2) can be equal to 0, 1 or 2
Standard_EXPORT FairCurve_Energy(const Handle(TColgp_HArray1OfPnt2d)& Poles, const Standard_Integer ConstrOrder1, const Standard_Integer ConstrOrder2, const Standard_Boolean WithAuxValue = Standard_False, const Standard_Real Angle1 = 0, const Standard_Real Angle2 = 0, const Standard_Integer Degree = 2, const Standard_Real Curvature1 = 0, const Standard_Real Curvature2 = 0);
- //! It is use internaly to make the Gradient Vector <G>
+ //! It is use internally to make the Gradient Vector <G>
Standard_EXPORT void Gradient1 (const math_Vector& TheVector, math_Vector& G);
- //! It is use internaly to make the Hessian Matrix <H>
+ //! It is use internally to make the Hessian Matrix <H>
Standard_EXPORT void Hessian1 (const math_Vector& TheVector, math_Matrix& H);
- //! compute the poles wich correspond with the variable X
+ //! compute the poles which correspond with the variable X
Standard_EXPORT virtual void ComputePoles (const math_Vector& X);
Standard_Integer Indice (const Standard_Integer i, const Standard_Integer j) const;
- //! compute the pole wich depend of variables and G1 constraint
+ //! compute the pole which depend of variables and G1 constraint
Standard_EXPORT void ComputePolesG1 (const Standard_Integer Side, const Standard_Real Lambda, const gp_Pnt2d& P1, gp_Pnt2d& P2) const;
- //! compute the pole wich depend of variables and G2 constraint
+ //! compute the pole which depend of variables and G2 constraint
Standard_EXPORT void ComputePolesG2 (const Standard_Integer Side, const Standard_Real Lambda, const Standard_Real Rho, const gp_Pnt2d& P1, gp_Pnt2d& P2) const;
//! compute the energy (and derivatives) in intermediat format
//! return the status
FairCurve_AnalysisCode Status() const;
- //! compute the variables <X> wich correspond with the field <MyPoles>
+ //! compute the variables <X> which correspond with the field <MyPoles>
Standard_EXPORT virtual Standard_Boolean Variable (math_Vector& X) const Standard_OVERRIDE;
protected:
- //! compute the poles wich correspond with the variable X
+ //! compute the poles which correspond with the variable X
Standard_EXPORT virtual void ComputePoles (const math_Vector& X) Standard_OVERRIDE;
//! compute the energy in intermediat format
//! return the status
FairCurve_AnalysisCode Status() const;
- //! compute the variables <X> wich correspond with the field <MyPoles>
+ //! compute the variables <X> which correspond with the field <MyPoles>
Standard_EXPORT virtual Standard_Boolean Variable (math_Vector& X) const Standard_OVERRIDE;
protected:
- //! compute the poles wich correspond with the variable X
+ //! compute the poles which correspond with the variable X
Standard_EXPORT virtual void ComputePoles (const math_Vector& X) Standard_OVERRIDE;
//! compute the energy in intermediat format
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
-// Modifed: Portage NT 7-5-97 DPF (return)
+// Modified: Portage NT 7-5-97 DPF (return)
#include <ChFi3d_FilletShape.hxx>
#include <FilletSurf_Builder.hxx>
DEFINE_STANDARD_ALLOC
- //! initialize of the informations necessary for the
+ //! initialize of the information necessary for the
//! computation of the fillet on the
//! Shape S from a list of edges E and a radius R.
//!
//! IsPartial: the result is partial
Standard_EXPORT FilletSurf_StatusDone IsDone() const;
- //! gives informations about error status if
+ //! gives information about error status if
//! IsDone=IsNotOk
//! returns
//! EdgeNotG1: the edges are not G1
}
// introduced by rbv for curvilinear parametrization
-// performs more apropriate tolerance managment
+// performs more appropriate tolerance managment
static void AdvCompute(CPnts_AbscissaPoint& theComputer,
const TheCurve& C,
//! - and those required on the curve by the computation algorithm.
Standard_EXPORT GCPnts_QuasiUniformAbscissa(const Adaptor3d_Curve& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2);
- //! Initialize the algoritms with <C>, <NbPoints> and
+ //! Initialize the algorithms with <C>, <NbPoints> and
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Integer NbPoints);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>.
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2);
//! on a part of the Curve2d <C>.
Standard_EXPORT GCPnts_QuasiUniformAbscissa(const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2);
- //! Initialize the algoritms with <C>, <NbPoints> and
+ //! Initialize the algorithms with <C>, <NbPoints> and
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>.
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2);
//! computation algorithm.
Standard_EXPORT GCPnts_QuasiUniformDeflection(const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const GeomAbs_Shape Continuity = GeomAbs_C1);
- //! Initialize the algoritms with <C>, <Deflection>
+ //! Initialize the algorithms with <C>, <Deflection>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const GeomAbs_Shape Continuity = GeomAbs_C1);
- //! Initialize the algoritms with <C>, <Deflection>
+ //! Initialize the algorithms with <C>, <Deflection>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const GeomAbs_Shape Continuity = GeomAbs_C1);
- //! Initialize the algoritms with <C>, <Deflection>,
+ //! Initialize the algorithms with <C>, <Deflection>,
//! <U1>,<U2>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const GeomAbs_Shape Continuity = GeomAbs_C1);
- //! Initialize the algoritms with <C>, <Deflection>,
+ //! Initialize the algorithms with <C>, <Deflection>,
//! -- <U1>,<U2>
//! This and the above algorithms initialize (or reinitialize)
//! this algorithm and compute a distribution of points:
//! It Is used for more precise calculation of curve length
Standard_EXPORT GCPnts_UniformAbscissa(const Adaptor3d_Curve& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <Toler>
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <Toler>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Abscissa, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>, <Toler>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Abscissa, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <NbPoints>, <Toler> and
+ //! Initialize the algorithms with <C>, <NbPoints>, <Toler> and
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Integer NbPoints, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>, <Toler>.
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
//! It Is used for more precise calculation of curve length
Standard_EXPORT GCPnts_UniformAbscissa(const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <Toler>
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <Toler>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Abscissa, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>, <Toler>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Abscissa, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <NbPoints>, <Toler> and
+ //! Initialize the algorithms with <C>, <NbPoints>, <Toler> and
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints, const Standard_Real Toler = -1);
- //! Initialize the algoritms with <C>, <Abscissa>, <U1>,
+ //! Initialize the algorit
hms with <C>, <Abscissa>, <U1>,
//! <U2>, <Toler>.
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Integer NbPoints, const Standard_Real U1, const Standard_Real U2, const Standard_Real Toler = -1);
//! deflection
Standard_EXPORT GCPnts_UniformDeflection(const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const Standard_Boolean WithControl = Standard_True);
- //! Initialize the algoritms with <C>, <Deflection>
+ //! Initialize the algorithms with <C>, <Deflection>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const Standard_Boolean WithControl = Standard_True);
- //! Initialize the algoritms with <C>, <Deflection>
+ //! Initialize the algorithms with <C>, <Deflection>
Standard_EXPORT void Initialize (const Adaptor2d_Curve2d& C, const Standard_Real Deflection, const Standard_Boolean WithControl = Standard_True);
- //! Initialize the algoritms with <C>, <Deflection>,
+ //! Initialize the algorithms with <C>, <Deflection>,
//! <U1>,<U2>
Standard_EXPORT void Initialize (const Adaptor3d_Curve& C, const Standard_Real Deflection, const Standard_Real U1, const Standard_Real U2, const Standard_Boolean WithControl = Standard_True);
- //! Initialize the algoritms with <C>, <Deflection>,
+ //! Initialize the algorithms with <C>, <Deflection>,
//! <U1>,<U2>
//! This and the above methods initialize (or reinitialize) this algorithm and
//! compute a distribution of points:
Standard_EXPORT GProp_GProps();
- //! The point SystemLocation is used to compute the gobal properties
+ //! The point SystemLocation is used to compute the global properties
//! of the system. For more accuracy it is better to define this
//! point closed to the location of the system. For example it could
//! be a point around the centre of mass of the system.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns the informations about the tangency point between the
+ //! Returns the information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution
//! of solutions and NotDone if IsDone returns false.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns the informations about the tangency point between the
+ //! Returns the information about the tangency point between the
//! result number Index and the second argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution.
//! of solutions and NotDone if IsDone returns false.
Standard_EXPORT void Tangency2 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns the informations about the center (on the curv) of
+ //! Returns the information about the center (on the curv) of
//! the result number Index and the third argument.
//! ParArg is the intrinsic parameter of the point PntArg on
//! the third argument.
//! It raises NotDone if the algorithm failed.
Standard_EXPORT gp_Circ2d ThisSolution (const Standard_Integer Index) const;
- //! Returns the informations about the qualifiers of the
+ //! Returns the information about the qualifiers of the
//! tangency
//! arguments concerning the solution number Index.
//! It returns the real qualifiers (the qualifiers given to the
//! and the qualifiers computedin case of unqualified).
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2, GccEnt_Position& Qualif3) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! It raises NotDone if the algorithm failed.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! It raises NotDone if the algorithm failed.
Standard_EXPORT void Tangency2 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! and the qualifiers computedin case of unqualified).
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the center (on the curv)
+ //! Returns information about the center (on the curv)
//! of the result.
//! ParArg is the intrinsic parameter of the point on
//! the argument curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution curv.
//! It raises NotDone if the algorithm failed.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the second argument.
//! ParSol is the intrinsic parameter of the point ParSol on
//! the solution curv.
//! number of solutions.
Standard_EXPORT gp_Lin2d ThisSolution (const Standard_Integer Index) const;
- //! Returns informations about the intersection point between
+ //! Returns information about the intersection point between
//! the result number Index and the first argument.
//! Raises NotDone if the construction algorithm didn't succeed.
//! It raises OutOfRange if Index is greater than the
//! number of solutions.
Standard_EXPORT void Intersection1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the intersection point between
+ //! Returns information about the intersection point between
//! the result number Index and the second argument.
//! Raises NotDone if the construction algorithm
//! didn't succeed.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point ParSol on
//! the solution curv.
//! It raises OutOfRange if Index is greater than the number of solutions.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the intersection between the
+ //! Returns information about the intersection between the
//! result number Index and the third argument.
//! Raises NotDone if the construction algorithm didn't succeed.
//! It raises OutOfRange if Index is greater than the number of solutions.
//! number of solutions.
Standard_EXPORT gp_Lin2d ThisSolution (const Standard_Integer Index) const;
- //! Returns the informations about the qualifiers of the
+ //! Returns the information about the qualifiers of the
//! tangency arguments concerning the solution number Index.
//! It returns the real qualifiers (the qualifiers given to the
//! constructor method in case of enclosed, enclosing and outside
//! number of solutions.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT gp_Lin2d ThisSolution (const Standard_Integer Index) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& Pnt) const;
- //! Returns informations about the intersection between the
+ //! Returns information about the intersection between the
//! solution number Index and the second argument.
//! It returns the first intersection in a case of
//! Lin2dTanPer which is perpendicular to a circle .
TColStd_Array1OfReal Knots(1,2);
TColStd_Array1OfInteger Mults(1,2);
- // define param ditance to keep (eap, Apr 18 2002, occ311)
+ // define param distance to keep (eap, Apr 18 2002, occ311)
if (periodic) {
Standard_Real Period = LastParameter() - FirstParameter();
DU = U2 - U1;
//! 1 <= Mults(i) <= Degree
//!
//! On a non periodic curve the first and last multiplicities
- //! may be Degree+1 (this is even recommanded if you want the
+ //! may be Degree+1 (this is even recommended if you want the
//! curve to start and finish on the first and last pole).
//!
//! On a periodic curve the first and the last multicities
if( ((aFirstParam - theTf)*(theTl - aFirstParam) < 0.0) &&
((aLastParam - theTf)*(theTl - aLastParam) < 0.0))
{
- //Range [theTf, theTl] does not intersect curve bounadries
+ //Range [theTf, theTl] does not intersect curve boundaries
return Standard_True;
}
//! 1 <= UMults(i) <= UDegree
//! On a non uperiodic surface the first and last
//! umultiplicities may be UDegree+1 (this is even
- //! recommanded if you want the curve to start and finish on
+ //! recommended if you want the curve to start and finish on
//! the first and last pole).
//! On a uperiodic surface the first and the last
//! umultiplicities must be the same.
//!
//! On a non uperiodic surface the first and last
//! umultiplicities may be UDegree+1 (this is even
- //! recommanded if you want the curve to start and finish on
+ //! recommended if you want the curve to start and finish on
//! the first and last pole).
//!
//! On a uperiodic surface the first and the last
//! The control points are modified, the first and the last point
//! are not the same.
//!
- //! Parameters theUTolerance, theVTolerance define the possible proximity along the correponding
+ //! Parameters theUTolerance, theVTolerance define the possible proximity along the corresponding
//! direction of the segment boundaries and B-spline knots to treat them as equal.
//!
//! Warnings :
//! For example, if <me> is periodic in V, it will be always periodic
//! in V after the segmentation if the bounds in V are unchanged
//!
- //! Parameters theUTolerance, theVTolerance define the possible proximity along the correponding
+ //! Parameters theUTolerance, theVTolerance define the possible proximity along the corresponding
//! direction of the segment boundaries and B-spline knots to treat them as equal.
//!
//! Warnings :
//! Some Curves such as OffsetCurve can be closed or not. These curves
//! are considered as closed if the distance between the first point
//! and the last point of the curve is lower or equal to the Resolution
- //! from package gp wich is a fixed criterion independant of the
+ //! from package gp which is a fixed criterion independant of the
//! application.
Standard_EXPORT virtual Standard_Boolean IsClosed() const = 0;
//! detects if the surface has punctual U or V
//! isoparametric curve along on the bounds of the surface
- //! relativly to the tolerance Tol and Builds the corresponding
+ //! relatively to the tolerance Tol and Builds the corresponding
//! osculating surfaces.
Standard_EXPORT Geom_OsculatingSurface(const Handle(Geom_Surface)& BS, const Standard_Real Tol);
TColStd_Array1OfReal Knots(1,2);
TColStd_Array1OfInteger Mults(1,2);
//
- // define param ditance to keep (eap, Apr 18 2002, occ311)
+ // define param distance to keep (eap, Apr 18 2002, occ311)
if (periodic) {
Standard_Real Period = LastParameter() - FirstParameter();
DU = U2 - U1;
//! 1 <= Mults(i) <= Degree
//!
//! On a non periodic curve the first and last multiplicities
- //! may be Degree+1 (this is even recommanded if you want the
+ //! may be Degree+1 (this is even recommended if you want the
//! curve to start and finish on the first and last pole).
//!
//! On a periodic curve the first and the last multicities
//! 1 <= Mults(i) <= Degree
//!
//! On a non periodic curve the first and last multiplicities
- //! may be Degree+1 (this is even recommanded if you want the
+ //! may be Degree+1 (this is even recommended if you want the
//! curve to start and finish on the first and last pole).
//!
//! On a periodic curve the first and the last multicities
if( ((aFirstParam - theTf)*(theTl - aFirstParam) < 0.0) &&
((aLastParam - theTf)*(theTl - aLastParam) < 0.0))
{
- //Range [theTf, theTl] does not intersect curve bounadries
+ //Range [theTf, theTl] does not intersect curve boundaries
return Standard_True;
}
//! Some Curves such as OffsetCurve can be closed or not. These curves
//! are considered as closed if the distance between the first point
//! and the last point of the curve is lower or equal to the Resolution
- //! from package gp wich is a fixed criterion independant of the
+ //! from package gp which is a fixed criterion independant of the
//! application.
Standard_EXPORT virtual Standard_Boolean IsClosed() const = 0;
//! 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;
Standard_EXPORT Handle(Geom2d_BSplineCurve) Curve() const;
//! returns Standard_True if the approximation has
- //! been done with within requiered tolerance
+ //! been done with within required tolerance
Standard_EXPORT Standard_Boolean IsDone() const;
//! returns Standard_True if the approximation did come out
//! StdFail_NotDone if the construction fails.
Standard_EXPORT gp_Circ2d ThisSolution (const Standard_Integer Index) const;
- //! It returns the informations about the qualifiers of
+ //! It returns the information about the qualifiers of
//! the tangency
//! arguments concerning the solution number Index.
//! It returns the real qualifiers (the qualifiers given to the
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the second argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
//! number of solutions.
Standard_EXPORT gp_Circ2d ThisSolution (const Standard_Integer Index) const;
- //! It returns the informations about the qualifiers of
+ //! It returns the information about the qualifiers of
//! the tangency
//! arguments concerning the solution number Index.
//! It returns the real qualifiers (the qualifiers given to the
//! and the qualifiers computedin case of unqualified).
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the second argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT void Tangency2 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the center (on the curv)
+ //! Returns information about the center (on the curv)
//! of the result.
//! ParArg is the intrinsic parameter of the point on
//! the argument curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
//! notDone is raised if the construction algorithm did not succeed.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the second argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
//! of the algorithm-object.
Standard_EXPORT gp_Circ2d ThisSolution (const Standard_Integer Index) const;
- //! It returns the informations about the qualifiers of the tangency
+ //! It returns the information about the qualifiers of the tangency
//! arguments concerning the solution number Index.
//! It returns the real qualifiers (the qualifiers given to the
//! constructor method in case of enclosed, enclosing and outside
//! and the qualifiers computedin case of unqualified).
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2, GccEnt_Position& Qualif3) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the second argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void Tangency2 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the third argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void WhichQualifier (GccEnt_Position& Qualif1, GccEnt_Position& Qualif2, GccEnt_Position& Qualif3) const;
- //! Returns informations about the tangency point between
+ //! Returns information about the tangency point between
//! the result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! didn't succeed.
Standard_EXPORT void Tangency1 (Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between
+ //! Returns information about the tangency point between
//! the result and the second argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! didn't succeed.
Standard_EXPORT void Tangency2 (Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between
+ //! Returns information about the tangency point between
//! the result and the third argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol
//! on the solution curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the solution curv.
//! ParArg is the intrinsic parameter of the point on the argument curv.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result number Index and the first argument.
//! ParSol is the intrinsic parameter of the point on the
//! solution curv.
//! number of solutions.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the center (on the curv)
+ //! Returns information about the center (on the curv)
//! of the result.
//! ParArg is the intrinsic parameter of the point on
//! the argument curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void Tangency1 (const Standard_Integer Index, Standard_Real& ParSol, Standard_Real& ParArg, gp_Pnt2d& PntSol) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on the solution curv.
//! ParArg is the intrinsic parameter of the point PntSol on the argument curv.
Standard_EXPORT void WhichQualifier (GccEnt_Position& Qualif1, GccEnt_Position& Qualif2) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution curv.
//! StdFail_NotDone if the construction fails.
Standard_EXPORT void WhichQualifier (const Standard_Integer Index, GccEnt_Position& Qualif1) const;
- //! Returns informations about the tangency point between the
+ //! Returns information about the tangency point between the
//! result and the first argument.
//! ParSol is the intrinsic parameter of the point PntSol on
//! the solution curv.
//! Tol is the tolerance on the distance between a point
//! and the parametrised curve.
//! LowParameter and HighParameter give the
- //! boundaries of the interval in wich the parameter
+ //! boundaries of the interval in which the parameter
//! certainly lies. These parameters are given to
- //! implement a more efficient algoritm. So, it is not
+ //! implement a more efficient algorithm. So, it is not
//! necessary to check that the returned value verifies
//! LowParameter <= Value <= HighParameter.
Standard_EXPORT static Standard_Real FindParameter (const Adaptor2d_Curve2d& C, const gp_Pnt2d& Pnt, const Standard_Real LowParameter, const Standard_Real HighParameter, const Standard_Real Tol);
//! Inherited from GHCurve. Provides a curve
//! handled by reference.
- //! Build a Geom_Curve using the informations from the
+ //! Build a Geom_Curve using the information from the
//! Curve from Adaptor3d
Standard_EXPORT static Handle(Geom_Curve) MakeCurve (const Adaptor3d_Curve& C);
- //! Build a Geom_Surface using the informations from the Surface from Adaptor3d
+ //! Build a Geom_Surface using the information from the Surface from Adaptor3d
//! @param theS - Surface adaptor to convert.
//! @param theTrimFlag - True if perform trim surface values by adaptor and false otherwise.
Standard_EXPORT static Handle(Geom_Surface) MakeSurface (const Adaptor3d_Surface& theS,
//! 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;
for (j=index;j<=index+nb_vertexG1;j++){ //secondary loop inside each group
Curve1=ArrayOfCurves(j);
- if (index==j) //initialisation at the begining of the loop
+ if (index==j) //initialisation at the beginning of the loop
ArrayOfConcatenated->SetValue(i,Curve1);
else{
GeomConvert_CompCurveToBSplineCurve C (ArrayOfConcatenated->Value(i));
else
Curve1=ArrayOfCurves(j);
- if (j==0) //initialisation at the begining of the loop
+ if (j==0) //initialisation at the beginning of the loop
Curve2=Curve1;
else{
if ( (j==(nb_curve-1)) && (NeedDoubleDegRepara)){
else
Curve1=ArrayOfCurves(j);
- if (index==j) //initialisation at the begining of the loop
+ if (index==j) //initialisation at the beginning of the loop
ArrayOfConcatenated->SetValue(i,Curve1);
else
{
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
//! has been done, 0 if no approximation )
Standard_EXPORT Standard_Real MaxError() const;
- //! Prints on the stream o informations on the current state of the object.
+ //! Prints on the stream o information on the current state of the object.
Standard_EXPORT void Dump (Standard_OStream& o) const;
private:
- //! It used internaly by the constructors.
+ //! It used internally by the constructors.
Standard_EXPORT void Perform (const TColGeom_Array2OfBezierSurface& Beziers);
//! 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;
//! 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;
//! 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;
//! Class (should be a structure) storing the
-//! informations about continuity, normals
+//! information about continuity, normals
//! parallelism, coons conditions and bounds tangents
//! angle on the corner of contour to be filled.
class GeomFill_CornerState
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! 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;
//! Returns Standard_False (default implementation)
Standard_EXPORT virtual Standard_Boolean HasLastRestriction() const Standard_OVERRIDE;
- //! Give the number of trace (Curves 2d wich are not restriction)
+ //! Give the number of trace (Curves 2d which are not restriction)
//! Returns 1 (default implementation)
Standard_EXPORT virtual Standard_Integer TraceNumber() const Standard_OVERRIDE;
//! 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;
//! Returns Standard_False (default implementation)
Standard_EXPORT virtual Standard_Boolean HasLastRestriction() const Standard_OVERRIDE;
- //! Give the number of trace (Curves 2d wich are not restriction)
+ //! Give the number of trace (Curves 2d which are not restriction)
//! Returns 1 (default implementation)
Standard_EXPORT virtual Standard_Integer TraceNumber() const Standard_OVERRIDE;
//! 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;
//! Returns Standard_False (default implementation)
Standard_EXPORT virtual Standard_Boolean HasLastRestriction() const;
- //! Give the number of trace (Curves 2d wich are not restriction)
+ //! Give the number of trace (Curves 2d which are not restriction)
//! Returns 0 (default implementation)
Standard_EXPORT virtual Standard_Integer TraceNumber() const;
//! 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;
//! 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;
//! - or a constant trihedron to have all the sections
//! in a same plane
//! 2.b) Define a ConstantBinormal Direction to keep the
-//! same angle beetween the Direction and the sections
+//! same angle between the Direction and the sections
//! along the sweep surface.
//! 2.c) Define the path by a surface and a 2dcurve,
//! the surface is used to define the trihedron's normal.
-//! It is usefull to keep a constant angle beetween
+//! It is usefull to keep a constant angle between
//! input surface and the pipe. --
//! 3) give a path and two sections. The section
//! evoluate from First to Last Section.
//! 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;
Standard_EXPORT gp_Trsf Transformation (const Standard_Boolean WithTranslation, const Standard_Boolean WithCorrection = Standard_False) const;
- //! Compute the Section, in the coordinate syteme given by
+ //! Compute the Section, in the coordinate system given by
//! the Location Law.
- //! If <WithTranslation> contact beetween
+ //! If <WithTranslation> contact between
//! <Section> and <Path> is forced.
Standard_EXPORT Handle(Geom_Curve) Section (const Standard_Boolean WithTranslation) const;
- //! Compute the Section, in the coordinate syteme given by
+ //! Compute the Section, in the coordinate system given by
//! the Location Law.
//! To have the Normal to section equal to the Location
- //! Law Normal. If <WithTranslation> contact beetween
+ //! Law Normal. If <WithTranslation> contact between
//! <Section> and <Path> is forced.
Standard_EXPORT Handle(Geom_Curve) ModifiedSection (const Standard_Boolean WithTranslation) const;
//! 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;
//! <LocationLaw> 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.0);
//! Set the flag that indicates attempt to approximate
//! Build the Sweeep Surface
//! ApproxStyle defines 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 build 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
//!
//! raise If Domain are infinite or Profile not Setted.
//! 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;
//! 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.
//! Warning: Used only if <me> IsRational
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.
//! Warning: Used only if <me> IsRational
Standard_EXPORT virtual void GetMinimalWeight (TColStd_Array1OfReal& Weigths) const Standard_OVERRIDE;
//! 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;
//! 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;
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);
//! Warning! This assume that the InParameter is an increasing sequence
//! of real number and it will not check for that : Unpredictable
//! result can happen if this is not satisfied. It is the caller
- //! responsability to check for that property.
+ //! responsibility to check for that property.
//!
//! This method makes uniform NumPoints segments S1,...SNumPoints out
//! of the segment defined by the first parameter and the
class Standard_OutOfRange;
-//! Checks for the end tangents : wether or not those
+//! Checks for the end tangents : whether or not those
//! are reversed
class GeomLib_Check2dBSplineCurve
{
class Standard_OutOfRange;
-//! Checks for the end tangents : wether or not those
+//! Checks for the end tangents : whether or not those
//! are reversed regarding the third or n-3rd control
class GeomLib_CheckBSplineCurve
{
//! Returns the identification number of this structure.
Standard_Integer Identification() const { return myCStructure->Id; }
- //! Prints informations about the network associated
+ //! Prints information about the network associated
//! with the structure <AStructure>.
Standard_EXPORT static void PrintNetwork (const Handle(Graphic3d_Structure)& AStructure, const Graphic3d_TypeOfConnection AType);
#include <TopAbs_State.hxx>
//! The Coincidence class is used in an Inteference to
-//! store informations on the "hiding" edge.
+//! store information on the "hiding" edge.
//!
//! 2D Data : The tangent and the curvature of the
//! projection of the edge at the intersection point.
//! 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 BRepAdaptor_Curve& C, TColStd_Array1OfReal& T, const GeomAbs_Shape S);
//! 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;
//! 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 Standard_Address C, TColStd_Array1OfReal& T);
Standard_ShortReal Tolerance() const;
//! end of building of the Data and updating
- //! all the informations linked to the projection.
+ //! all the information linked to the projection.
Standard_EXPORT void Update (const HLRAlgo_Projector& P);
HLRAlgo_Projector& Projector();
//! Tol is the tolerance on the distance between a point
//! and the parametrised curve.
//! LowParameter and HighParameter give the
- //! boundaries of the interval in wich the parameter
+ //! boundaries of the interval in which the parameter
//! certainly lies. These parameters are given to
- //! implement a more efficient algoritm. So, it is not
+ //! implement a more efficient algorithm. So, it is not
//! necessary to check that the returned value verifies
//! LowParameter <= Value <= HighParameter.
Standard_EXPORT static Standard_Real FindParameter (const Standard_Address& C, const gp_Pnt2d& Pnt, const Standard_Real LowParameter, const Standard_Real HighParameter, const Standard_Real Tol);
Handle(TColStd_HArray1OfReal) Knots; //array of the BSpline knots + the ones inserted
Standard_Integer cas=0,mark=0,dercas=0, //loop marks
min,max; //Pole min and max indices
- Standard_Real Us1,Us2,a; //bounderies value of the knots to be inserted
+ Standard_Real Us1,Us2,a; //boundaries value of the knots to be inserted
U4=0.0;U5=1.0; //default value
if (Ux!=1.0){
- BS->LocateU(Ux,0.0,I1,I2); //localization of the inserted knots
+ BS->LocateU(Ux,0.0,I1,I2); //localization of the inserted knots
if (Uy!=0.0)
BS->LocateU(Uy,0.0,I3,I4);
}
- if (I1==I2) //definition and filling of the
+ if (I1==I2) //definition and filling of the
if((I3==I4)||(I3==0)){ //array of knots
Knots=new TColStd_HArray1OfReal(1,BS->NbKnots());
for (i=1;i<=BS->NbKnots();i++)
const Standard_Real TolPoles,
// const Standard_Real TolKnots,
const Standard_Real ,
- const Standard_Real Ux,
+ const Standard_Real Ux,
const Standard_Real Uy)
{
Handle(TColStd_HArray1OfReal) Knots; //array of the BSpline knots + the ones inserted
Standard_Integer cas=0,mark=0,dercas=0, //loop marks
min,max; //Pole min and max indices
- Standard_Real Us1,Us2,a; //bounderies value of the knots to be inserted
+ Standard_Real Us1,Us2,a; //boundaries value of the knots to be inserted
U4=0.0;U5=1.0; //default value
if (Ux!=1.0){
BS->LocateU(Uy,0.0,I3,I4);
}
- if (I1==I2) //definition and filling of the
+ if (I1==I2) //definition and filling of the
{
if((I3==I4)||(I3==0)){ //array of knots
Knots=new TColStd_HArray1OfReal(1,BS->NbKnots());
class Standard_Transient;
-//! this class gives content of the CONNECTED COMPONANT(S)
+//! this class gives content of the CONNECTED COMPONENT(S)
//! which include specific Entity(ies)
class IFGraph_AllConnected : public Interface_GraphContent
{
//! creates an AllConnected which memorizes Entities Connected to
//! a given one, at any level : that is, itself, all Entities
//! Shared by it and Sharing it, and so on.
- //! In other terms, this is the content of the CONNECTED COMPONANT
+ //! In other terms, this is the content of the CONNECTED COMPONENT
//! which include a specific Entity
Standard_EXPORT IFGraph_AllConnected(const Interface_Graph& agraph, const Handle(Standard_Transient)& ent);
//! cumulate all Entities Connected by some ones)
//! Note that if "ent" is in the already computed list,, no entity
//! will be added, but if "ent" is not already in the list, a new
- //! Connected Componant will be cumulated
+ //! Connected Component will be cumulated
Standard_EXPORT void GetFromEntity (const Handle(Standard_Transient)& ent);
//! Allows to restart on a new data set
class IFGraph_StrongComponants;
-//! determines strong componants in a graph which are Cycles
+//! determines strong components in a graph which are Cycles
class IFGraph_Cycles : public IFGraph_SubPartsIterator
{
public:
class IFGraph_StrongComponants;
-//! determines strong componants in a graph which are Roots
+//! determines strong components in a graph which are Roots
class IFGraph_SCRoots : public IFGraph_StrongComponants
{
public:
class Interface_Graph;
-//! determines strong componants of a graph, that is
-//! isolated entities (single componants) or loops
+//! determines strong components of a graph, that is
+//! isolated entities (single components) or loops
class IFGraph_StrongComponants : public IFGraph_SubPartsIterator
{
public:
class Interface_CheckIterator;
-//! This class gathers various informations used by Model Modifiers
+//! This class gathers various information used by Model Modifiers
//! apart from the target model itself, and the CopyTool which
//! must be passed directly.
//!
-//! These informations report to original data : model, entities,
+//! These information report to original data : model, entities,
//! and the selection list if there is one : it allows to query
//! about such or such starting entity, or result entity, or
//! iterate on selection list ...
DEFINE_STANDARD_ALLOC
- //! Prepares a ContextModif with these informations :
+ //! Prepares a ContextModif with these information :
//! - the graph established from original model (target passed
//! directly to Modifier)
//! - the CopyTool which detains the CopyControl, which maps
//! transferred entities (no filter active)
Standard_EXPORT IFSelect_ContextModif(const Interface_Graph& graph, const Interface_CopyTool& TC, const Standard_CString filename = "");
- //! Prepares a ContextModif with these informations :
+ //! Prepares a ContextModif with these information :
//! - the graph established from original model (target passed
//! directly to Modifier)
//! - an optional file name (for file output)
class Interface_CheckIterator;
-//! This class gathers various informations used by File Modifiers
+//! This class gathers various information used by File Modifiers
//! apart from the writer object, which is specific of the norm
//! and of the physical format
//!
-//! These informations are controlled by an object AppliedModifiers
+//! These information are controlled by an object AppliedModifiers
//! (if it is not defined, no modification is allowed on writing)
//!
//! Furthermore, in return, ContextModif can record Checks, either
DEFINE_STANDARD_ALLOC
- //! Prepares a ContextWrite with these informations :
+ //! Prepares a ContextWrite with these information :
//! - the model which is to be written
//! - the protocol to be used
//! - the filename
//! generated and filled. ModelCopier has already checked the
//! criteria (Dispatch, Model Rank, Selection) before calling it.
//!
- //! <ctx> detains informations about original data and selection.
+ //! <ctx> detains information about original data and selection.
//! The result of copying, on which modifications are to be done,
//! is <target>.
//! <TC> allows to run additional copies as required
//! Called by RootResult
Standard_EXPORT virtual void FillResult (const Standard_Integer n1, const Standard_Integer n2, const Handle(Standard_Transient)& ent, Interface_EntityIterator& res) const = 0;
- //! Returns a text defining the criterium : "Componants of List "
+ //! Returns a text defining the criterium : "Components of List "
//! then Specific List Label, then, following cases :
//! " From .. Until .." or "From .." or "Until .." or "Rank no .."
//! Specific type is given by deferred method ListLabel
{ return Standard_True; }
TCollection_AsciiString IFSelect_SelectRootComps::ExtractLabel () const
-{ return TCollection_AsciiString("Local Root Componants"); }
+{ return TCollection_AsciiString("Local Root Components"); }
DEFINE_STANDARD_HANDLE(IFSelect_SelectRootComps, IFSelect_SelectExtract)
//! A SelectRootComps sorts the Entities which are part of Strong
-//! Componants, local roots of a set of Entities : they can be
-//! Single Componants (containing one Entity) or Cycles
+//! Components, local roots of a set of Entities : they can be
+//! Single Components (containing one Entity) or Cycles
//! This class gives a more secure result than SelectRoots (which
-//! considers only Single Componants) but is longer to work : it
+//! considers only Single Components) but is longer to work : it
//! can be used when there can be or there are cycles in a Model
//! For each cycle, one Entity is given arbitrarily
-//! Reject works as for SelectRoots : Strong Componants defined in
+//! Reject works as for SelectRoots : Strong Components defined in
//! the input list which are not local roots are given
class IFSelect_SelectRootComps : public IFSelect_SelectExtract
{
//! Creates a SelectRootComps
Standard_EXPORT IFSelect_SelectRootComps();
- //! Returns the list of local root strong componants, by one
- //! Entity par componant. It is redefined for a purpose of
+ //! Returns the list of local root strong components, by one
+ //! Entity per component. It is redefined for a purpose of
//! effeciency : calling a Sort routine for each Entity would
- //! cost more ressource than to work in once using a Map
+ //! cost more resources than to work in once using a Map
//! RootResult takes in account the Direct status
Standard_EXPORT virtual Interface_EntityIterator RootResult (const Interface_Graph& G) const Standard_OVERRIDE;
//! Returns always True, because RootResult has done work
Standard_EXPORT Standard_Boolean Sort (const Standard_Integer rank, const Handle(Standard_Transient)& ent, const Handle(Interface_InterfaceModel)& model) const Standard_OVERRIDE;
- //! Returns a text defining the criterium : "Local Root Componants"
+ //! Returns a text defining the criterium : "Local Root Components"
Standard_EXPORT TCollection_AsciiString ExtractLabel() const Standard_OVERRIDE;
//! Returns the list of local roots. It is redefined for a purpose
//! of effeciency : calling a Sort routine for each Entity would
- //! cost more ressource than to work in once using a Map
+ //! cost more resources than to work in once using a Map
//! RootResult takes in account the Direct status
Standard_EXPORT virtual Interface_EntityIterator RootResult (const Interface_Graph& G) const Standard_OVERRIDE;
// sinon : liste
// Analyse en sequence : si alternance prend/prend-pas, le dernier a raison
// en consequence, si que des prend ou que des prend-pas, c est commutatif
-// DONC recommandation : mettre les prend-pas en fin
+// DONC recommendation : mettre les prend-pas en fin
// AU DEPART : prendre = ne prendre que. prend-pas = prend-tout-sauf ...
// Donc si le premier est un prend-pas, je commence par tout prendre
//! SessionFile works with a library of SessionDumper type objects
//!
//! The File is Produced as follows :
-//! SessionFile produces all general Informations (such as Int and
+//! SessionFile produces all general Information (such as Int and
//! Text Parameters, Types and Inputs of Selections, Dispatches,
//! Modifiers ...) and calls the SessionDumpers to produce all
//! the particular Data : creation arguments, parameters to be set
//! It is Read in the same terms :
-//! SessionFile reads and interprets all general Informations,
+//! SessionFile reads and interprets all general Information,
//! and calls the SessionDumpers to recognize Types and for a
//! recognized Type create the corresponding Object with its
//! particular parameters as they were written.
//! current Line Command. If none was, returns a Null Handle
Standard_EXPORT Handle(Standard_Transient) RecordedItem() const;
- //! Clears the recorded informations (commands, objects)
+ //! Clears the recorded information (commands, objects)
Standard_EXPORT void Clear();
//! Reads commands from a Script File, named <file>. By default
class IFSelect_ShareOut;
DEFINE_STANDARD_HANDLE(IFSelect_ShareOut, Standard_Transient)
-//! This class gathers the informations required to produce one or
+//! This class gathers the information required to produce one or
//! several file(s) from the content of an InterfaceModel (passing
//! through the creation of intermediate Models).
//!
Standard_EXPORT IFSelect_ShareOut();
//! Removes in one operation all the Dispatches with their Idents
- //! Also clears all informations about Names, and all Results but
- //! naming informations which are :
+ //! Also clears all information about Names, and all Results but
+ //! naming information which are :
//! - kept if <onlydisp> is True.
//! - cleared if <onlydisp> is False (complete clearing)
//! If <onlydisp> is True, that's all. Else, clears also Modifiers
Standard_EXPORT void Clear (const Standard_Boolean onlydisp);
//! Clears all data produced (apart from Dispatches, etc...)
- //! if <alsoname> is True, all is cleared. Else, informations
+ //! if <alsoname> is True, all is cleared. Else, information
//! about produced Names are kept (to maintain unicity of naming
//! across clearings)
Standard_EXPORT void ClearResult (const Standard_Boolean alsoname);
//! Returns the Default Root Name. Can be empty.
Standard_EXPORT Handle(TCollection_HAsciiString) DefaultRootName() const;
- //! Returns the general Extension. Can be empty (not recommanded)
+ //! Returns the general Extension. Can be empty (not recommended)
Standard_EXPORT Handle(TCollection_HAsciiString) Extension() const;
//! Computes the complete file name for a Packet of a Dispatch,
//! signature
//! This string has not to be unique in the model, but gives a
//! value for such or such important feature.
-//! Exemples : Dynamic Type; Category; etc
+//! Examples : Dynamic Type; Category; etc
class IFSelect_Signature : public Interface_SignType
{
//! the starting one
//!
//! <me> is mutable to allow results for ChangeProtocol to be
- //! memorized if needed, and to store informations useful for
+ //! memorized if needed, and to store information useful for
//! the method Updated
//!
//! Returns True if Done, False if an Error occured : in this case,
//! In particular, a specific WorkLibrary must give the way for
//! Reading a File into a Model, and Writing a Model to a File
//! Thus, it is possible to define several Work Libraries for each
-//! norm, but recommanded to define one general class for each one :
+//! norm, but recommended to define one general class for each one :
//! this general class will define the Read and Write methods.
//!
//! Also a Dump service is provided, it can produce, according the
//! norm, either a parcel of a file for an entity, or any other
-//! kind of informations relevant for the norm,
+//! kind of information relevant for the norm,
class IFSelect_WorkLibrary : public Standard_Transient
{
const Handle(Interface_Protocol)& protocol) const;
//! Gives the way to Write a File from a Model.
- //! <ctx> contains all necessary informations : the model, the
+ //! <ctx> contains all necessary information : the model, the
//! protocol, the file name, and the list of File Modifiers to be
//! applied, also with restricted list of selected entities for
//! each one, if required.
//! -1 : Error on the spot (slight changes), data may be corrupted
//! (remark : corruption should not be profound)
//! -2 : Error on edition the spot, data may be corrupted
- //! (checking them is recommanded)
+ //! (checking them is recommended)
//! -3 : Error with a new data set, transformation ignored
//! -4 : OK as 4, but graph of dependances count not be recomputed
//! (the former one is kept) : check the protocol
Standard_EXPORT Standard_CString GiveFileComplete (const Standard_CString file) const;
//! Erases all stored data from the File Evaluation
- //! (i.e. ALL former naming informations are lost)
+ //! (i.e. ALL former naming information are lost)
Standard_EXPORT void ClearFile();
//! Performs and stores a File Evaluation. The Results are a List
//! and can work with File Modifiers (managed by the Model Copier)
//! and a ModelCopier, which can work with Model Modifiers
//! Returns False if, either WorkLibrary has failed on at least
- //! one sub-file, or the Work Session is badly conditionned
+ //! one sub-file, or the Work Session is badly conditioned
//! (no Model defined, or FileNaming not in phase with ShareOut)
Standard_EXPORT Standard_Boolean SendSplit();
//! (only type ...), greater values give more and more details.
Standard_EXPORT void DumpEntity (const Handle(Standard_Transient)& ent, const Standard_Integer level, Standard_OStream& S) const;
- //! Prints main informations about an entity : its number, type,
+ //! Prints main information about an entity : its number, type,
//! validity (and checks if any), category, shareds and sharings..
//! mutable because it can recompute checks as necessary
Standard_EXPORT void PrintEntityStatus (const Handle(Standard_Transient)& ent, Standard_OStream& S);
#include <IGESData_DefType.hxx>
-//! description of a directory componant which can be either
+//! description of a directory component which can be either
//! undefined (let Void), defined as a Reference to an entity,
//! or as a Rank, integer value adressing a builtin table
//! The entity reference is not included here, only reference
class IGESData_IGESType;
-//! litteral/numeric description of an entity's directory section,
+//! literal/numeric description of an entity's directory section,
//! taken from file
class IGESData_DirPart
{
//! answers True for <num>, else returns False.
Standard_EXPORT Standard_Boolean IsNegativePointer (const Standard_Integer num) const;
- //! Returns litteral value of a Parameter, given its rank
+ //! Returns literal value of a Parameter, given its rank
//! Error if num is out of range, or if Parameter is not literal
Standard_EXPORT Handle(TCollection_HAsciiString) ParamValue (const Standard_Integer num) const;
//! which are Entities)
Standard_EXPORT void AddNegativePointers (const Handle(TColStd_HSequenceOfInteger)& list);
- //! Clears all informations about Negative Pointers, hence every
- //! Entity kind Parameter will be send normally, as Positive
+ //! Clears all information about Negative Pointers, hence every
+ //! Entity kind Parameter will be sent normally, as Positive
Standard_EXPORT void ClearNegativePointers();
//! WriteOwnParams is redefined for FreeFormatEntity to take
//! Returns a string withpout its Hollerith marks (nnnH ahead).
//! Remark : all strings stored in GlobalSection are expurged
- //! from Hollerith informations (without nnnH)
+ //! from Hollerith information (without nnnH)
//! If <astr> is not Hollerith form, it is simply copied
Standard_EXPORT Handle(TCollection_HAsciiString) TranslatedFromHollerith (const Handle(TCollection_HAsciiString)& astr) const;
//! after reading entities, true line weights can be computed
Standard_EXPORT virtual void EndRead (const Handle(Interface_InterfaceModel)& amodel) Standard_OVERRIDE;
- //! Reads directory part componants from file; DP is the litteral
+ //! Reads directory part components from file; DP is the literal
//! directory part, IR detains entities referenced by DP
Standard_EXPORT void ReadDir (const Handle(IGESData_IGESEntity)& ent, const Handle(IGESData_IGESReaderData)& IR, const IGESData_DirPart& DP, Handle(Interface_Check)& ach) const;
//! error if does not follow Entities sending
Standard_EXPORT void SectionT();
- //! translates directory part of an Entity into a litteral DirPart
+ //! translates directory part of an Entity into a literal DirPart
//! Some infos are computed after sending parameters
//! Error if not in sections DP or Stage not "Dir"
Standard_EXPORT void DirPart (const Handle(IGESData_IGESEntity)& anent);
//! be encountered, they correspond to "Integer", see also below
Standard_EXPORT Interface_ParamType ParamType (const Standard_Integer num) const;
- //! returns litteral value of a parameter, as it was in file
+ //! returns literal value of a parameter, as it was in file
Standard_EXPORT Standard_CString ParamValue (const Standard_Integer num) const;
//! says if a parameter is defined (not void)
//! <parent> (it must be the Parent itself, not the Associativity)
Standard_EXPORT void SetParentAssoc (const Handle(IGESData_IGESEntity)& parent, const Handle(IGESData_IGESEntity)& child);
- //! Resets all informations about dependences for <child>
+ //! Resets all information about dependences for <child>
Standard_EXPORT void ResetDependences (const Handle(IGESData_IGESEntity)& child);
//! Unitary action which defines Entities referenced by <ent>
//! Defines IGES Tabular Data, Type <406> Form <11>,
//! in package IGESDefs
-//! This Class is used to provide a Structure to accomodate
+//! This Class is used to provide a Structure to accommodate
//! point form data.
class IGESDefs_TabularData : public IGESData_IGESEntity
{
//! raises exception if UnitNum <= 0 or UnitNum > NbUnits()
Standard_EXPORT Handle(TCollection_HAsciiString) UnitValue (const Standard_Integer UnitNum) const;
- //! returns the multiplicative scale factor to be apllied to the
+ //! returns the multiplicative scale factor to be applied to the
//! UnitNum'th unit being defined
//! raises exception if UnitNum <= 0 or UnitNum > NbUnits()
Standard_EXPORT Standard_Real ScaleFactor (const Standard_Integer UnitNum) const;
//Standard_Real x = ent->StartPoint().X();
//Standard_Real y = ent->StartPoint().Y();
//Standard_Real eq = (A*x*x + B*x*y + C*y*y + D*x + E*y + F);
- // These messages are transfered in the translation procedure
+ // These messages are transferred in the translation procedure
/* if (eq < -eps || eq > eps) {
Sprintf(mess,"Start point does not satisfy conic equation, gap over %f",
Interface_MSG::Intervalled(eq));
Message_Msg Msg137("XSTEP_137");
ach->SendFail(Msg137);
}
-// These messages are transfered in the translation procedure
+// These messages are transferred in the translation procedure
// if ( (A*A + B*B + C*C) < eps) // pas nul !
// ach.SendFail("Incorrect Coefficients for the Plane");
if ( !ent->HasBoundingCurve()) return;
Message_Msg Msg71("XSTEP_71");
ach->SendFail(Msg71);
}
-// Theses messages are transfered in the translation procedure
+// Theses messages are transferred in the translation procedure
/*
if (form > 1) return; // ce qui suit : matrice orthogonale
if (form == 0 && ent->Value().IsNegative())
//! <withmap> and <withlist> are transmitted to SignCounter
Standard_EXPORT IGESSelect_CounterOfLevelNumber(const Standard_Boolean withmap = Standard_True, const Standard_Boolean withlist = Standard_False);
- //! Resets already memorized informations : also numeric data
+ //! Resets already memorized information : also numeric data
Standard_EXPORT virtual void Clear() Standard_OVERRIDE;
//! Adds an entity by considering its lrvrl number(s)
//!
//! Level = 0 means entities not attached to any level
//!
-//! Remark : the class CounterOfLevelNumber gives informations
+//! Remark : the class CounterOfLevelNumber gives information
//! about present levels in a file.
class IGESSelect_SelectLevelNumber : public IFSelect_SelectExtract
{
SetDumpLevels (4,6);
SetDumpHelp (0,"Only DNum");
SetDumpHelp (1,"DNum, IGES Type & Form");
- SetDumpHelp (2,"Main Directory Informations");
+ SetDumpHelp (2,"Main Directory Information");
SetDumpHelp (3,"Complete Directory Part");
SetDumpHelp (4,"Directory + Fields (except list contents)");
SetDumpHelp (5,"Complete (with list contents)");
//=======================================================================
//function : IsCurveAndSurface
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferCurveAndSurface
//=======================================================================
Standard_Boolean IGESToBRep::IsCurveAndSurface(const Handle(IGESData_IGESEntity)& start)
//=======================================================================
//function : IsBasicCurve
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferBasicCurve
//=======================================================================
Standard_Boolean IGESToBRep::IsBasicCurve(const Handle(IGESData_IGESEntity)& start)
//=======================================================================
//function : IsBasicSurface
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferBasicSurface
//=======================================================================
Standard_Boolean IGESToBRep::IsBasicSurface(const Handle(IGESData_IGESEntity)& start)
//=======================================================================
//function : IsTopoCurve
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferTopoCurve
//=======================================================================
Standard_Boolean IGESToBRep::IsTopoCurve(const Handle(IGESData_IGESEntity)& start)
//=======================================================================
//function : IsTopoSurface
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferTopoSurface
//=======================================================================
Standard_Boolean IGESToBRep::IsTopoSurface(const Handle(IGESData_IGESEntity)& start)
//=======================================================================
//function : IsBRepEntity
-//purpose : Return True if the IgesEntity can be transfered
+//purpose : Return True if the IgesEntity can be transferred
// by TransferBRepEntity
//=======================================================================
Standard_Boolean IGESToBRep::IsBRepEntity(const Handle(IGESData_IGESEntity)& start)
//! Returns default AlgoContainer
Standard_EXPORT static Handle(IGESToBRep_AlgoContainer) AlgoContainer();
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferCurveAndSurface.
//! ex: All IGESEntity from IGESGeom
Standard_EXPORT static Standard_Boolean IsCurveAndSurface (const Handle(IGESData_IGESEntity)& start);
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferBasicCurve.
//! ex: CircularArc, ConicArc, Line, CopiousData,
//! BSplineCurve, SplineCurve... from IGESGeom :
//! 104,110,112,126
Standard_EXPORT static Standard_Boolean IsBasicCurve (const Handle(IGESData_IGESEntity)& start);
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferBasicSurface.
//! ex: BSplineSurface, SplineSurface... from IGESGeom :
//! 114,128
Standard_EXPORT static Standard_Boolean IsBasicSurface (const Handle(IGESData_IGESEntity)& start);
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferTopoCurve.
//! ex: all Curves from IGESGeom :
//! all basic curves,102,130,142,144
Standard_EXPORT static Standard_Boolean IsTopoCurve (const Handle(IGESData_IGESEntity)& start);
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferTopoSurface.
//! ex: All Surfaces from IGESGeom :
//! all basic surfaces,108,118,120,122,141,143
Standard_EXPORT static Standard_Boolean IsTopoSurface (const Handle(IGESData_IGESEntity)& start);
- //! Return True if the IGESEntity can be transfered by
+ //! Return True if the IGESEntity can be transferred by
//! TransferBRepEntity.
//! ex: VertexList, EdgeList, Loop, Face, Shell,
//! Manifold Solid BRep Object from IGESSolid :
(void)anException;
}
if (res.IsNull()) {
- // AddFail(start, "The IGESEntity cannot be transfered.");
+ // AddFail(start, "The IGESEntity cannot be transferred.");
// The more specific function have ever add a fail message for this entity
}
else
}
if (resurf.IsNull()) {
- // AddFail(start,"The IGESEntity cannot be transfered");
+ // AddFail(start,"The IGESEntity cannot be transferred");
}
else
resurf->Scale(gp_Pnt(0,0,0),GetUnitFactor());
//added by rln on 03/12/97
//if shape1 is a wire it means that the curve1 in file was of continuity C0
//in order to get a face instead of shell when to BRepFill shape1
- //should be retransfered with contionuity C0 (to get an edge). Once shape1
+ //should be retransferred with contionuity C0 (to get an edge). Once shape1
//has been built with C0, it is useless to require C1 from shape2 because
//anyway resulting surface was of continuity C0. Thus shape2 is built with C0
// if (shape1.ShapeType() != TopAbs_EDGE) {
{
TopoDS_Iterator dabovil(igesShape);
if (dabovil.More()) {
- SendWarning(st, "The First Surface only will be transfered.");
+ SendWarning(st, "The First Surface only will be transferred.");
face = TopoDS::Face(dabovil.Value());
break;
}
Standard_EXPORT void ValAndGrad (const Standard_Real X, const Standard_Real Y, Standard_Real& Val, gp_XY& Grd) const;
//! returns the coefficients of the polynomial equation
- //! wich defines the conic:
+ //! which defines the conic:
//! A.X**2 + B.Y**2 + 2.C.X*Y + 2.D.X + 2.E.Y + F = 0.
Standard_EXPORT void Coefficients (Standard_Real& A, Standard_Real& B, Standard_Real& C, Standard_Real& D, Standard_Real& E, Standard_Real& F) const;
//! the implicit curve. Tol is the tolerance on the distance
//! between a point and the parametrised curve. LowParameter
//! and HighParameter give the boundaries of the interval in
- //! wich the parameter certainly lies. These parameters are
- //! given to implement a more efficient algoritm. So, it is
+ //! which the parameter certainly lies. These parameters are
+ //! given to implement a more efficient algorithm. So, it is
//! not necessary to check that the returned value verifies
//! LowParameter <= Value <= HighParameter.
Standard_EXPORT static Standard_Real FindParameter (const IntCurve_PConic& C, const gp_Pnt2d& Pnt, const Standard_Real LowParameter, const Standard_Real HighParameter, const Standard_Real Tol);
//! 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);
//! 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);
if (nbpiOT>1) {
-// Sort the <nbpiOT> sections points along the intersection beetween the
+// Sort the <nbpiOT> sections points along the intersection between the
// two triangles :
gp_XYZ dir=ONor^TNor;
//! Definition of an intersection point between two surfaces.
-//! 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 IntPatch_Point
{
public:
//! Describe the signature of a polyedral surface with
-//! only triangular facets and the necessary informations
+//! only triangular facets and the necessary information
//! to compute the interferences.
class IntPatch_PolyhedronTool
{
NCollection_Array1<Standard_Integer> aNewPointsHash(1, theWLine->NbPnts());
FillPointsHash(theWLine, aNewPointsHash);
- // Inital computations.
+ // Initial computations.
Standard_Real UonS1[3], VonS1[3], UonS2[3], VonS2[3];
theWLine->Point(1).ParametersOnS1(UonS1[0], VonS1[0]);
theWLine->Point(2).ParametersOnS1(UonS1[1], VonS1[1]);
class gp_Pnt2d;
-//! This class defines the geometric informations
+//! This class defines the geometric information
//! for an intersection point between 2 surfaces :
//! The coordinates ( Pnt from gp ), and two
//! parametric coordinates.
//! CArray1OfItem anSharedArray1(aArray1.ChangeValue(0),aArray1.Length());
//!
//! Warning:
- //! The validity of length are under the responsability
+ //! The validity of length are under the responsibility
//! of the user.
//! The sahred array must have a valid address during the life of
//! the Array1.
//! CArray1OfItem anSharedArray1(aArray1.ChangeValue(0),aArray1.Length());
//!
//! Warning:
- //! The validity of length are under the responsability
+ //! The validity of length are under the responsibility
//! of the user.
//! The sahred array must have a valid address during the life of
//! the Array1.
//! Returns the entity on which the Check has been defined
Standard_EXPORT const Handle(Standard_Transient)& Entity() const;
- //! Clears a check, in order to receive informations from transfer
+ //! Clears a check, in order to receive information from transfer
//! (Messages and Entity)
Standard_EXPORT void Clear();
Standard_EXPORT void Next() const;
//! Returns Check currently Iterated
- //! It brings all other informations (status, messages, ...)
+ //! It brings all other information (status, messages, ...)
//! The Number of the Entity in the Model is given by Number below
Standard_EXPORT const Handle(Interface_Check)& Value() const;
//! unless the argument <resest> is given True
Standard_EXPORT void CheckSuccess (const Standard_Boolean reset = Standard_False);
- //! Returns list of all "remarkable" informations, which include :
+ //! Returns list of all "remarkable" information, which include :
//! - GlobalCheck, if not empty
//! - Error Checks, for all Errors (Verify + Analyse)
//! - also Corrected Entities
class TCollection_AsciiString;
-//! Auxiliary class to store a litteral parameter in a file
+//! Auxiliary class to store a literal parameter in a file
//! intermediate directory or in an UndefinedContent : a reference
//! type Parameter detains an Integer which is used to address a
//! record in the directory.
//! addition to the standard Memory Manager; can be redefined
Standard_EXPORT virtual void ClearEntities();
- //! Erases informations about labels, if any : specific to each
+ //! Erases information about labels, if any : specific to each
//! norm
Standard_EXPORT virtual void ClearLabels() = 0;
Standard_EXPORT Interface_EntityIterator Entities() const;
//! Returns the list of all ReportEntities, i.e. data about
- //! Entities read with Error or Warning informations
+ //! Entities read with Error or Warning information
//! (each item has to be casted to Report Entity then it can be
//! queried for Concerned Entity, Content, Check ...)
//! By default, returns the main reports, is <semantic> is True it
//!
//! Very specific of each norm, i.e. of each protocol : the
//! uppest level Protocol assumes it, it can call GlobalCheck of
- //! its ressources only if it is necessary
+ //! its resources only if it is necessary
//!
//! Default does nothing, can be redefined
Standard_EXPORT virtual Standard_Boolean GlobalCheck (const Interface_Graph& G, Handle(Interface_Check)& ach) const;
//! its progression. This produces a state of advancement of the
//! process. This state can then be queried asynchronously :
//! typically it is summarised as a percentage. There are also
-//! an identification of the current state, and informations on
+//! an identification of the current state, and information on
//! processed volume.
//!
//! A STAT form can be described once for all (as static).
//! Same as above, but works with the GTool of the Model
Standard_EXPORT Interface_ShareFlags(const Handle(Interface_InterfaceModel)& amodel);
- //! Creates a ShareFlags by querying informations from a Graph
+ //! Creates a ShareFlags by querying information from a Graph
//! (remark that Graph also has a method IsShared)
Standard_EXPORT Interface_ShareFlags(const Interface_Graph& agraph);
//! Creates and records a Static, with a family and a name
- //! family can report to a name of ressource or to a system or
+ //! family can report to a name of resource or to a system or
//! internal definition. The name must be unique.
//!
//! type gives the type of the parameter, default is free text
//! Returns Entity corresponding to a Param, given its rank
Standard_EXPORT Handle(Standard_Transient) ParamEntity (const Standard_Integer num) const;
- //! Returns litteral value of a Parameter, given its rank
+ //! Returns literal value of a Parameter, given its rank
Standard_EXPORT Handle(TCollection_HAsciiString) ParamValue (const Standard_Integer num) const;
//! Manages reservation for parameters (internal use)
//=======================================================================
//function : Intf_InterferencePolygon2d
-//purpose : Constructor of the interference beetween two Polygon.
+//purpose : Constructor of the interference between two Polygon.
//=======================================================================
Intf_InterferencePolygon2d::Intf_InterferencePolygon2d
//=======================================================================
//function : Intf_InterferencePolygonPolyhedron
-//purpose : Construct and compute an interference beetween a Polygon3d
+//purpose : Construct and compute an interference between a Polygon3d
// and a Polyhedron.
//=======================================================================
//=======================================================================
//function : Intf_InterferencePolygonPolyhedron
-//purpose : Construct and compute an interference beetween a Straight
+//purpose : Construct and compute an interference between a Straight
// Line and a Polyhedron.
//=======================================================================
//=======================================================================
//function : Intf_InterferencePolygonPolyhedron
-//purpose : Construct and compute an interference beetween the Straights
+//purpose : Construct and compute an interference between the Straights
// Lines in <Obje> and the Polyhedron <thePolyh>.
//=======================================================================
//=======================================================================
//function : Perform
-//purpose : Compute an interference beetween the Straights
+//purpose : Compute an interference between the Straights
// Lines in <Obje> and the Polyhedron <thePolyh>.
//=======================================================================
//=======================================================================
//function : Interference
-//purpose : Compare the boundings beetween the segment of <Obje>
+//purpose : Compare the boundings between the segment of <Obje>
// and the facets of <thePolyh>.
//=======================================================================
//=======================================================================
//function : Intf_InterferencePolygonPolyhedron
-//purpose : Construct and compute an interference beetween a Straight
+//purpose : Construct and compute an interference between a Straight
// Line and a Polyhedron.
//=======================================================================
//=======================================================================
//function : Intf_InterferencePolygonPolyhedron
-//purpose : Construct and compute an interference beetween the Straights
+//purpose : Construct and compute an interference between the Straights
// Lines in <Obje> and the Polyhedron <thePolyh>.
//=======================================================================
//=======================================================================
//function : Perform
-//purpose : Compute an interference beetween the Straights
+//purpose : Compute an interference between the Straights
// Lines in <Obje> and the Polyhedron <thePolyh>.
//=======================================================================
//=======================================================================
//function : Interference
-//purpose : Compare the boundings beetween the segment of <Obje>
+//purpose : Compare the boundings between the segment of <Obje>
// and the facets of <thePolyh>.
//=======================================================================
//=======================================================================
//function : Intersect
-//purpose : Compute the intersection beetween the segment or the line
+//purpose : Compute the intersection between the segment or the line
// and the triangle <TTri>.
//=======================================================================
#if 0
Standard_EXPORT Standard_Real Incidence() const;
//! Returns True if the two SectionPoint have the same logical
- //! informations.
+ //! information.
Standard_Boolean IsEqual (const Intf_SectionPoint& Other) const;
Standard_Boolean operator== (const Intf_SectionPoint& Other) const
{
//! argument of the Interference. (Usable only for polygon)
void ParamOnSecond (Standard_Real& paraMin, Standard_Real& paraMax) const;
- //! Gives information about the first argument of the
+ //! Gives information about the first argument of the
//! Interference. (Usable only for polygon)
Standard_EXPORT void InfoFirst (Standard_Integer& segMin, Standard_Real& paraMin, Standard_Integer& segMax, Standard_Real& paraMax) const;
- //! Gives informations about the second argument of the
+ //! Gives information about the second argument of the
//! Interference. (Usable only for polygon)
Standard_EXPORT void InfoSecond (Standard_Integer& segMin, Standard_Real& paraMin, Standard_Integer& segMax, Standard_Real& paraMax) const;
//! An axis placement (one axis) is associated with the hyperbola.
//! This axis is the "XAxis" or major axis of the hyperbola. It is
//! the symmetry axis of the main branch of hyperbola.
-//! The "YAxis" is normal to this axis and pass throught its location
+//! The "YAxis" is normal to this axis and pass through its location
//! point. It is the minor axis.
//!
//! The major radius is the distance between the Location point
projects / occt.git / commitdiff