1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-04 18:06:22 +03:00

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

Fix various typos

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

View File

@ -57,7 +57,7 @@
//! To facilitate management, each object and each construction element has a selection priority. //! To facilitate management, each object and each construction element has a selection priority.
//! There are also means to modify the default priority. //! There are also means to modify the default priority.
//! To define an environment of dynamic detection, you can use standard filter classes or create your own. //! To define an environment of dynamic detection, you can use standard filter classes or create your own.
//! A filter questions the owner of the sensitive primitive to determine if it has the the desired qualities. //! A filter questions the owner of the sensitive primitive to determine if it has the desired qualities.
//! If it answers positively, it is kept. If not, it is rejected. //! If it answers positively, it is kept. If not, it is rejected.
//! The standard filters supplied in AIS include: //! The standard filters supplied in AIS include:
//! - AIS_AttributeFilter //! - AIS_AttributeFilter

View File

@ -5782,11 +5782,11 @@ int mma2er1_(integer *ndjacu,
/* PATJAC: Table of coeff. of square of approximation with */ /* PATJAC: Table of coeff. of square of approximation with */
/* constraints of order IORDRU by U and IORDRV by V. */ /* constraints of order IORDRU by U and IORDRV by V. */
/* VECERR: Auxiliary vector. */ /* VECERR: Auxiliary vector. */
/* ERREUR: MAX Error commited during removal of ALREADY CALCULATED coeff of PATJAC */ /* ERREUR: MAX Error committed during removal of ALREADY CALCULATED coeff of PATJAC */
/* OUTPUT ARGUMENTS : */ /* OUTPUT ARGUMENTS : */
/* ------------------- */ /* ------------------- */
/* ERREUR: MAX Error commited during removal of coeff of PATJAC */ /* ERREUR: MAX Error committed during removal of coeff of PATJAC */
/* of indices from MINDGU to MAXDGU by U and from MINDGV to MAXDGV by V */ /* of indices from MINDGU to MAXDGU by U and from MINDGV to MAXDGV by V */
/* THEN the already calculated error. */ /* THEN the already calculated error. */
@ -5949,11 +5949,11 @@ int mma2er2_(integer *ndjacu,
/* constraints of order IORDRU by U and IORDRV by V. */ /* constraints of order IORDRU by U and IORDRV by V. */
/* EPMSCUT: Tolerance of approximation. */ /* EPMSCUT: Tolerance of approximation. */
/* VECERR: Auxiliary vector. */ /* VECERR: Auxiliary vector. */
/* ERREUR: MAX Error commited ALREADY CALCULATED */ /* ERREUR: MAX Error committed ALREADY CALCULATED */
/* OUTPUT ARGUMENTS : */ /* OUTPUT ARGUMENTS : */
/* ------------------- */ /* ------------------- */
/* ERREUR: MAX Error commited by preserving only coeff of PATJAC */ /* ERREUR: MAX Error committed by preserving only coeff of PATJAC */
/* of indices from 0 to NEWDGU by U and from 0 to NEWDGV by V */ /* of indices from 0 to NEWDGU by U and from 0 to NEWDGV by V */
/* PLUS the already calculated error. */ /* PLUS the already calculated error. */
/* NEWDGU: Min. Degree by U such as the square of approximation */ /* NEWDGU: Min. Degree by U such as the square of approximation */
@ -7281,7 +7281,7 @@ int mma2moy_(integer *ndgumx,
/* OUTPUT ARGUMENTS : */ /* OUTPUT ARGUMENTS : */
/* ------------------- */ /* ------------------- */
/* ERRMOY: Average error commited by preserving only the coeff of */ /* ERRMOY: Average error committed by preserving only the coeff of */
/* PATJAC 2*(IORDRU+1) in MINDGU by U and 2*(IORDRV+1) in MINDGV by V. */ /* PATJAC 2*(IORDRU+1) in MINDGU by U and 2*(IORDRV+1) in MINDGV by V. */
/* COMMONS USED : */ /* COMMONS USED : */

View File

@ -120,7 +120,7 @@ void Approx_SweepApproximation::Perform(const Standard_Real First,
Translation.SetXYZ Translation.SetXYZ
(myFunc->BarycentreOfSurf().XYZ()); (myFunc->BarycentreOfSurf().XYZ());
for (ii=1; ii<=Num3DSS; ii++) { for (ii=1; ii<=Num3DSS; ii++) {
Tol = ThreeDTol->Value(ii)/2; // To take accout of the error on the final result. Tol = ThreeDTol->Value(ii)/2; // To take account of the error on the final result.
OneDTol->SetValue(ii, Tol * Wmin(ii) / Size); OneDTol->SetValue(ii, Tol * Wmin(ii) / Size);
Tol *= Wmin(ii); //Factor of projection Tol *= Wmin(ii); //Factor of projection
ThreeDTol->SetValue(ii, Max(Tol, 1.e-20) ); ThreeDTol->SetValue(ii, Max(Tol, 1.e-20) );

View File

@ -21,7 +21,7 @@
#include <BOPDS_VectorOfPoint.hxx> #include <BOPDS_VectorOfPoint.hxx>
/** /**
* The class BOPDS_Interf is is to store the information about * The class BOPDS_Interf stores the information about
* the interference between two shapes. * the interference between two shapes.
* The class BOPDS_Interf is root class * The class BOPDS_Interf is root class
* *
@ -191,7 +191,7 @@ class BOPDS_Interf {
Handle(NCollection_BaseAllocator) myAllocator; Handle(NCollection_BaseAllocator) myAllocator;
}; };
/** /**
* The class BOPDS_InterfVV is is to store the information about * The class BOPDS_InterfVV stores the information about
* the interference of the type vertex/vertex. * the interference of the type vertex/vertex.
*/ */
//======================================================================= //=======================================================================
@ -224,7 +224,7 @@ class BOPDS_InterfVV : public BOPDS_Interf {
// //
}; };
/** /**
* The class BOPDS_InterfVE is is to store the information about * The class BOPDS_InterfVE stores the information about
* the interference of the type vertex/edge. * the interference of the type vertex/edge.
*/ */
//======================================================================= //=======================================================================
@ -289,7 +289,7 @@ class BOPDS_InterfVE : public BOPDS_Interf {
}; };
/** /**
* The class BOPDS_InterfVF is is to store the information about * The class BOPDS_InterfVF stores the information about
* the interference of the type vertex/face * the interference of the type vertex/face
*/ */
//======================================================================= //=======================================================================
@ -362,7 +362,7 @@ class BOPDS_InterfVF : public BOPDS_Interf {
}; };
/** /**
* The class BOPDS_InterfEE is is to store the information about * The class BOPDS_InterfEE stores the information about
* the interference of the type edge/edge. * the interference of the type edge/edge.
*/ */
//======================================================================= //=======================================================================
@ -417,7 +417,7 @@ class BOPDS_InterfEE : public BOPDS_Interf {
IntTools_CommonPrt myCommonPart; IntTools_CommonPrt myCommonPart;
}; };
/** /**
* The class BOPDS_InterfEF is is to store the information about * The class BOPDS_InterfEF stores the information about
* the interference of the type edge/face. * the interference of the type edge/face.
*/ */
//======================================================================= //=======================================================================
@ -477,7 +477,7 @@ class BOPDS_InterfEF : public BOPDS_Interf {
IntTools_CommonPrt myCommonPart; IntTools_CommonPrt myCommonPart;
} }
/** /**
* The class BOPDS_InterfFF is is to store the information about * The class BOPDS_InterfFF stores the information about
* the interference of the type face/face. * the interference of the type face/face.
*/; */;
//======================================================================= //=======================================================================
@ -588,7 +588,7 @@ class BOPDS_InterfFF : public BOPDS_Interf {
}; };
/** /**
* The class BOPDS_InterfVZ is is to store the information about * The class BOPDS_InterfVZ stores the information about
* the interference of the type vertex/solid. * the interference of the type vertex/solid.
*/ */
//======================================================================= //=======================================================================
@ -621,7 +621,7 @@ class BOPDS_InterfVZ : public BOPDS_Interf {
// //
}; };
/** /**
* The class BOPDS_InterfEZ is is to store the information about * The class BOPDS_InterfEZ stores the information about
* the interference of the type edge/solid. * the interference of the type edge/solid.
*/ */
//======================================================================= //=======================================================================
@ -654,7 +654,7 @@ class BOPDS_InterfEZ : public BOPDS_Interf {
// //
}; };
/** /**
* The class BOPDS_InterfFZ is is to store the information about * The class BOPDS_InterfFZ stores the information about
* the interference of the type face/solid. * the interference of the type face/solid.
*/ */
//======================================================================= //=======================================================================
@ -687,7 +687,7 @@ class BOPDS_InterfFZ : public BOPDS_Interf {
// //
}; };
/** /**
* The class BOPDS_InterfZZ is is to store the information about * The class BOPDS_InterfZZ stores the information about
* the interference of the type solid/solid. * the interference of the type solid/solid.
*/ */
//======================================================================= //=======================================================================

View File

@ -128,7 +128,7 @@ public:
//! Query //! Query
//! Returns true if there is flag. //! Returns true if there is flag.
//! Returns the the flag theFlag //! Returns the flag theFlag
Standard_Boolean HasFlag (Standard_Integer& theFlag) const; Standard_Boolean HasFlag (Standard_Integer& theFlag) const;

View File

@ -118,7 +118,7 @@ static void UpdateCurves(BRep_ListOfCurveRepresentation& lcr,
if (GC->IsCurve3D()) { if (GC->IsCurve3D()) {
// if (!C.IsNull()) { //xpu031198, edge degeneree // if (!C.IsNull()) { //xpu031198, edge degeneree
// xpu151298 : parameters can be setted for null curves // xpu151298 : parameters can be set for null curves
// see lbo & flo, to determine whether range is defined // see lbo & flo, to determine whether range is defined
// compare first and last parameters with default values. // compare first and last parameters with default values.
GC->Range(f, l); GC->Range(f, l);
@ -185,7 +185,7 @@ static void UpdateCurves(BRep_ListOfCurveRepresentation& lcr,
if (GC->IsCurve3D()) { if (GC->IsCurve3D()) {
// if (!C.IsNull()) { //xpu031198, edge degeneree // if (!C.IsNull()) { //xpu031198, edge degeneree
// xpu151298 : parameters can be setted for null curves // xpu151298 : parameters can be set for null curves
// see lbo & flo, to determine whether range is defined // see lbo & flo, to determine whether range is defined
// compare first and last parameters with default values. // compare first and last parameters with default values.
GC->Range(f, l); GC->Range(f, l);

View File

@ -70,7 +70,7 @@ public:
Standard_EXPORT BRepAdaptor_CompCurve(const TopoDS_Wire& W, const Standard_Boolean KnotByCurvilinearAbcissa = Standard_False); Standard_EXPORT BRepAdaptor_CompCurve(const TopoDS_Wire& W, const Standard_Boolean KnotByCurvilinearAbcissa = Standard_False);
//! Creates a Curve to acces to the geometry of edge //! Creates a Curve to access the geometry of edge
//! <W>. //! <W>.
Standard_EXPORT BRepAdaptor_CompCurve(const TopoDS_Wire& W, const Standard_Boolean KnotByCurvilinearAbcissa, const Standard_Real First, const Standard_Real Last, const Standard_Real Tol); Standard_EXPORT BRepAdaptor_CompCurve(const TopoDS_Wire& W, const Standard_Boolean KnotByCurvilinearAbcissa, const Standard_Real First, const Standard_Real Last, const Standard_Real Tol);

View File

@ -71,11 +71,11 @@ public:
//! Creates an undefined Curve with no Edge loaded. //! Creates an undefined Curve with no Edge loaded.
Standard_EXPORT BRepAdaptor_Curve(); Standard_EXPORT BRepAdaptor_Curve();
//! Creates a Curve to acces to the geometry of edge //! Creates a Curve to access the geometry of edge
//! <E>. //! <E>.
Standard_EXPORT BRepAdaptor_Curve(const TopoDS_Edge& E); Standard_EXPORT BRepAdaptor_Curve(const TopoDS_Edge& E);
//! Creates a Curve to acces to the geometry of edge //! Creates a Curve to access the geometry of edge
//! <E>. The geometry will be computed using the //! <E>. The geometry will be computed using the
//! parametric curve of <E> on the face <F>. An Error //! parametric curve of <E> on the face <F>. An Error
//! is raised if the edge does not have a pcurve on //! is raised if the edge does not have a pcurve on
@ -85,11 +85,11 @@ public:
//! Reset currently loaded curve (undone Load()). //! Reset currently loaded curve (undone Load()).
Standard_EXPORT void Reset(); Standard_EXPORT void Reset();
//! Sets the Curve <me> to acces to the geometry of //! Sets the Curve <me> to access the geometry of
//! edge <E>. //! edge <E>.
Standard_EXPORT void Initialize (const TopoDS_Edge& E); Standard_EXPORT void Initialize (const TopoDS_Edge& E);
//! Sets the Curve <me> to acces to the geometry of //! Sets the Curve <me> to access the geometry of
//! edge <E>. The geometry will be computed using the //! edge <E>. The geometry will be computed using the
//! parametric curve of <E> on the face <F>. An Error //! parametric curve of <E> on the face <F>. An Error
//! is raised if the edge does not have a pcurve on //! is raised if the edge does not have a pcurve on

View File

@ -44,7 +44,7 @@ public:
Standard_EXPORT BRepAlgo_FaceRestrictor(); Standard_EXPORT BRepAlgo_FaceRestrictor();
//! the surface of <F> will be the the surface of each new //! the surface of <F> will be the surface of each new
//! faces built. //! faces built.
//! <Proj> is used to update pcurves on edges if necessary. //! <Proj> is used to update pcurves on edges if necessary.
//! See Add(). //! See Add().

View File

@ -306,7 +306,7 @@ Standard_Boolean BRepBlend_AppFuncRoot::SearchPoint(Blend_AppFunction& Func,
Vec(XInit,Pnt); Vec(XInit,Pnt);
} }
else { else {
// (1.d) Intialisation by linear interpolation // (1.d) Initialisation by linear interpolation
Pnt = myLine->Point(Index); Pnt = myLine->Point(Index);
Vec(X1,Pnt); Vec(X1,Pnt);
t1 = Pnt.Parameter(); t1 = Pnt.Parameter();

View File

@ -3195,7 +3195,7 @@ void BRepBuilderAPI_Sewing::Merging(const Standard_Boolean /* firstTime */,
MergedWithBound.Contains(iedge)); MergedWithBound.Contains(iedge));
if (!isRejected) { if (!isRejected) {
if (myBoundSections.IsBound(iedge)) { if (myBoundSections.IsBound(iedge)) {
// Edge is splitted - check sections // Edge is split - check sections
TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge)); TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge));
for (; lit.More() && !isRejected; lit.Next()) { for (; lit.More() && !isRejected; lit.Next()) {
const TopoDS_Shape& sec = lit.Value(); const TopoDS_Shape& sec = lit.Value();
@ -3289,7 +3289,7 @@ void BRepBuilderAPI_Sewing::Merging(const Standard_Boolean /* firstTime */,
MergedWithSections.Contains(iedge)); MergedWithSections.Contains(iedge));
if (!isRejected) { if (!isRejected) {
if (myBoundSections.IsBound(iedge)) { if (myBoundSections.IsBound(iedge)) {
// Edge is splitted - check sections // Edge is split - check sections
TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge)); TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge));
for (; lit.More() && !isRejected; lit.Next()) { for (; lit.More() && !isRejected; lit.Next()) {
const TopoDS_Shape& sec = lit.Value(); const TopoDS_Shape& sec = lit.Value();
@ -3370,7 +3370,7 @@ void BRepBuilderAPI_Sewing::Merging(const Standard_Boolean /* firstTime */,
if (!isMerged && !isMergedSplit) { if (!isMerged && !isMergedSplit) {
// Nothing was merged in this iteration // Nothing was merged in this iteration
if (isPrevSplit) { if (isPrevSplit) {
// Replace previously splitted bound // Replace previously split bound
myReShape->Replace(myReShape->Apply(bound),myReShape->Apply(BoundWire)); myReShape->Replace(myReShape->Apply(bound),myReShape->Apply(BoundWire));
} }
// else if (hasCuttingSections) { // else if (hasCuttingSections) {
@ -3726,7 +3726,7 @@ void BRepBuilderAPI_Sewing::Cutting(const Message_ProgressRange& theProgress)
// Store bound for section // Store bound for section
mySectionBound.Bind(section,bound); mySectionBound.Bind(section,bound);
} }
// Store splitted bound // Store split bound
myBoundSections.Bind(bound,listSections); myBoundSections.Bind(bound,listSections);
} }
} }

View File

@ -64,7 +64,7 @@ public:
//! Set an sweep's mode //! Set an sweep's mode
//! If no mode are setted, the mode use in MakePipe is used //! If no mode are set, the mode used in MakePipe is used
Standard_EXPORT BRepFill_PipeShell(const TopoDS_Wire& Spine); Standard_EXPORT BRepFill_PipeShell(const TopoDS_Wire& Spine);
//! Set an Frenet or an CorrectedFrenet trihedron //! Set an Frenet or an CorrectedFrenet trihedron
@ -86,7 +86,7 @@ public:
//! Set support to the spine to define the BiNormal //! Set support to the spine to define the BiNormal
//! at the spine, like the normal the surfaces. //! at the spine, like the normal the surfaces.
//! Warning: To be effective, Each edge of the <spine> must //! Warning: To be effective, Each edge of the <spine> must
//! have an representaion on one face of<SpineSupport> //! have an representation on one face of<SpineSupport>
Standard_EXPORT Standard_Boolean Set (const TopoDS_Shape& SpineSupport); Standard_EXPORT Standard_Boolean Set (const TopoDS_Shape& SpineSupport);
//! Set an auxiliary spine to define the Normal //! Set an auxiliary spine to define the Normal

View File

@ -96,7 +96,7 @@ protected:
private: private:
//! Construction from a set of cuves from Geom2d. //! Construction from a set of curves from Geom2d.
//! Assume the orientation of the closed lines are //! Assume the orientation of the closed lines are
//! compatible. (ie if A is in B, the orientation of A and B //! compatible. (ie if A is in B, the orientation of A and B
//! has to be different. //! has to be different.

View File

@ -51,7 +51,7 @@ public:
const NCollection_List<TColStd_SequenceOfInteger>& theWires, const NCollection_List<TColStd_SequenceOfInteger>& theWires,
const gp_Dir& theNorm); const gp_Dir& theNorm);
//! Performs triangulation of source wires and stores triangles the the output list. //! Performs triangulation of source wires and stores triangles the output list.
Standard_EXPORT Standard_Boolean Perform (NCollection_List<Poly_Triangle>& thePolyTriangles); Standard_EXPORT Standard_Boolean Perform (NCollection_List<Poly_Triangle>& thePolyTriangles);
//! Set messenger for output information //! Set messenger for output information

View File

@ -67,7 +67,7 @@ public:
//! Constructs the shell-generating framework defined by the wire Spine. //! Constructs the shell-generating framework defined by the wire Spine.
//! Sets an sweep's mode //! Sets an sweep's mode
//! If no mode are setted, the mode use in MakePipe is used //! If no mode are set, the mode use in MakePipe is used
Standard_EXPORT BRepOffsetAPI_MakePipeShell(const TopoDS_Wire& Spine); Standard_EXPORT BRepOffsetAPI_MakePipeShell(const TopoDS_Wire& Spine);
//! Sets a Frenet or a CorrectedFrenet trihedron //! Sets a Frenet or a CorrectedFrenet trihedron
@ -91,7 +91,7 @@ public:
//! Sets support to the spine to define the BiNormal of //! Sets support to the spine to define the BiNormal of
//! the trihedron, like the normal to the surfaces. //! the trihedron, like the normal to the surfaces.
//! Warning: To be effective, Each edge of the <spine> must //! Warning: To be effective, Each edge of the <spine> must
//! have an representaion on one face of<SpineSupport> //! have a representation on one face of<SpineSupport>
Standard_EXPORT Standard_Boolean SetMode (const TopoDS_Shape& SpineSupport); Standard_EXPORT Standard_Boolean SetMode (const TopoDS_Shape& SpineSupport);
//! Sets an auxiliary spine to define the Normal //! Sets an auxiliary spine to define the Normal

View File

@ -111,7 +111,7 @@ public:
//! Returns the initial face corresponding to the projected edge E. //! Returns the initial face corresponding to the projected edge E.
//! Exceptions //! Exceptions
//! StdFail_NotDone if no face was found. //! StdFail_NotDone if no face was found.
//! Standard_NoSuchObject if if a face corresponding to //! Standard_NoSuchObject if a face corresponding to
//! E has already been found. //! E has already been found.
Standard_EXPORT const TopoDS_Shape& Couple (const TopoDS_Edge& E) const; Standard_EXPORT const TopoDS_Shape& Couple (const TopoDS_Edge& E) const;

View File

@ -367,7 +367,7 @@ TopoDS_Shape BRepTools_Quilt::Shells() const
// - Add the face to an existing shell // - Add the face to an existing shell
// - Connect other shells if the face touch more than one shell // - Connect other shells if the face touch more than one shell
// In the Map M the Shell is bound withe the relative orientation of E // In the Map M the Shell is bound with the relative orientation of E
// in the shell // in the shell
// In the map MF we binb the face to its shell. // In the map MF we binb the face to its shell.
// In the Map MF the Shell is bound with the relative orientation of F // In the Map MF the Shell is bound with the relative orientation of F

View File

@ -663,7 +663,7 @@ public:
//! * Knots and multiplicities or "flat knots" without //! * Knots and multiplicities or "flat knots" without
//! multiplicities. //! multiplicities.
//! //!
//! * The <Index> is the the localization of the //! * The <Index> is the localization of the
//! parameter in the knot sequence. If <Index> is out //! parameter in the knot sequence. If <Index> is out
//! of range the correct value will be searched. //! of range the correct value will be searched.
//! //!
@ -1359,7 +1359,7 @@ public:
//! FlatKnots are the knots of the BSpline Starting Condition if = //! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move //! -1 means the starting point of the curve can move
//! = 0 means the //! = 0 means the
//! starting point of the cuve cannot move but tangen starting //! starting point of the curve cannot move but tangent starting
//! point of the curve cannot move //! point of the curve cannot move
//! = 1 means the starting point and tangents cannot move //! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move //! = 2 means the starting point tangent and curvature cannot move
@ -1386,7 +1386,7 @@ public:
//! FlatKnots are the knots of the BSpline Starting Condition if = //! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move //! -1 means the starting point of the curve can move
//! = 0 means the //! = 0 means the
//! starting point of the cuve cannot move but tangen starting //! starting point of the curve cannot move but tangent starting
//! point of the curve cannot move //! point of the curve cannot move
//! = 1 means the starting point and tangents cannot move //! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move //! = 2 means the starting point tangent and curvature cannot move
@ -1413,7 +1413,7 @@ public:
//! FlatKnots are the knots of the BSpline Starting Condition if = //! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move //! -1 means the starting point of the curve can move
//! = 0 means the //! = 0 means the
//! starting point of the cuve cannot move but tangen starting //! starting point of the curve cannot move but tangent starting
//! point of the curve cannot move //! point of the curve cannot move
//! = 1 means the starting point and tangents cannot move //! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move //! = 2 means the starting point tangent and curvature cannot move

View File

@ -164,7 +164,7 @@ protected:
BVH_Tree<T, N>* theBVH, BVH_Tree<T, N>* theBVH,
const Standard_Integer theNode) const = 0; const Standard_Integer theNode) const = 0;
//! Processes child nodes of the splitted BVH node. //! Processes child nodes of the split BVH node.
virtual void addChildren (BVH_Tree<T, N>* theBVH, virtual void addChildren (BVH_Tree<T, N>* theBVH,
BVH_BuildQueue& theBuildQueue, BVH_BuildQueue& theBuildQueue,
const Standard_Integer theNode, const Standard_Integer theNode,

View File

@ -70,7 +70,7 @@ Bisector_Bisec::Bisector_Bisec()
// apoint : point through which the bissectrice should pass. // apoint : point through which the bissectrice should pass.
// afirstvector : \ vectors to determine the sector where // afirstvector : \ vectors to determine the sector where
// asecondvector : / the bissectrice should be located. // asecondvector : / the bissectrice should be located.
// adirection : shows the the side of the bissectrice to be preserved. // adirection : shows the side of the bissectrice to be preserved.
// tolerance : threshold starting from which the bisectrices are degenerated // tolerance : threshold starting from which the bisectrices are degenerated
//=========================================================================== //===========================================================================

View File

@ -810,7 +810,7 @@ TopoDS_Edge ChFi2d_Builder::BuildFilletEdge(const TopoDS_Vertex& V,
Handle(Geom2d_Circle) CC2 = Handle(Geom2d_Circle)::DownCast(basisC2); Handle(Geom2d_Circle) CC2 = Handle(Geom2d_Circle)::DownCast(basisC2);
ElCLib::D1(param3,CC2->Circ2d(),p,Ve2); ElCLib::D1(param3,CC2->Circ2d(),p,Ve2);
Sens2 = (CC2->Circ2d()).IsDirect(); Sens2 = (CC2->Circ2d()).IsDirect();
} // if if (C2->DynamicType() ... } // if (C2->DynamicType() ...
else { else {
Handle(Geom2d_Line) CC2 = Handle(Geom2d_Line)::DownCast(basisC2); Handle(Geom2d_Line) CC2 = Handle(Geom2d_Line)::DownCast(basisC2);
ElCLib::D1(param3,CC2->Lin2d(),p,Ve2); ElCLib::D1(param3,CC2->Lin2d(),p,Ve2);

View File

@ -672,7 +672,7 @@ Standard_Boolean ChFi3d_Builder::SplitKPart
Standard_Boolean& intf, Standard_Boolean& intf,
Standard_Boolean& intl) Standard_Boolean& intl)
{ {
//The the hatching of each faces is started by tangency lines. //The hatching of each faces is started by tangency lines.
Standard_Real pitol = Precision::PIntersection(); Standard_Real pitol = Precision::PIntersection();

View File

@ -331,7 +331,7 @@ void D3DHost_FrameBuffer::BindBuffer (const Handle(OpenGl_Context)& theCtx)
myDepthFormat = 0; myDepthFormat = 0;
myDepthStencilTexture->Release (theCtx.get()); myDepthStencilTexture->Release (theCtx.get());
theCtx->PushMessage (GL_DEBUG_SOURCE_APPLICATION, GL_DEBUG_TYPE_PORTABILITY, 0, GL_DEBUG_SEVERITY_HIGH, theCtx->PushMessage (GL_DEBUG_SOURCE_APPLICATION, GL_DEBUG_TYPE_PORTABILITY, 0, GL_DEBUG_SEVERITY_HIGH,
"D3DHost_FrameBuffer, OpenGL FBO is created without Depth+Stencil attachements!"); "D3DHost_FrameBuffer, OpenGL FBO is created without Depth+Stencil attachments!");
} }
} }
} }

View File

@ -1634,7 +1634,7 @@ void DBRep::BasicCommands(Draw_Interpretor& theCommands)
theCommands.Add("numshapes","numshapes s; size of shape",__FILE__,numshapes,g); theCommands.Add("numshapes","numshapes s; size of shape",__FILE__,numshapes,g);
theCommands.Add("countshapes","countshapes s; count of shape",__FILE__,countshapes,g); theCommands.Add("countshapes","countshapes s; count of shape",__FILE__,countshapes,g);
theCommands.Add("setflags", theCommands.Add("setflags",
"setflags shape_name flag1[flag2...]\n sets flags for shape(free, modidfied, checked, orientable, closed, infinite, convex, locked), for exmple <setflags a free> or <setflags a -free> if necessary unflag ", "setflags shape_name flag1[flag2...]\n sets flags for shape(free, modified, checked, orientable, closed, infinite, convex, locked), for example <setflags a free> or <setflags a -free> if necessary unflag ",
__FILE__,setFlags,g); __FILE__,setFlags,g);
// theCommands.Add("dumpmmgt", // theCommands.Add("dumpmmgt",

View File

@ -43,12 +43,12 @@ public:
//! Search in draw directory the framewok identified //! Search in draw directory the framewok identified
//! by its name <Name>. returns True if found. In that //! by its name <Name>. returns True if found. In that
//! case <DF> is setted. //! case <DF> is set.
Standard_EXPORT static Standard_Boolean GetDF (Standard_CString& Name, Handle(TDF_Data)& DF, const Standard_Boolean Complain = Standard_True); Standard_EXPORT static Standard_Boolean GetDF (Standard_CString& Name, Handle(TDF_Data)& DF, const Standard_Boolean Complain = Standard_True);
//! Search in <DF> the label identified by its entry //! Search in <DF> the label identified by its entry
//! <Entry>. returns <True> if found. In that case //! <Entry>. returns <True> if found. In that case
//! <Label> is setted. //! <Label> is set.
Standard_EXPORT static Standard_Boolean FindLabel (const Handle(TDF_Data)& DF, const Standard_CString Entry, TDF_Label& Label, const Standard_Boolean Complain = Standard_True); Standard_EXPORT static Standard_Boolean FindLabel (const Handle(TDF_Data)& DF, const Standard_CString Entry, TDF_Label& Label, const Standard_Boolean Complain = Standard_True);
//! Search in <DF> the label identified by its entry //! Search in <DF> the label identified by its entry
@ -58,7 +58,7 @@ public:
//! Search in <DF> the attribute identified by its //! Search in <DF> the attribute identified by its
//! <ID> and its <entry>. returns <True> if found. In //! <ID> and its <entry>. returns <True> if found. In
//! that case A is setted. //! that case A is set.
Standard_EXPORT static Standard_Boolean Find (const Handle(TDF_Data)& DF, const Standard_CString Entry, const Standard_GUID& ID, Handle(TDF_Attribute)& A, const Standard_Boolean Complain = Standard_True); Standard_EXPORT static Standard_Boolean Find (const Handle(TDF_Data)& DF, const Standard_CString Entry, const Standard_GUID& ID, Handle(TDF_Attribute)& A, const Standard_Boolean Complain = Standard_True);
//! Safe variant for arbitrary type of argument //! Safe variant for arbitrary type of argument

View File

@ -69,7 +69,7 @@ public:
//! Returns a string composed with the list of //! Returns a string composed with the list of
//! referenced attribute index of the attribute //! referenced attribute index of the attribute
//! <anIndex>. For exemple, it is usefull for //! <anIndex>. For example, it is useful for
//! TDataStd_Group. It uses a mechanism based on a //! TDataStd_Group. It uses a mechanism based on a
//! DDF_AttributeBrowser. //! DDF_AttributeBrowser.
Standard_EXPORT TCollection_AsciiString OpenAttribute (const Standard_Integer anIndex = 0); Standard_EXPORT TCollection_AsciiString OpenAttribute (const Standard_Integer anIndex = 0);

View File

@ -257,7 +257,7 @@ static Standard_Integer CopyLabel_SCopy (Draw_Interpretor& di,Standard_Integer n
if(!DDF::GetDF(a[1], DF)) return 1; if(!DDF::GetDF(a[1], DF)) return 1;
if (!DDF::FindLabel(DF,a[2],SOURCE)) return 1; if (!DDF::FindLabel(DF,a[2],SOURCE)) return 1;
if (DDF::FindLabel(DF,a[3],TARGET)) { if (DDF::FindLabel(DF,a[3],TARGET)) {
di << " target label is already setted \n"; di << " target label is already set \n";
return 1; return 1;
} }
DDF::AddLabel(DF,a[3],TARGET); DDF::AddLabel(DF,a[3],TARGET);

View File

@ -367,7 +367,7 @@ static Standard_Integer DDataStd_Self (Draw_Interpretor& di,
TDF_Label L; TDF_Label L;
if (!DDF::FindLabel(DF,arg[2],L)) return 1; if (!DDF::FindLabel(DF,arg[2],L)) return 1;
// TDataStd::MakeSelfContained(L,removed); // TDataStd::MakeSelfContained(L,removed);
// if (removed.IsEmpty()) std::cout << "noone attriburte removed" << std::endl; // if (removed.IsEmpty()) std::cout << "no attribute removed" << std::endl;
// for (TDF_ListIteratorOfAttributeList it(removed);it.More();it.Next()) { // for (TDF_ListIteratorOfAttributeList it(removed);it.More();it.Next()) {
// TDF_Tool::Entry(it.Value()->Label(),s); std::cout << s << " "; // TDF_Tool::Entry(it.Value()->Label(),s); std::cout << s << " ";
// std::cout << std::endl; // std::cout << std::endl;

View File

@ -33,7 +33,7 @@ class TDF_AttributeDelta;
class DDataStd_DrawPresentation; class DDataStd_DrawPresentation;
DEFINE_STANDARD_HANDLE(DDataStd_DrawPresentation, TDF_Attribute) DEFINE_STANDARD_HANDLE(DDataStd_DrawPresentation, TDF_Attribute)
//! draw presentaion of a label of a document //! draw presentation of a label of a document
class DDataStd_DrawPresentation : public TDF_Attribute class DDataStd_DrawPresentation : public TDF_Attribute
{ {

View File

@ -26,7 +26,7 @@
# white : interoperable # white : interoperable
# white + c : non interoperable # white + c : non interoperable
# X : X Reference # X : X Reference
# Red : not yet commited in transaction #0 # Red : not yet committed in transaction #0
# #
# #
@ -157,7 +157,7 @@ proc TREE:Tree:InitTextPanel { TreeBrowser w p } {
$TREE_WINDOWS($w,NAV,text) insert end " Welcome to the QDF browser (Rev #.#)\n" $TREE_WINDOWS($w,NAV,text) insert end " Welcome to the QDF browser (Rev #.#)\n"
$TREE_WINDOWS($w,NAV,text) insert end "--------------------------------------\n\n" $TREE_WINDOWS($w,NAV,text) insert end "--------------------------------------\n\n"
$TREE_WINDOWS($w,NAV,text) insert end "This browser is an easy to use prototype made with Tix technology. We hope it will be usefull for understanding and debugging QDF.\n" $TREE_WINDOWS($w,NAV,text) insert end "This browser is an easy to use prototype made with Tix technology. We hope it will be useful for understanding and debugging QDF.\n"
$TREE_WINDOWS($w,NAV,text) insert end "\t\t\t\tFID & YAN" $TREE_WINDOWS($w,NAV,text) insert end "\t\t\t\tFID & YAN"
} }

View File

@ -61,7 +61,7 @@ static void DDocStd_StorageErrorMessage (Draw_Interpretor& theDI, const Storage_
theDI << "Storage error: error during writing"; theDI << "Storage error: error during writing";
break; break;
case Storage_VSFormatError: case Storage_VSFormatError:
theDI << "Storage error: wrong format error occured while reading"; theDI << "Storage error: wrong format error occurred while reading";
break; break;
case Storage_VSUnknownType: case Storage_VSUnknownType:
theDI << "Storage error: try to read an unknown type"; theDI << "Storage error: try to read an unknown type";

View File

@ -273,7 +273,7 @@ static void LoadC0Edges(const TopoDS_Shape& S,
} }
TopTools_MapOfShape anEdgesToDelete; TopTools_MapOfShape anEdgesToDelete;
TopExp_Explorer anEx(S,TopAbs_EDGE); // mpv: new explorer iterator becouse we need keep edges order TopExp_Explorer anEx(S,TopAbs_EDGE); // mpv: new explorer iterator because we need keep edges order
for(;anEx.More();anEx.Next()) { for(;anEx.More();anEx.Next()) {
Standard_Boolean aC0 = Standard_False; Standard_Boolean aC0 = Standard_False;
TopoDS_Shape anEdge1 = anEx.Current(); TopoDS_Shape anEdge1 = anEx.Current();
@ -602,7 +602,7 @@ Handle(TNaming_NamedShape) DNaming::GetObjectValue(const Handle(TDataStd_UAttrib
//======================================================================= //=======================================================================
//function : GetPrevFunction //function : GetPrevFunction
//purpose : Returns previus function //purpose : Returns previous function
//======================================================================= //=======================================================================
Handle(TFunction_Function) DNaming::GetPrevFunction(const Handle(TFunction_Function)& theFunction) Handle(TFunction_Function) DNaming::GetPrevFunction(const Handle(TFunction_Function)& theFunction)
{ {

View File

@ -156,7 +156,7 @@ static Standard_Integer Getentry (Draw_Interpretor& di, Standard_Integer n, cons
TopoDS_Shape S = DBRep::Get(a[2]); TopoDS_Shape S = DBRep::Get(a[2]);
if (S.IsNull()) { if (S.IsNull()) {
di <<"Noone shape selected\n"; di <<"No shape selected\n";
//di << 0; //di << 0;
return 0; return 0;
} }
@ -176,7 +176,7 @@ static Standard_Integer Getentry (Draw_Interpretor& di, Standard_Integer n, cons
//======================================================================= //=======================================================================
//function : NamedShape //function : NamedShape
//purpose : retrive label of Primitive or a Generated shape //purpose : retrieve label of Primitive or a Generated shape
//======================================================================= //=======================================================================
static Standard_Integer NamedShape(Draw_Interpretor& di, Standard_Integer n, const char** a) static Standard_Integer NamedShape(Draw_Interpretor& di, Standard_Integer n, const char** a)
{ {
@ -187,7 +187,7 @@ static Standard_Integer NamedShape(Draw_Interpretor& di, Standard_Integer n, con
if (!DDF::GetDF(a[1],ND)) return 1; if (!DDF::GetDF(a[1],ND)) return 1;
TopoDS_Shape SS = DBRep::Get(a[2]); TopoDS_Shape SS = DBRep::Get(a[2]);
if (SS.IsNull()) { if (SS.IsNull()) {
di <<"Noone shape selected\n"; di <<"No shape selected\n";
//di << 0; //di << 0;
return 0; return 0;
} }
@ -396,7 +396,7 @@ static Standard_Integer Collect (Draw_Interpretor& di,
} }
//======================================================================= //=======================================================================
//function : GetCreationEntry //function : GetCreationEntry
//purpose : retrive label of Primitive or a Generated shape //purpose : retrieve label of Primitive or a Generated shape
//======================================================================= //=======================================================================
static Standard_Integer Getcreationentry (Draw_Interpretor& di, Standard_Integer n, const char** a) static Standard_Integer Getcreationentry (Draw_Interpretor& di, Standard_Integer n, const char** a)
{ {
@ -410,7 +410,7 @@ static Standard_Integer Getcreationentry (Draw_Interpretor& di, Standard_Integer
TopoDS_Shape SS = DBRep::Get(a[2]); TopoDS_Shape SS = DBRep::Get(a[2]);
if (SS.IsNull()) { if (SS.IsNull()) {
di <<"Noone shape selected\n"; di <<"No shape selected\n";
//di << 0; //di << 0;
return 0; return 0;
} }

View File

@ -712,7 +712,7 @@ static Standard_Integer DNaming_AttachShape (Draw_Interpretor& di,
Handle(TFunction_Function) aCntFun; Handle(TFunction_Function) aCntFun;
if(aCont->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result if(aCont->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// First argument of Selection function refers to father function (of context object) // First argument of Selection function refers to father function (of context object)
// to which selection is attached (because sel obj. itself already has refrence to result NS // to which selection is attached (because sel obj. itself already has reference to result NS
TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG), TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG),
aCntFun->Label()); //ref to function produced Context shape aCntFun->Label()); //ref to function produced Context shape
@ -1714,7 +1714,7 @@ static Standard_Boolean MakeSelection (const Handle(TDataStd_UAttribute)& Obj,
Handle(TFunction_Function) aCntFun; Handle(TFunction_Function) aCntFun;
if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// First argument of Selection function refers to father function (of context object) // First argument of Selection function refers to father function (of context object)
// to which selection is attached (because sel obj. itself already has refrence to result NS // to which selection is attached (because sel obj. itself already has reference to result NS
TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG), TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG),
aCntFun->Label()); //ref to function produced Context shape aCntFun->Label()); //ref to function produced Context shape
@ -1772,7 +1772,7 @@ static Standard_Boolean MakeXSelection (const Handle(TDataStd_UAttribute)& Obj,
Handle(TFunction_Function) aCntFun; Handle(TFunction_Function) aCntFun;
if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// First argument of Selection function refers to father function (of context object) // First argument of Selection function refers to father function (of context object)
// to which selection is attached (because sel obj. itself already has refrence to result NS // to which selection is attached (because sel obj. itself already has reference to result NS
TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG), TDF_Reference::Set(aFun->Label().FindChild(FUNCTION_ARGUMENTS_LABEL).FindChild(ATTACH_ARG),
aCntFun->Label()); //ref to function produced Context shape aCntFun->Label()); //ref to function produced Context shape

View File

@ -167,7 +167,7 @@ static Standard_Integer DPrsStd_AISSet (Draw_Interpretor& di,
Standard_GUID guid; Standard_GUID guid;
TCollection_ExtendedString str = arg[3]; TCollection_ExtendedString str = arg[3];
#ifdef OCCT_DEBUG #ifdef OCCT_DEBUG
std::cout << "Inputed parameter > " << str << std::endl; std::cout << "Inputted parameter > " << str << std::endl;
#endif #endif
if ( str == "A" ) //axis if ( str == "A" ) //axis
guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333" guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333"
@ -233,7 +233,7 @@ static Standard_Integer DPrsStd_AISDriver (Draw_Interpretor& di,
else { else {
TCollection_ExtendedString str = arg[3]; TCollection_ExtendedString str = arg[3];
#ifdef OCCT_DEBUG #ifdef OCCT_DEBUG
std::cout << "Inputed parameter > " << str << std::endl; std::cout << "Inputted parameter > " << str << std::endl;
#endif #endif
if ( str == "A" ) //axis if ( str == "A" ) //axis
guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333" guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333"

View File

@ -95,7 +95,7 @@ public:
Standard_EXPORT Draft_ErrorStatus Error() const; Standard_EXPORT Draft_ErrorStatus Error() const;
//! Returns the shape (Face, Edge or Vertex) on which //! Returns the shape (Face, Edge or Vertex) on which
//! an error occured. //! an error occurred.
Standard_EXPORT const TopoDS_Shape& ProblematicShape() const; Standard_EXPORT const TopoDS_Shape& ProblematicShape() const;
//! Returns all the faces which have been added //! Returns all the faces which have been added
@ -145,7 +145,7 @@ public:
//! <Tol> are not significant. //! <Tol> are not significant.
//! //!
//! <NewE> is the new edge created from <E>. <NewF> //! <NewE> is the new edge created from <E>. <NewF>
//! is the new face created from <F>. They may be usefull. //! is the new face created from <F>. They may be useful.
Standard_EXPORT Standard_Boolean NewCurve2d (const TopoDS_Edge& E, const TopoDS_Face& F, const TopoDS_Edge& NewE, const TopoDS_Face& NewF, Handle(Geom2d_Curve)& C, Standard_Real& Tol) Standard_OVERRIDE; Standard_EXPORT Standard_Boolean NewCurve2d (const TopoDS_Edge& E, const TopoDS_Face& F, const TopoDS_Edge& NewE, const TopoDS_Face& NewF, Handle(Geom2d_Curve)& C, Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the Vertex <V> has a new //! Returns Standard_True if the Vertex <V> has a new

View File

@ -75,7 +75,7 @@ public: //! @name Tcl variables management tools
//! variable exist. //! variable exist.
Standard_EXPORT static Standard_Boolean Get (const Standard_CString Name, Standard_Real& val); Standard_EXPORT static Standard_Boolean Get (const Standard_CString Name, Standard_Real& val);
//! Sets a TCL sting variable //! Sets a TCL string variable
Standard_EXPORT static void Set (const Standard_CString Name, const Standard_CString val); Standard_EXPORT static void Set (const Standard_CString Name, const Standard_CString val);
public: //! @name argument parsing tools public: //! @name argument parsing tools

View File

@ -87,7 +87,7 @@ static Standard_Integer chronom(Draw_Interpretor& di,
Draw_Chrono = (*a[1] == '1'); Draw_Chrono = (*a[1] == '1');
if (Draw_Chrono) di << "Chronometers activated.\n"; if (Draw_Chrono) di << "Chronometers activated.\n";
else di << "Chronometers desactivated.\n"; else di << "Chronometers deactivated.\n";
} }
else { else {
Handle(Draw_Drawable3D) D = Draw::Get(a[1]); Handle(Draw_Drawable3D) D = Draw::Get(a[1]);
@ -155,7 +155,7 @@ static Standard_Integer dchronom(Draw_Interpretor& theDI,
Draw_Chrono = (*a[1] == '1'); Draw_Chrono = (*a[1] == '1');
if (Draw_Chrono) theDI << "Chronometers activated.\n"; if (Draw_Chrono) theDI << "Chronometers activated.\n";
else theDI << "Chronometers desactivated.\n"; else theDI << "Chronometers deactivated.\n";
} }
else { else {
Handle(Draw_Drawable3D) D = Draw::Get(a[1]); Handle(Draw_Drawable3D) D = Draw::Get(a[1]);

View File

@ -110,7 +110,7 @@ public:
//! display is drawing. //! display is drawing.
Standard_EXPORT Standard_Integer ViewId() const; Standard_EXPORT Standard_Integer ViewId() const;
//! Returs True if the last drawing operations //! Returns True if the last drawing operations
//! generated a pick hit. When HasPicked is True the //! generated a pick hit. When HasPicked is True the
//! Drawing should be resumed. //! Drawing should be resumed.
//! //!

View File

@ -41,7 +41,7 @@ public:
Standard_EXPORT virtual void DrawOn (Draw_Display& dis) const = 0; Standard_EXPORT virtual void DrawOn (Draw_Display& dis) const = 0;
//! Returs True if the pick is outside the box //! Returns True if the pick is outside the box
Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const; Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const;
//! For variable copy. //! For variable copy.

View File

@ -15,7 +15,7 @@
// commercial license or contractual agreement. // commercial license or contractual agreement.
// Defines common framework for declaration of main/WinMain functions // Defines common framework for declaration of main/WinMain functions
// for executbales on UNIX and WNT that extends DRAW Test Harness. // for executables on UNIX and WNT that extends DRAW Test Harness.
// In order to create executable in DRAW environment, in the executable // In order to create executable in DRAW environment, in the executable
// the following line should be added: // the following line should be added:

View File

@ -51,7 +51,7 @@ public:
Standard_EXPORT void DrawOn (Draw_Display& dis) const Standard_OVERRIDE; Standard_EXPORT void DrawOn (Draw_Display& dis) const Standard_OVERRIDE;
//! Returs always false //! Returns always false
Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const Standard_OVERRIDE; Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const Standard_OVERRIDE;

View File

@ -51,7 +51,7 @@ public:
Standard_EXPORT void DrawOn (Draw_Display& dis) const Standard_OVERRIDE; Standard_EXPORT void DrawOn (Draw_Display& dis) const Standard_OVERRIDE;
//! Returs always false //! Returns always false
Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const Standard_OVERRIDE; Standard_EXPORT virtual Standard_Boolean PickReject (const Standard_Real X, const Standard_Real Y, const Standard_Real Prec) const Standard_OVERRIDE;

View File

@ -31,7 +31,7 @@ class Draw_Drawable3D;
class Draw_Number; class Draw_Number;
DEFINE_STANDARD_HANDLE(Draw_Number, Draw_Drawable3D) DEFINE_STANDARD_HANDLE(Draw_Number, Draw_Drawable3D)
//! To store nummbers in variables. //! To store numbers in variables.
class Draw_Number : public Draw_Drawable3D class Draw_Number : public Draw_Drawable3D
{ {

View File

@ -49,7 +49,7 @@ static Standard_Boolean autodisp = Standard_True;
static Standard_Boolean repaint2d,repaint3d; static Standard_Boolean repaint2d,repaint3d;
//=============================================== //===============================================
// dictionnary of variables // dictionary of variables
// Variables are stored in a map Integer, Transient // Variables are stored in a map Integer, Transient
// The Integer Value is the content of the TCl variable // The Integer Value is the content of the TCl variable
//=============================================== //===============================================

View File

@ -933,8 +933,8 @@ void Draw_Window::WUnmapNotify()
//====================================================== //======================================================
// funtion : ProcessEvents // function : ProcessEvents
// purpose : process pending X events // purpose : process pending X events
//====================================================== //======================================================
static void ProcessEvents(ClientData,int) static void ProcessEvents(ClientData,int)
@ -966,7 +966,7 @@ static void ProcessEvents(ClientData,int)
} }
//====================================================== //======================================================
// funtion : GetNextEvent() // function : GetNextEvent()
// purpose : // purpose :
//====================================================== //======================================================
void GetNextEvent(Event& ev) void GetNextEvent(Event& ev)
@ -995,7 +995,7 @@ void GetNextEvent(Event& ev)
#endif //__APPLE__ #endif //__APPLE__
//====================================================== //======================================================
// funtion :Run_Appli // function :Run_Appli
// purpose : // purpose :
//====================================================== //======================================================
@ -1092,8 +1092,8 @@ void Run_Appli(Standard_Boolean (*interprete) (const char*))
} }
//====================================================== //======================================================
// funtion : Init_Appli() // function : Init_Appli()
// purpose : // purpose :
//====================================================== //======================================================
Standard_Boolean Init_Appli() Standard_Boolean Init_Appli()
{ {
@ -1166,8 +1166,8 @@ Standard_Boolean Init_Appli()
} }
//====================================================== //======================================================
// funtion : Destroy_Appli() // function : Destroy_Appli()
// purpose : // purpose :
//====================================================== //======================================================
void Destroy_Appli() void Destroy_Appli()
{ {
@ -1343,7 +1343,7 @@ HPEN colorPenTab[MAXCOLOR] = {CreatePen(PS_SOLID, PENWIDTH, RGB(255,255,255)),
CreatePen(PS_SOLID, PENWIDTH, RGB(240,230,140)), CreatePen(PS_SOLID, PENWIDTH, RGB(240,230,140)),
CreatePen(PS_SOLID, PENWIDTH, RGB(255,127,80))}; CreatePen(PS_SOLID, PENWIDTH, RGB(255,127,80))};
// Correspondance mode X11 and WINDOWS NT // Correspondence mode X11 and WINDOWS NT
int modeTab[16] = {R2_BLACK, R2_MASKPEN, R2_MASKPENNOT, R2_COPYPEN, int modeTab[16] = {R2_BLACK, R2_MASKPEN, R2_MASKPENNOT, R2_COPYPEN,
R2_MASKNOTPEN, R2_NOP, R2_XORPEN, R2_MERGEPEN, R2_MASKNOTPEN, R2_NOP, R2_XORPEN, R2_MERGEPEN,
R2_NOTMASKPEN, R2_NOTXORPEN, R2_NOT, R2_MERGEPENNOT, R2_NOTMASKPEN, R2_NOTXORPEN, R2_NOT, R2_MERGEPENNOT,

View File

@ -73,7 +73,7 @@ class Draw_Window
/** /**
* This method registers a callback function that will be called just before exit. * This method registers a callback function that will be called just before exit.
* This is usefull especially for Windows platform, on which Draw is normally * This is useful especially for Windows platform, on which Draw is normally
* self-terminated instead of exiting. * self-terminated instead of exiting.
*/ */
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB); Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);
@ -179,7 +179,7 @@ class Draw_Window
}; };
//====================================================== //======================================================
// funtion : Run_Appli // function : Run_Appli
// purpose : run the application // purpose : run the application
// interp will be called to interpret a command // interp will be called to interpret a command
// and return True if the command is complete // and return True if the command is complete
@ -188,19 +188,19 @@ class Draw_Window
void Run_Appli(Standard_Boolean (*inteprete) (const char*)); void Run_Appli(Standard_Boolean (*inteprete) (const char*));
//====================================================== //======================================================
// funtion : Init_Appli // function : Init_Appli
// purpose : // purpose :
//====================================================== //======================================================
Standard_Boolean Init_Appli(); Standard_Boolean Init_Appli();
//====================================================== //======================================================
// funtion : Destroy_Appli() // function : Destroy_Appli()
// purpose : // purpose :
//====================================================== //======================================================
void Destroy_Appli(); void Destroy_Appli();
//====================================================== //======================================================
// funtion : GetNextEvent() // function : GetNextEvent()
// purpose : // purpose :
//====================================================== //======================================================
void GetNextEvent(Event&); void GetNextEvent(Event&);
@ -247,7 +247,7 @@ class Draw_Window
/** /**
* This method registers a callback function that will be called just before exit. * This method registers a callback function that will be called just before exit.
* This is usefull especially for Windows platform, on which Draw is normally * This is useful especially for Windows platform, on which Draw is normally
* self-terminated instead of exiting. * self-terminated instead of exiting.
*/ */
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB); Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);
@ -323,7 +323,7 @@ private:
}; };
//====================================================== //======================================================
// funtion : Run_Appli // function : Run_Appli
// purpose : run the application // purpose : run the application
// interp will be called to interpret a command // interp will be called to interpret a command
// and return True if the command is complete // and return True if the command is complete
@ -332,19 +332,19 @@ private:
void Run_Appli(Standard_Boolean (*inteprete) (const char*)); void Run_Appli(Standard_Boolean (*inteprete) (const char*));
//====================================================== //======================================================
// funtion : Init_Appli // function : Init_Appli
// purpose : // purpose :
//====================================================== //======================================================
Standard_Boolean Init_Appli(); Standard_Boolean Init_Appli();
//====================================================== //======================================================
// funtion : Destroy_Appli() // function : Destroy_Appli()
// purpose : // purpose :
//====================================================== //======================================================
void Destroy_Appli(); void Destroy_Appli();
//====================================================== //======================================================
// funtion : GetNextEvent() // function : GetNextEvent()
// purpose : // purpose :
//====================================================== //======================================================
void GetNextEvent (Standard_Boolean theWait, void GetNextEvent (Standard_Boolean theWait,
@ -408,7 +408,7 @@ public:
/** /**
* This method registers a callback function that will be called just before exit. * This method registers a callback function that will be called just before exit.
* This is usefull especially for Windows platform, on which Draw is normally * This is useful especially for Windows platform, on which Draw is normally
* self-terminated instead of exiting. * self-terminated instead of exiting.
*/ */
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB); Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);

View File

@ -14,7 +14,7 @@
############################################################################ ############################################################################
# This file defines scripts for verification of OCCT tests. # This file defines scripts for verification of OCCT tests.
# It provides top-level commands starting with 'check'. # It provides top-level commands starting with 'check'.
# Type 'help check*' to get their synopsys. # Type 'help check*' to get their synopsis.
# See OCCT Tests User Guide for description of the test system. # See OCCT Tests User Guide for description of the test system.
# #
# Note: procedures with names starting with underscore are for internal use # Note: procedures with names starting with underscore are for internal use
@ -211,7 +211,7 @@ help checknbshapes {
the same sub-shapes with different location as different sub-shapes. the same sub-shapes with different location as different sub-shapes.
-m msg: print "msg" in case of error -m msg: print "msg" in case of error
-ref [nbshapes a]: compare the number of sub-shapes in "shape" and in "a". -ref [nbshapes a]: compare the number of sub-shapes in "shape" and in "a".
-vertex N, -edge N and other options are stil working. -vertex N, -edge N and other options are still working.
} }
proc checknbshapes {shape args} { proc checknbshapes {shape args} {
puts "checknbshapes ${shape} ${args}" puts "checknbshapes ${shape} ${args}"
@ -663,7 +663,7 @@ proc checkdump {shape args} {
} }
foreach item ${local_ref} { foreach item ${local_ref} {
if { ![regexp "$pattern$number_pattern" $ddump full res] } { if { ![regexp "$pattern$number_pattern" $ddump full res] } {
puts "Error: cheked parameter ${param} is not listed in dump" puts "Error: checked parameter ${param} is not listed in dump"
break break
} }
lappend ref_values $res lappend ref_values $res
@ -997,7 +997,7 @@ proc checktrinfo {shape args} {
# get reference values from -ref option # get reference values from -ref option
if { "${ref_info}" != ""} { if { "${ref_info}" != ""} {
if {![regexp "${triinfo_pattern}" ${ref_info} dump ref_nb_triangles ref_nb_nodes ref_deflection]} { if {![regexp "${triinfo_pattern}" ${ref_info} dump ref_nb_triangles ref_nb_nodes ref_deflection]} {
puts "Error: reference information gived by -ref option is wrong" puts "Error: reference information given by -ref option is wrong"
} }
} }
@ -1050,9 +1050,9 @@ help checkplatform {
Use: checkplatform [options...] Use: checkplatform [options...]
Allowed options are: Allowed options are:
-windows : return 1 if current platform is 'Windows', overwise return 0 -windows : return 1 if current platform is 'Windows', otherwise return 0
-linux : return 1 if current platform is 'Linux', overwise return 0 -linux : return 1 if current platform is 'Linux', otherwise return 0
-osx : return 1 if current platform is 'MacOS X', overwise return 0 -osx : return 1 if current platform is 'MacOS X', otherwise return 0
Only one option can be used at once. Only one option can be used at once.
If no option is given, procedure will return the name of current platform. If no option is given, procedure will return the name of current platform.

View File

@ -15,7 +15,7 @@
# This file defines scripts for execution of OCCT tests. # This file defines scripts for execution of OCCT tests.
# It should be loaded automatically when DRAW is started, and provides # It should be loaded automatically when DRAW is started, and provides
# top-level commands starting with 'test'. Type 'help test' to get their # top-level commands starting with 'test'. Type 'help test' to get their
# synopsys. # synopsis.
# See OCCT Tests User Guide for description of the test system. # See OCCT Tests User Guide for description of the test system.
# #
# Note: procedures with names starting with underscore are for internal use # Note: procedures with names starting with underscore are for internal use

View File

@ -26,7 +26,7 @@
# white : interoperable # white : interoperable
# white + c : non interoperable # white + c : non interoperable
# X : X Reference # X : X Reference
# Red : not yet commited in transaction #0 # Red : not yet committed in transaction #0
# #
# #

View File

@ -1362,7 +1362,7 @@ void DrawTrSurf::BasicCommands(Draw_Interpretor& theCommands)
marker of the point\n\n").Cat(MarkersHint).ToCString(), marker of the point\n\n").Cat(MarkersHint).ToCString(),
__FILE__,changepointmarker,g); __FILE__,changepointmarker,g);
g = "Geometric tranformations"; g = "Geometric transformations";
theCommands.Add("translate", theCommands.Add("translate",
"translate name [names...] dx dy dz", "translate name [names...] dx dy dz",

View File

@ -95,7 +95,7 @@ void DsgPrs_AnglePresentation::Add (const Handle(Prs3d_Presentation)& aPresentat
gp_Pnt P1 = ElCLib::Value(0., myCircle); gp_Pnt P1 = ElCLib::Value(0., myCircle);
gp_Pnt P2 = ElCLib::Value(M_PI, myCircle); gp_Pnt P2 = ElCLib::Value(M_PI, myCircle);
gce_MakePln mkPln(P1, P2, Apex); // create a plane whitch defines plane for projection aPosition on it gce_MakePln mkPln(P1, P2, Apex); // create a plane which defines plane for projection aPosition on it
gp_Vec aVector( mkPln.Value().Location(), aPosition ); //project aPosition on a plane gp_Vec aVector( mkPln.Value().Location(), aPosition ); //project aPosition on a plane
gp_Vec Normal = mkPln.Value().Axis().Direction(); gp_Vec Normal = mkPln.Value().Axis().Direction();
@ -116,7 +116,7 @@ void DsgPrs_AnglePresentation::Add (const Handle(Prs3d_Presentation)& aPresentat
OppositePnt = P1; OppositePnt = P1;
} }
aPnt = AttachmentPnt ; // Creating of circle whitch defines a plane for a dimension arc aPnt = AttachmentPnt ; // Creating of circle which defines a plane for a dimension arc
gp_Vec Vec(AttachmentPnt, Apex); // Dimension arc is a part of the circle gp_Vec Vec(AttachmentPnt, Apex); // Dimension arc is a part of the circle
Vec.Scale(2.); Vec.Scale(2.);
aPnt.Translate(Vec); aPnt.Translate(Vec);

View File

@ -27,7 +27,7 @@ public:
DEFINE_STANDARD_ALLOC DEFINE_STANDARD_ALLOC
//! Draw XYZ axes at specified location with attributes defined by the attribute manager theDrawer: //! Draw XYZ axes at specified location with attributes defined by the attribute manager theDrawer:
//! - Prs3d_DatumAspect defines arrow, line and lenght trihedron axis parameters, //! - Prs3d_DatumAspect defines arrow, line and length trihedron axis parameters,
//! - Prs3d_TextAspect defines displayed text. //! - Prs3d_TextAspect defines displayed text.
//! The thihedron origin and axis directions are defined by theDatum coordinate system. //! The thihedron origin and axis directions are defined by theDatum coordinate system.
//! DsgPrs_XYZAxisPresentation framework is used to create graphical primitives for each axis. //! DsgPrs_XYZAxisPresentation framework is used to create graphical primitives for each axis.

View File

@ -38,7 +38,7 @@ public:
//! draws the presentation of fixed objects by //! draws the presentation of fixed objects by
//! drawing the 'fix' symbol at position <aPntEnd>. //! drawing the 'fix' symbol at position <aPntEnd>.
//! A binding segment is drawn between <aPntAttach> //! A binding segment is drawn between <aPntAttach>
//! ( which belongs the the fix object) and <aPntEnd>. //! ( which belongs to the fixed object) and <aPntEnd>.
//! aSymbSize is the size of the 'fix'symbol //! aSymbSize is the size of the 'fix'symbol
Standard_EXPORT static void Add (const Handle(Prs3d_Presentation)& aPresentation, const Handle(Prs3d_Drawer)& aDrawer, const gp_Pnt& aPntAttach, const gp_Pnt& aPntEnd, const gp_Dir& aNormPln, const Standard_Real aSymbSize); Standard_EXPORT static void Add (const Handle(Prs3d_Presentation)& aPresentation, const Handle(Prs3d_Drawer)& aDrawer, const gp_Pnt& aPntAttach, const gp_Pnt& aPntEnd, const gp_Dir& aNormPln, const Standard_Real aSymbSize);

View File

@ -45,7 +45,7 @@ public:
//! defined by the attribute manager aDrawer. //! defined by the attribute manager aDrawer.
Standard_EXPORT static void Add (const Handle(Prs3d_Presentation)& aPresentation, const Handle(Prs3d_Drawer)& aDrawer, const TCollection_ExtendedString& aText, const gp_Pnt& AttachmentPoint1, const gp_Pnt& AttachmentPoint2, const gp_Dir& aDirection, const gp_Dir& aDirection2, const gp_Pnt& OffsetPoint); Standard_EXPORT static void Add (const Handle(Prs3d_Presentation)& aPresentation, const Handle(Prs3d_Drawer)& aDrawer, const TCollection_ExtendedString& aText, const gp_Pnt& AttachmentPoint1, const gp_Pnt& AttachmentPoint2, const gp_Dir& aDirection, const gp_Dir& aDirection2, const gp_Pnt& OffsetPoint);
//! draws the representation of axes alignement Constraint //! draws the representation of axes alignment Constraint
//! between the point AttachmentPoint1 and the //! between the point AttachmentPoint1 and the
//! point AttachmentPoint2, along direction //! point AttachmentPoint2, along direction
//! aDirection, using the offset point OffsetPoint. //! aDirection, using the offset point OffsetPoint.

View File

@ -75,13 +75,13 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
gp_Pnt P1,P2; gp_Pnt P1,P2;
//=================================== //======================================
// SYMETRY OF EDGE PERPEND. TO THE AXIS // SYMMETRY OF EDGE PERPEND. TO THE AXIS
// ____ : ____ // ____ : ____
// edge2 | : -=- | edge 1 // edge2 | : -=- | edge 1
// |<------:------>| // |<------:------>|
// : // :
//=================================== //======================================
if (VLa.Dot(VL1) == 0) { if (VLa.Dot(VL1) == 0) {
P1 = AttachmentPoint1.Translated(VLa); P1 = AttachmentPoint1.Translated(VLa);
@ -124,7 +124,7 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
/*======================================================= /*=======================================================
TO AVOID CROSSING TO AVOID CROSSING
P1 -=- P2 P2 -=- P1 P1 -=- P2 P2 -=- P1
\<-->/ |<-->| \<-->/ |<-->|
\ / | | \ / | |
\/ | | \/ | |
@ -143,13 +143,13 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
PntTempo = P1; PntTempo = P1;
P1 = P2; P1 = P2;
P2 = PntTempo; P2 = PntTempo;
} }
/*=================================== /*===================================
FRACTURES OF TRAITS OF CALL FRACTURES OF TRAITS OF CALL
/ \ / \
/ \ / \
| -=- | | -=- |
|<------------->| |<------------->|
===================================*/ ===================================*/
gp_Vec Vfix; gp_Vec Vfix;
@ -226,7 +226,7 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
} }
/*=================================== /*===================================
FRACTURES OF PROCESSING OF CALL FRACTURES OF PROCESSING OF CALL
-=- -=-
|<--------->| |<--------->|
| | | |
@ -395,8 +395,8 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed()))); aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
/*-------------------------------------------------------------------------------------- /*--------------------------------------------------------------------------------------
| MARKING OF THE SYMMETRY AXIS | | MARKING OF THE SYMMETRY AXIS |
-------------------------------------------------------------------------------------- ----------------------------------------------------------------------------------------
____ ____
\ / :Cursor \ / :Cursor
\/ \/
@ -634,7 +634,7 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
/*-------------------------------------------------------------------------------------- /*--------------------------------------------------------------------------------------
| MARKING OF THE AXIS OF SYMMETRY | | MARKING OF THE AXIS OF SYMMETRY |
-------------------------------------------------------------------------------------- --------------------------------------------------------------------------------------
____ ____
\ / :Cursor \ / :Cursor
\/ \/
@ -706,11 +706,11 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
aPrims->AddVertex(OffsetPoint); aPrims->AddVertex(OffsetPoint);
//-------------------------------------------------------------------------------------- //--------------------------------------------------------------------------------------
//| SYMBOL OF SYMMETRY | //| SYMBOL OF SYMMETRY |
//-------------------------------------------------------------------------------------- //--------------------------------------------------------------------------------------
// ------- : Superior Segment // ------- : Superior Segment
// ----------- : Axis // ----------- : Axis
// ------- : Inferior Segment // ------- : Inferior Segment
//Calculate extremas of the axis of the symbol //Calculate extremas of the axis of the symbol
gp_Vec VAO (AttachmentPoint1,OffsetPoint); gp_Vec VAO (AttachmentPoint1,OffsetPoint);
@ -824,7 +824,7 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
//| SYMBOL OF SYMMETRY | //| SYMBOL OF SYMMETRY |
//------------------------------------------------------------------------------------- //-------------------------------------------------------------------------------------
// ------- : Superior Segment // ------- : Superior Segment
// ----------- : Axis // ----------- : Axis
// ------- : Inferior Segment // ------- : Inferior Segment
@ -866,8 +866,8 @@ void DsgPrs_SymmetricPresentation::Add (const Handle(Prs3d_Presentation)& aPrese
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed()))); aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
/*-------------------------------------------------------------------------------------- /*--------------------------------------------------------------------------------------
| MARKING OF THE AXIS OF SYMMETRY | | MARKING OF THE AXIS OF SYMMETRY |
-------------------------------------------------------------------------------------- ----------------------------------------------------------------------------------------
____ ____
\ / :Cursor \ / :Cursor
\/ \/

View File

@ -153,7 +153,7 @@ public:
//! Surface evaluation //! Surface evaluation
//! The following functions compute the point and the //! The following functions compute the point and the
//! derivatives on elementary surfaces defined with their //! derivatives on elementary surfaces defined with their
//! geometric characterisitics. //! geometric characteristics.
//! You don't need to create the surface to use these functions. //! You don't need to create the surface to use these functions.
//! These functions are called by the previous ones. //! These functions are called by the previous ones.
//! Example : //! Example :

View File

@ -67,7 +67,7 @@ public:
//! Tests if <me> contains <exp>. //! Tests if <me> contains <exp>.
Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE; Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me>. //! Replaces all occurrences of <var> with <with> in <me>.
//! Raises InvalidOperand if <with> contains <me>. //! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;

View File

@ -94,7 +94,7 @@ public:
//! Raise OutOfRange if N <= 0 //! Raise OutOfRange if N <= 0
Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const; Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const;
//! Replaces all occurences of <var> with copies of <with> //! Replaces all occurrences of <var> with copies of <with>
//! in <me>. Copies of <with> are made with the Copy() method. //! in <me>. Copies of <with> are made with the Copy() method.
//! Raises InvalidOperand if <with> contains <me>. //! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT virtual void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) = 0; Standard_EXPORT virtual void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) = 0;

View File

@ -74,7 +74,7 @@ public:
//! Tests if <exp> contains <var>. //! Tests if <exp> contains <var>.
Standard_EXPORT virtual Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const = 0; Standard_EXPORT virtual Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const = 0;
//! Replaces all occurences of <var> with <with> in <me>. //! Replaces all occurrences of <var> with <with> in <me>.
Standard_EXPORT virtual void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) = 0; Standard_EXPORT virtual void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) = 0;
//! returns a string representing <me> in a readable way. //! returns a string representing <me> in a readable way.

View File

@ -84,7 +84,7 @@ public:
//! Raises OutOfRange if <N> <= 0 //! Raises OutOfRange if <N> <= 0
Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const Standard_OVERRIDE; Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me> //! Replaces all occurrences of <var> with <with> in <me>
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
//! Returns the value of <me> (as a Real) by //! Returns the value of <me> (as a Real) by

View File

@ -60,7 +60,7 @@ public:
//! Raises exception if <exp> refers to <me>. //! Raises exception if <exp> refers to <me>.
Standard_EXPORT void Assign (const Handle(Expr_GeneralExpression)& exp); Standard_EXPORT void Assign (const Handle(Expr_GeneralExpression)& exp);
//! Supresses the assigned expression //! Suppresses the assigned expression
void Deassign(); void Deassign();
//! Returns the number of sub-expressions contained //! Returns the number of sub-expressions contained
@ -94,7 +94,7 @@ public:
//! Returns the derivative on <X> unknown of <me> //! Returns the derivative on <X> unknown of <me>
Standard_EXPORT Handle(Expr_GeneralExpression) Derivative (const Handle(Expr_NamedUnknown)& X) const Standard_OVERRIDE; Standard_EXPORT Handle(Expr_GeneralExpression) Derivative (const Handle(Expr_NamedUnknown)& X) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me> //! Replaces all occurrences of <var> with <with> in <me>
//! Raises InvalidOperand if <with> contains <me>. //! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;

View File

@ -89,7 +89,7 @@ public:
//! Raises OutOfRange if <N> <= 0 //! Raises OutOfRange if <N> <= 0
Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const Standard_OVERRIDE; Standard_EXPORT virtual Handle(Expr_GeneralExpression) NDerivative (const Handle(Expr_NamedUnknown)& X, const Standard_Integer N) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me> //! Replaces all occurrences of <var> with <with> in <me>
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
//! Returns the value of <me> (as a Real) by //! Returns the value of <me> (as a Real) by

View File

@ -67,7 +67,7 @@ public:
//! Tests if <exp> is contained in <me>. //! Tests if <exp> is contained in <me>.
Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE; Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me> //! Replaces all occurrences of <var> with <with> in <me>
//! Raises InvalidOperand if <with> contains <me>. //! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;

View File

@ -195,7 +195,7 @@ Handle(Expr_GeneralExpression) Expr_Product::ShallowSimplified () const
for (i = 1; i <= max ; i++) { for (i = 1; i <= max ; i++) {
op = Operand(i); op = Operand(i);
if (op->IsKind(STANDARD_TYPE(Expr_NumericValue))) { if (op->IsKind(STANDARD_TYPE(Expr_NumericValue))) {
// numeric operands are cumulated separetly // numeric operands are cumulated separately
Handle(Expr_NumericValue) NVop = Handle(Expr_NumericValue)::DownCast(op); Handle(Expr_NumericValue) NVop = Handle(Expr_NumericValue)::DownCast(op);
if (nbvals == 0) { if (nbvals == 0) {
noone = Standard_False; noone = Standard_False;

View File

@ -68,7 +68,7 @@ public:
//! Tests if <me> contains <exp>. //! Tests if <me> contains <exp>.
Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE; Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me>. //! Replaces all occurrences of <var> with <with> in <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;

View File

@ -83,7 +83,7 @@ public:
//! Tests if <me> contains <exp>. //! Tests if <me> contains <exp>.
Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE; Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me>. //! Replaces all occurrences of <var> with <with> in <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
//! returns a string representing <me> in a readable way. //! returns a string representing <me> in a readable way.

View File

@ -61,7 +61,7 @@ public:
//! Tests if <exp> is contained in <me>. //! Tests if <exp> is contained in <me>.
Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE; Standard_EXPORT Standard_Boolean Contains (const Handle(Expr_GeneralExpression)& exp) const Standard_OVERRIDE;
//! Replaces all occurences of <var> with <with> in <me> //! Replaces all occurrences of <var> with <with> in <me>
//! Raises InvalidOperand if <with> contains <me>. //! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE; Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;

View File

@ -30,7 +30,7 @@ class ExprIntrp_GenFct;
DEFINE_STANDARD_HANDLE(ExprIntrp_GenFct, ExprIntrp_Generator) DEFINE_STANDARD_HANDLE(ExprIntrp_GenFct, ExprIntrp_Generator)
//! Implements an interpreter for defining functions. //! Implements an interpreter for defining functions.
//! All its functionnalities can be found in class //! All its functionalities can be found in class
//! GenExp. //! GenExp.
class ExprIntrp_GenFct : public ExprIntrp_Generator class ExprIntrp_GenFct : public ExprIntrp_Generator
{ {

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

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

View File

@ -47,7 +47,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! TolU is used to decide to stop the iterations. //! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is: //! At the nth iteration, the criteria is:
@ -58,7 +58,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! Zeros are searched between Umin et Usup. //! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations. //! TolU is used to decide to stop the iterations.

View File

@ -47,7 +47,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! TolU is used to decide to stop the iterations. //! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is: //! At the nth iteration, the criteria is:
@ -58,7 +58,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! Zeros are searched between Umin et Usup. //! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations. //! TolU is used to decide to stop the iterations.

View File

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

View File

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

View File

@ -58,7 +58,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! TolF is used to decide to stop the iterations. //! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is: //! At the nth iteration, the criteria is:
@ -69,7 +69,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! Zeros are searched between Umin et Usup. //! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations. //! TolF is used to decide to stop the iterations.

View File

@ -58,7 +58,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! TolF is used to decide to stop the iterations. //! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is: //! At the nth iteration, the criteria is:
@ -69,7 +69,7 @@ public:
//! The close point is defined by the parameter value //! The close point is defined by the parameter value
//! U0. //! U0.
//! The function F(u)=distance(P,C(u)) has an extremum //! The function F(u)=distance(P,C(u)) has an extremum
//! when g(u)=dF/du=0. The algorithm searchs a zero //! when g(u)=dF/du=0. The algorithm searches a zero
//! near the close point. //! near the close point.
//! Zeros are searched between Umin et Usup. //! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations. //! TolF is used to decide to stop the iterations.

View File

@ -67,7 +67,7 @@ public:
//! Save the found extremum. //! Save the found extremum.
Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE; Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE;
//! Return the nunber of found extrema. //! Return the number of found extrema.
Standard_EXPORT Standard_Integer NbExt() const; Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the Nth distance. //! Returns the Nth distance.

View File

@ -67,7 +67,7 @@ public:
//! Save the found extremum. //! Save the found extremum.
Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE; Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE;
//! Return the nunber of found extrema. //! Return the number of found extrema.
Standard_EXPORT Standard_Integer NbExt() const; Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the Nth distance. //! Returns the Nth distance.

View File

@ -67,7 +67,7 @@ public:
//! Save the found extremum. //! Save the found extremum.
Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE; Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE;
//! Return the nunber of found extrema. //! Return the number of found extrema.
Standard_EXPORT Standard_Integer NbExt() const; Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the Nth distance. //! Returns the Nth distance.

View File

@ -67,7 +67,7 @@ public:
//! Save the found extremum. //! Save the found extremum.
Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE; Standard_EXPORT virtual Standard_Integer GetStateNumber() Standard_OVERRIDE;
//! Return the nunber of found extrema. //! Return the number of found extrema.
Standard_EXPORT Standard_Integer NbExt() const; Standard_EXPORT Standard_Integer NbExt() const;
//! Returns the Nth distance. //! Returns the Nth distance.

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