//! To facilitate management, each object and each construction element has a selection 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.
-//! 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.
//! The standard filters supplied in AIS include:
//! - AIS_AttributeFilter
/* PATJAC: Table of coeff. of square of approximation with */
/* constraints of order IORDRU by U and IORDRV by V. */
/* 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 : */
/* ------------------- */
-/* 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 */
/* THEN the already calculated error. */
/* constraints of order IORDRU by U and IORDRV by V. */
/* EPMSCUT: Tolerance of approximation. */
/* VECERR: Auxiliary vector. */
-/* ERREUR: MAX Error commited ALREADY CALCULATED */
+/* ERREUR: MAX Error committed ALREADY CALCULATED */
/* 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 */
/* PLUS the already calculated error. */
/* NEWDGU: Min. Degree by U such as the square of approximation */
/* 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. */
/* COMMONS USED : */
Translation.SetXYZ
(myFunc->BarycentreOfSurf().XYZ());
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);
Tol *= Wmin(ii); //Factor of projection
ThreeDTol->SetValue(ii, Max(Tol, 1.e-20) );
#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 class BOPDS_Interf is root class
*
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 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 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 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.
*/
//=======================================================================
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.
*/
//=======================================================================
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 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 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 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 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.
*/
//=======================================================================
//! Query
//! Returns true if there is flag.
- //! Returns the the flag theFlag
+ //! Returns the flag theFlag
Standard_Boolean HasFlag (Standard_Integer& theFlag) const;
if (GC->IsCurve3D()) {
// 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
// compare first and last parameters with default values.
GC->Range(f, l);
if (GC->IsCurve3D()) {
// 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
// compare first and last parameters with default values.
GC->Range(f, l);
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>.
Standard_EXPORT BRepAdaptor_CompCurve(const TopoDS_Wire& W, const Standard_Boolean KnotByCurvilinearAbcissa, const Standard_Real First, const Standard_Real Last, const Standard_Real Tol);
//! Creates an undefined Curve with no Edge loaded.
Standard_EXPORT BRepAdaptor_Curve();
- //! Creates a Curve to acces to the geometry of edge
+ //! Creates a Curve to access the geometry of 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
//! parametric curve of <E> on the face <F>. An Error
//! is raised if the edge does not have a pcurve on
//! Reset currently loaded curve (undone Load()).
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>.
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
//! parametric curve of <E> on the face <F>. An Error
//! is raised if the edge does not have a pcurve on
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.
//! <Proj> is used to update pcurves on edges if necessary.
//! See Add().
Vec(XInit,Pnt);
}
else {
- // (1.d) Intialisation by linear interpolation
+ // (1.d) Initialisation by linear interpolation
Pnt = myLine->Point(Index);
Vec(X1,Pnt);
t1 = Pnt.Parameter();
MergedWithBound.Contains(iedge));
if (!isRejected) {
if (myBoundSections.IsBound(iedge)) {
- // Edge is splitted - check sections
+ // Edge is split - check sections
TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge));
for (; lit.More() && !isRejected; lit.Next()) {
const TopoDS_Shape& sec = lit.Value();
MergedWithSections.Contains(iedge));
if (!isRejected) {
if (myBoundSections.IsBound(iedge)) {
- // Edge is splitted - check sections
+ // Edge is split - check sections
TopTools_ListIteratorOfListOfShape lit(myBoundSections(iedge));
for (; lit.More() && !isRejected; lit.Next()) {
const TopoDS_Shape& sec = lit.Value();
if (!isMerged && !isMergedSplit) {
// Nothing was merged in this iteration
if (isPrevSplit) {
- // Replace previously splitted bound
+ // Replace previously split bound
myReShape->Replace(myReShape->Apply(bound),myReShape->Apply(BoundWire));
}
// else if (hasCuttingSections) {
// Store bound for section
mySectionBound.Bind(section,bound);
}
- // Store splitted bound
+ // Store split bound
myBoundSections.Bind(bound,listSections);
}
}
//! 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);
//! Set an Frenet or an CorrectedFrenet trihedron
//! Set support to the spine to define the BiNormal
//! at the spine, like the normal the surfaces.
//! 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);
//! Set an auxiliary spine to define the Normal
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
//! compatible. (ie if A is in B, the orientation of A and B
//! has to be different.
const NCollection_List<TColStd_SequenceOfInteger>& theWires,
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);
//! Set messenger for output information
//! Constructs the shell-generating framework defined by the wire Spine.
//! 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);
//! Sets a Frenet or a CorrectedFrenet trihedron
//! Sets support to the spine to define the BiNormal of
//! the trihedron, like the normal to the surfaces.
//! 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);
//! Sets an auxiliary spine to define the Normal
//! Returns the initial face corresponding to the projected edge E.
//! Exceptions
//! 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.
Standard_EXPORT const TopoDS_Shape& Couple (const TopoDS_Edge& E) const;
// - Add the face to an existing 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 map MF we binb the face to its shell.
// In the Map MF the Shell is bound with the relative orientation of F
//! * Knots and multiplicities or "flat knots" without
//! 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
//! of range the correct value will be searched.
//!
//! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move
//! = 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
//! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move
//! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move
//! = 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
//! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move
//! FlatKnots are the knots of the BSpline Starting Condition if =
//! -1 means the starting point of the curve can move
//! = 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
//! = 1 means the starting point and tangents cannot move
//! = 2 means the starting point tangent and curvature cannot move
BVH_Tree<T, N>* theBVH,
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,
BVH_BuildQueue& theBuildQueue,
const Standard_Integer theNode,
// apoint : point through which the bissectrice should pass.
// afirstvector : \ vectors to determine the sector where
// 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
//===========================================================================
Handle(Geom2d_Circle) CC2 = Handle(Geom2d_Circle)::DownCast(basisC2);
ElCLib::D1(param3,CC2->Circ2d(),p,Ve2);
Sens2 = (CC2->Circ2d()).IsDirect();
- } // if if (C2->DynamicType() ...
+ } // if (C2->DynamicType() ...
else {
Handle(Geom2d_Line) CC2 = Handle(Geom2d_Line)::DownCast(basisC2);
ElCLib::D1(param3,CC2->Lin2d(),p,Ve2);
Standard_Boolean& intf,
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();
myDepthFormat = 0;
myDepthStencilTexture->Release (theCtx.get());
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!");
}
}
}
theCommands.Add("numshapes","numshapes s; size of shape",__FILE__,numshapes,g);
theCommands.Add("countshapes","countshapes s; count of shape",__FILE__,countshapes,g);
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);
// theCommands.Add("dumpmmgt",
//! Search in draw directory the framewok identified
//! 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);
//! Search in <DF> the label identified by its entry
//! <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);
//! Search in <DF> the label identified by its entry
//! Search in <DF> the attribute identified by its
//! <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);
//! Safe variant for arbitrary type of argument
//! Returns a string composed with the list of
//! 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
//! DDF_AttributeBrowser.
Standard_EXPORT TCollection_AsciiString OpenAttribute (const Standard_Integer anIndex = 0);
if(!DDF::GetDF(a[1], DF)) return 1;
if (!DDF::FindLabel(DF,a[2],SOURCE)) return 1;
if (DDF::FindLabel(DF,a[3],TARGET)) {
- di << " target label is already setted \n";
+ di << " target label is already set \n";
return 1;
}
DDF::AddLabel(DF,a[3],TARGET);
TDF_Label L;
if (!DDF::FindLabel(DF,arg[2],L)) return 1;
// 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()) {
// TDF_Tool::Entry(it.Value()->Label(),s); std::cout << s << " ";
// std::cout << std::endl;
class DDataStd_DrawPresentation;
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
{
# white : interoperable
# white + c : non interoperable
# X : X Reference
-# Red : not yet commited in transaction #0
+# Red : not yet committed in transaction #0
#
#
$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 "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"
}
theDI << "Storage error: error during writing";
break;
case Storage_VSFormatError:
- theDI << "Storage error: wrong format error occured while reading";
+ theDI << "Storage error: wrong format error occurred while reading";
break;
case Storage_VSUnknownType:
theDI << "Storage error: try to read an unknown type";
}
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()) {
Standard_Boolean aC0 = Standard_False;
TopoDS_Shape anEdge1 = anEx.Current();
//=======================================================================
//function : GetPrevFunction
-//purpose : Returns previus function
+//purpose : Returns previous function
//=======================================================================
Handle(TFunction_Function) DNaming::GetPrevFunction(const Handle(TFunction_Function)& theFunction)
{
TopoDS_Shape S = DBRep::Get(a[2]);
if (S.IsNull()) {
- di <<"Noone shape selected\n";
+ di <<"No shape selected\n";
//di << 0;
return 0;
}
//=======================================================================
//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)
{
if (!DDF::GetDF(a[1],ND)) return 1;
TopoDS_Shape SS = DBRep::Get(a[2]);
if (SS.IsNull()) {
- di <<"Noone shape selected\n";
+ di <<"No shape selected\n";
//di << 0;
return 0;
}
}
//=======================================================================
//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)
{
TopoDS_Shape SS = DBRep::Get(a[2]);
if (SS.IsNull()) {
- di <<"Noone shape selected\n";
+ di <<"No shape selected\n";
//di << 0;
return 0;
}
Handle(TFunction_Function) aCntFun;
if(aCont->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// 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),
aCntFun->Label()); //ref to function produced Context shape
Handle(TFunction_Function) aCntFun;
if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// 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),
aCntFun->Label()); //ref to function produced Context shape
Handle(TFunction_Function) aCntFun;
if(aNS->Label().Father().FindAttribute(TFunction_Function::GetID(), aCntFun)) { //Fun:2 ==> result
// 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),
aCntFun->Label()); //ref to function produced Context shape
Standard_GUID guid;
TCollection_ExtendedString str = arg[3];
#ifdef OCCT_DEBUG
- std::cout << "Inputed parameter > " << str << std::endl;
+ std::cout << "Inputted parameter > " << str << std::endl;
#endif
if ( str == "A" ) //axis
guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333"
else {
TCollection_ExtendedString str = arg[3];
#ifdef OCCT_DEBUG
- std::cout << "Inputed parameter > " << str << std::endl;
+ std::cout << "Inputted parameter > " << str << std::endl;
#endif
if ( str == "A" ) //axis
guid = TDataXtd_Axis::GetID(); //"2a96b601-ec8b-11d0-bee7-080009dc3333"
Standard_EXPORT Draft_ErrorStatus Error() const;
//! Returns the shape (Face, Edge or Vertex) on which
- //! an error occured.
+ //! an error occurred.
Standard_EXPORT const TopoDS_Shape& ProblematicShape() const;
//! Returns all the faces which have been added
//! <Tol> are not significant.
//!
//! <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;
//! Returns Standard_True if the Vertex <V> has a new
//! variable exist.
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);
public: //! @name argument parsing tools
Draw_Chrono = (*a[1] == '1');
if (Draw_Chrono) di << "Chronometers activated.\n";
- else di << "Chronometers desactivated.\n";
+ else di << "Chronometers deactivated.\n";
}
else {
Handle(Draw_Drawable3D) D = Draw::Get(a[1]);
Draw_Chrono = (*a[1] == '1');
if (Draw_Chrono) theDI << "Chronometers activated.\n";
- else theDI << "Chronometers desactivated.\n";
+ else theDI << "Chronometers deactivated.\n";
}
else {
Handle(Draw_Drawable3D) D = Draw::Get(a[1]);
//! display is drawing.
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
//! Drawing should be resumed.
//!
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;
//! For variable copy.
// commercial license or contractual agreement.
// 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
// the following line should be added:
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 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;
class Draw_Number;
DEFINE_STANDARD_HANDLE(Draw_Number, Draw_Drawable3D)
-//! To store nummbers in variables.
+//! To store numbers in variables.
class Draw_Number : public Draw_Drawable3D
{
static Standard_Boolean repaint2d,repaint3d;
//===============================================
-// dictionnary of variables
+// dictionary of variables
// Variables are stored in a map Integer, Transient
// The Integer Value is the content of the TCl variable
//===============================================
//======================================================
-// funtion : ProcessEvents
-// purpose : process pending X events
+// function : ProcessEvents
+// purpose : process pending X events
//======================================================
static void ProcessEvents(ClientData,int)
}
//======================================================
-// funtion : GetNextEvent()
+// function : GetNextEvent()
// purpose :
//======================================================
void GetNextEvent(Event& ev)
#endif //__APPLE__
//======================================================
-// funtion :Run_Appli
+// function :Run_Appli
// purpose :
//======================================================
}
//======================================================
-// funtion : Init_Appli()
-// purpose :
+// function : Init_Appli()
+// purpose :
//======================================================
Standard_Boolean Init_Appli()
{
}
//======================================================
-// funtion : Destroy_Appli()
-// purpose :
+// function : Destroy_Appli()
+// purpose :
//======================================================
void Destroy_Appli()
{
CreatePen(PS_SOLID, PENWIDTH, RGB(240,230,140)),
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,
R2_MASKNOTPEN, R2_NOP, R2_XORPEN, R2_MERGEPEN,
R2_NOTMASKPEN, R2_NOTXORPEN, R2_NOT, R2_MERGEPENNOT,
/**
* 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.
*/
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);
};
//======================================================
-// funtion : Run_Appli
+// function : Run_Appli
// purpose : run the application
// interp will be called to interpret a command
// and return True if the command is complete
void Run_Appli(Standard_Boolean (*inteprete) (const char*));
//======================================================
-// funtion : Init_Appli
+// function : Init_Appli
// purpose :
//======================================================
Standard_Boolean Init_Appli();
//======================================================
-// funtion : Destroy_Appli()
+// function : Destroy_Appli()
// purpose :
//======================================================
void Destroy_Appli();
//======================================================
-// funtion : GetNextEvent()
+// function : GetNextEvent()
// purpose :
//======================================================
void GetNextEvent(Event&);
/**
* 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.
*/
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);
};
//======================================================
-// funtion : Run_Appli
+// function : Run_Appli
// purpose : run the application
// interp will be called to interpret a command
// and return True if the command is complete
void Run_Appli(Standard_Boolean (*inteprete) (const char*));
//======================================================
-// funtion : Init_Appli
+// function : Init_Appli
// purpose :
//======================================================
Standard_Boolean Init_Appli();
//======================================================
-// funtion : Destroy_Appli()
+// function : Destroy_Appli()
// purpose :
//======================================================
void Destroy_Appli();
//======================================================
-// funtion : GetNextEvent()
+// function : GetNextEvent()
// purpose :
//======================================================
void GetNextEvent (Standard_Boolean theWait,
/**
* 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.
*/
Standard_EXPORT static void AddCallbackBeforeTerminate(FCallbackBeforeTerminate theCB);
############################################################################
# This file defines scripts for verification of OCCT tests.
# 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.
#
# Note: procedures with names starting with underscore are for internal use
the same sub-shapes with different location as different sub-shapes.
-m msg: print "msg" in case of error
-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} {
puts "checknbshapes ${shape} ${args}"
}
foreach item ${local_ref} {
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
}
lappend ref_values $res
# get reference values from -ref option
if { "${ref_info}" != ""} {
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"
}
}
Use: checkplatform [options...]
Allowed options are:
- -windows : return 1 if current platform is 'Windows', overwise return 0
- -linux : return 1 if current platform is 'Linux', overwise return 0
- -osx : return 1 if current platform is 'MacOS X', overwise return 0
+ -windows : return 1 if current platform is 'Windows', otherwise return 0
+ -linux : return 1 if current platform is 'Linux', otherwise return 0
+ -osx : return 1 if current platform is 'MacOS X', otherwise return 0
Only one option can be used at once.
If no option is given, procedure will return the name of current platform.
# This file defines scripts for execution of OCCT tests.
# It should be loaded automatically when DRAW is started, and provides
# 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.
#
# Note: procedures with names starting with underscore are for internal use
# white : interoperable
# white + c : non interoperable
# X : X Reference
-# Red : not yet commited in transaction #0
+# Red : not yet committed in transaction #0
#
#
marker of the point\n\n").Cat(MarkersHint).ToCString(),
__FILE__,changepointmarker,g);
- g = "Geometric tranformations";
+ g = "Geometric transformations";
theCommands.Add("translate",
"translate name [names...] dx dy dz",
gp_Pnt P1 = ElCLib::Value(0., 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 Normal = mkPln.Value().Axis().Direction();
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
Vec.Scale(2.);
aPnt.Translate(Vec);
DEFINE_STANDARD_ALLOC
//! 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.
//! The thihedron origin and axis directions are defined by theDatum coordinate system.
//! DsgPrs_XYZAxisPresentation framework is used to create graphical primitives for each axis.
//! draws the presentation of fixed objects by
//! drawing the 'fix' symbol at position <aPntEnd>.
//! A binding segment is drawn between <aPntAttach>
- //! ( which belongs t
he the fix object) and <aPntEnd>.
+ //! ( which belongs t
o the fixed object) and <aPntEnd>.
//! 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);
//! 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);
- //! draws the representation of axes alignement Constraint
+ //! draws the representation of axes alignment Constraint
//! between the point AttachmentPoint1 and the
//! point AttachmentPoint2, along direction
//! aDirection, using the offset point OffsetPoint.
gp_Pnt P1,P2;
- //===================================
- // SYMETRY OF EDGE PERPEND. TO THE AXIS
+ //======================================
+ // SYMMETRY OF EDGE PERPEND. TO THE AXIS
// ____ : ____
// edge2 | : -=- | edge 1
// |<------:------>|
// :
- //===================================
+ //======================================
if (VLa.Dot(VL1) == 0) {
P1 = AttachmentPoint1.Translated(VLa);
/*=======================================================
TO AVOID CROSSING
- P1 -=- P2 P2 -=- P1
+ P1 -=- P2 P2 -=- P1
\<-->/ |<-->|
\ / | |
\/ | |
PntTempo = P1;
P1 = P2;
P2 = PntTempo;
- }
+ }
/*===================================
- FRACTURES OF TRAITS OF CALL
+ FRACTURES OF TRAITS OF CALL
/ \
/ \
| -=- |
- |<------------->|
+ |<------------->|
===================================*/
gp_Vec Vfix;
}
/*===================================
- FRACTURES OF PROCESSING OF CALL
+ FRACTURES OF PROCESSING OF CALL
-=-
|<--------->|
| |
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
/*--------------------------------------------------------------------------------------
- | MARKING OF THE SYMMETRY AXIS |
- --------------------------------------------------------------------------------------
+ | MARKING OF THE SYMMETRY AXIS |
+ ----------------------------------------------------------------------------------------
____
\ / :Cursor
\/
/*--------------------------------------------------------------------------------------
| MARKING OF THE AXIS OF SYMMETRY |
- --------------------------------------------------------------------------------------
+ --------------------------------------------------------------------------------------
____
\ / :Cursor
\/
aPrims->AddVertex(OffsetPoint);
//--------------------------------------------------------------------------------------
- //| SYMBOL OF SYMMETRY |
+ //| SYMBOL OF SYMMETRY |
//--------------------------------------------------------------------------------------
- // ------- : Superior Segment
+ // ------- : Superior Segment
// ----------- : Axis
- // ------- : Inferior Segment
+ // ------- : Inferior Segment
//Calculate extremas of the axis of the symbol
gp_Vec VAO (AttachmentPoint1,OffsetPoint);
//| SYMBOL OF SYMMETRY |
//-------------------------------------------------------------------------------------
- // ------- : Superior Segment
+ // ------- : Superior Segment
// ----------- : Axis
// ------- : Inferior Segment
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
/*--------------------------------------------------------------------------------------
- | MARKING OF THE AXIS OF SYMMETRY |
- --------------------------------------------------------------------------------------
+ | MARKING OF THE AXIS OF SYMMETRY |
+ ----------------------------------------------------------------------------------------
____
\ / :Cursor
\/
//! Surface evaluation
//! The following functions compute the point and the
//! derivatives on elementary surfaces defined with their
- //! geometric characterisitics.
+ //! geometric characteristics.
//! You don't need to create the surface to use these functions.
//! These functions are called by the previous ones.
//! Example :
//! Tests if <me> contains <exp>.
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>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
//! Raise OutOfRange if N <= 0
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.
//! Raises InvalidOperand if <with> contains <me>.
Standard_EXPORT virtual void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) = 0;
//! Tests if <exp> contains <var>.
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;
//! returns a string representing <me> in a readable way.
//! Raises OutOfRange if <N> <= 0
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;
//! Returns the value of <me> (as a Real) by
//! Raises exception if <exp> refers to <me>.
Standard_EXPORT void Assign (const Handle(Expr_GeneralExpression)& exp);
- //! Supresses the assigned expression
+ //! Suppresses the assigned expression
void Deassign();
//! Returns the number of sub-expressions contained
//! Returns the derivative on <X> unknown of <me>
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>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
//! Raises OutOfRange if <N> <= 0
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;
//! Returns the value of <me> (as a Real) by
//! Tests if <exp> is contained in <me>.
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>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
for (i = 1; i <= max ; i++) {
op = Operand(i);
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);
if (nbvals == 0) {
noone = Standard_False;
//! Tests if <me> contains <exp>.
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;
//! Tests if <me> contains <exp>.
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;
//! returns a string representing <me> in a readable way.
//! Tests if <exp> is contained in <me>.
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>.
Standard_EXPORT void Replace (const Handle(Expr_NamedUnknown)& var, const Handle(Expr_GeneralExpression)& with) Standard_OVERRIDE;
DEFINE_STANDARD_HANDLE(ExprIntrp_GenFct, ExprIntrp_Generator)
//! Implements an interpreter for defining functions.
-//! All its functionnalities can be found in class
+//! All its functionalities can be found in class
//! GenExp.
class ExprIntrp_GenFct : public ExprIntrp_Generator
{
//! It calculates all the distances.
//! 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 are searched between uinf and usup.
//! Tol is used to decide to stop the
//! It calculates all the distances.
//! 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.
//! Tol is used to decide to stop the
//! iterations according to the following condition:
//! It calculates all the distances.
//! 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 are searched between uinf and usup.
//! Tol is used to decide to stop the
//! It calculates all the distances.
//! 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.
//! Tol is used to decide to stop the
//! iterations according to the following condition:
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
//! It calculates all the distances.
//! 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.
//! NbU is used to locate the close points to
//! find the zeros.
Standard_EXPORT Extrema_ExtElC(const gp_Lin& C1, const gp_Circ& C2, const Standard_Real Tol);
//! Calculates the distance between a line and an
- //! elipse.
+ //! ellipse.
Standard_EXPORT Extrema_ExtElC(const gp_Lin& C1, const gp_Elips& C2);
//! Calculates the distance between a line and a
Standard_EXPORT Extrema_ExtElC2d(const gp_Lin2d& C1, const gp_Circ2d& C2, const Standard_Real Tol);
//! Calculates the distance between a line and an
- //! elipse.
+ //! ellipse.
Standard_EXPORT Extrema_ExtElC2d(const gp_Lin2d& C1, const gp_Elips2d& C2);
//! Calculates the distance between a line and a
Standard_EXPORT Extrema_ExtElC2d(const gp_Circ2d& C1, const gp_Circ2d& C2);
//! Calculates the distance between a circle and an
- //! elipse.
+ //! ellipse.
Standard_EXPORT Extrema_ExtElC2d(const gp_Circ2d& C1, const gp_Elips2d& C2);
//! Calculates the distance between a circle and a
//! It calculates all the distances.
//! 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 are searched between uinf and usup.
//! Tol is used to decide to stop the
//! It calculates all the distances.
//! 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.
//! Tol is used to decide to stop the
//! iterations according to the following condition:
//! It calculates all the distances.
//! 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 are searched between uinf and usup.
//! Tol is used to decide to stop the
//! It calculates all the distances.
//! 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.
//! Tol is used to decide to stop the
//! iterations according to the following condition:
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
- //! 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
- //! 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 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.
//! The conditions on the Uinf and Usup are:
//! 0. <= Uinf <= 2.*PI and Usup > Uinf.
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
- //! 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
- //! 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 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.
//! The conditions on the Uinf and Usup are:
//! 0. <= Uinf <= 2.*PI and Usup > Uinf.
if (OO.Magnitude() <= gp::Resolution()) {
OO = gp_Vec(L.Location(), ElCLib::Value(100,L));
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;
}
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;
Standard_Real tmin = 0., distmin = RealLast();
Standard_Real aMin1 = 0., aMin2 = 0.;
//! It calculates all the distances.
//! 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
//! surfaces.
//! NbU and NbV are used to locate the close points on the
//! It calculates all the distances.
//! 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
//! surface.
//! NbT,NbU and NbV are used to locate the close points
//! It calculates all the distances.
//! 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
//! surface.
//! NbU and NbV are used to locate the close points
//! It calculates all the distances.
//! 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
//! surface.
//! NbU and NbV are used to locate the close points
//! It calculates all the distances.
//! 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
//! surfaces.
//! NbU and NbV are used to locate the close points
//! It calculates all the distances.
//! 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
//! surface.
//! NbU and NbV are used to locate the close points
//! The close points are defined by the parameter values
//! T for C and (U,V) for S.
//! 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.
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);
//! The close points are defined by the parameter values
//! (U1,V1) for S1 and (U2,V2) for S2.
//! 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.
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);
//! close point is defined by a parameter value on each
//! curve.
//! 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.
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);
//! close point is defined by a parameter value on each
//! curve.
//! 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.
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);
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations.
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations.
//! close point is defined by a parameter value on each
//! curve.
//! 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.
Standard_EXPORT Extrema_LocateExtCC(const Adaptor3d_Curve& C1, const Adaptor3d_Curve& C2, const Standard_Real U0, const Standard_Real V0);
//! close point is defined by a parameter value on each
//! curve.
//! 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.
Standard_EXPORT Extrema_LocateExtCC2d(const Adaptor2d_Curve2d& C1, const Adaptor2d_Curve2d& C2, const Standard_Real U0, const Standard_Real V0);
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations.
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! TolF is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! Zeros are searched between Umin et Usup.
//! TolF is used to decide to stop the iterations.
//! Save the found extremum.
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;
//! Returns the Nth distance.
//! Save the found extremum.
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;
//! Returns the Nth distance.
//! Save the found extremum.
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;
//! Returns the Nth distance.
//! Save the found extremum.
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;
//! Returns the Nth distance.
//! Save the found extremum.
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;
//! Returns the Nth distance.
//! Save the found extremum.
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;
//! Returns the Nth distance.
Angle1 = Ox.Angle(P1P2) + Alph1;
Angle2 = -Ox.Angle(P1P2) + Alph2;
-// Calculation of the length of sliding (imposed or intial);
+// Calculation of the length of sliding (imposed or initial);
if (!NewFreeSliding) {
SlidingLength = NewSlidingFactor * LReference;
// on the edge of the corresponding support face.
// OneExtremityOnEdge: only one of the extremities of start section of the Fillet
// is on the edge of the corresponding support face.
-// NoExtremityOnEdge: any extremity of the start section ofthe fillet is on
+// NoExtremityOnEdge: any extremity of the start section of the fillet is on
// the edge of the corresponding support face.
//=======================================================================
FilletSurf_StatusType FilletSurf_Builder::StartSectionStatus() const
Standard_Integer aPathNumber = 1;
do
{
- // Getting directory paths, which can be splitted by "," or ":"
+ // Getting directory paths, which can be split by "," or ":"
aFontPath = aStr.Token (":,", aPathNumber);
aFontPath.RightAdjust();
if (!aFontPath.IsEmpty())
if (aSupportedExtensions.Contains (aFontExtension) && (aLine.Search (anEncoding) > 0))
{
// In current implementation use fonts with ISO-8859-1 coding page.
- // OCCT not give to manage coding page by means of programm interface.
+ // OCCT not give to manage coding page by means of program interface.
// TODO: make high level interface for choosing necessary coding page.
TCollection_AsciiString aXLFD (aLine.SubString (anEndOfFileName + 2, aLine.Length()));
TCollection_AsciiString aFontPath (anIter.Value().ToCString());
Standard_EXPORT GC_MakeMirror(const gp_Lin& Line);
- //! Make a symetry transformation af axis defined by
+ //! Make a symmetry transformation af axis defined by
//! <Point> and <Direc>.
Standard_EXPORT GC_MakeMirror(const gp_Pnt& Point, const gp_Dir& Direc);
- //! Make a symetry transformation of plane <Plane>.
+ //! Make a sym
metry transformation of plane <Plane>.
Standard_EXPORT GC_MakeMirror(const gp_Pln& Plane);
- //! Make a symetry transformation of plane <Plane>.
+ //! Make a sym
metry transformation of plane <Plane>.
Standard_EXPORT GC_MakeMirror(const gp_Ax2& Plane);
//! Returns the constructed transformation.
//! In the first case the result is at the distance
//! <Dist> to the plane <Pln> in the direction of the
//! normal to <Pln>.
- //! Otherwise it is in the oposite direction.
+ //! Otherwise it is in the opposite direction.
Standard_EXPORT GC_MakePlane(const gp_Pln& Pln, const Standard_Real Dist);
//! Make a Plane from Geom <ThePlane> passing through 3
//! Make a cylindricalSurface <Cyl> from Geom
- //! Its axis is
is <P1P2> and its radius is the distance
+ //! Its axis is <P1P2> and its radius is the distance
//! between <P3> and <P1P2>.
//! The height is the distance between P1 and P2.
Standard_EXPORT GC_MakeTrimmedCylinder(const gp_Pnt& P1, const gp_Pnt& P2, const gp_Pnt& P3);
Standard_EXPORT GCE2d_MakeMirror(const gp_Lin2d& Line);
- //! Make a symetry transformation af axis defined by
+ //! Make a symmetry transformation af axis defined by
//! <Point> and <Direc>.
Standard_EXPORT GCE2d_MakeMirror(const gp_Pnt2d& Point, const gp_Dir2d& Direc);
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
-// Dimension independant used to implement GCPnts_AbscissaPoint
+// Dimension independent used to implement GCPnts_AbscissaPoint
// compute the type
// and the length ratio if GCPnts_LengthParametrized
}
// introduced by rbv for curvilinear parametrization
-// performs more appropriate tolerance managment
+// performs more appropriate tolerance management
static void AdvCompute(CPnts_AbscissaPoint& theComputer,
const TheCurve& C,
parameters.InsertAfter(i, umax);
points.InsertAfter(i, MiddlePoint);
++Nbp;
- --i; //To compensate ++i in loop header: i must point to first part of splitted interval
+ --i; //To compensate ++i in loop header: i must point to first part of split interval
if(Nbp > MaxNbp)
{
break;
//
// compute the total Length here so that we can
// guess the number of points instead of letting the
-// constructor of CPnts_AbscissaPoint do that and loosing
+// constructor of CPnts_AbscissaPoint do that and lose
// the information
//
//
//
// compute the total Length here so that we can
// guess the number of points instead of letting the
-// constructor of CPnts_AbscissaPoint do that and loosing
+// constructor of CPnts_AbscissaPoint do that and lose
// the information
//
//
-//! This package defines algorithmes to compute the global properties
+//! This package defines algorithms to compute the global properties
//! of a set of points, a curve, a surface, a solid (non infinite
//! region of space delimited with geometric entities), a compound
//! geometric system (heterogeneous composition of the previous
//! returns true if the geometric system has an axis of symmetry.
- //! aTol is relative tolerance for cheking equality of moments
+ //! aTol is relative tolerance for checking equality of moments
//! If aTol == 0, relative tolerance is ~ 1.e-16 (Epsilon(I))
Standard_EXPORT Standard_Boolean HasSymmetryAxis (const Standard_Real aTol) const;
//! returns true if the geometric system has a point of symmetry.
- //! aTol is relative tolerance for cheking equality of moments
+ //! aTol is relative tolerance for checking equality of moments
//! If aTol == 0, relative tolerance is ~ 1.e-16 (Epsilon(I))
Standard_EXPORT Standard_Boolean HasSymmetryPoint (const Standard_Real aTol) const;
// 7) < (X - X2)2 + (Y - Y2)2 = (R + R2)2 8) < (X - X2)2 + (Y - Y2)2 = (R + R2)2
// \_(X - X3)2 + (Y - Y3)2 = (R + R3)2 \_(X - X3)2 + (Y - Y3)2 = (R + R3)2
-// each equation (X - Xi)2 + (Y - Yi)2 = (R +- Ri)2 means that the circle (X,Y,R) is tangent
+// each equation (X - Xi)2 + (Y - Yi)2 = (R +- Ri)2 means that the circle (X,Y,R) is tangent
// to the circle (Xi,Yi,Ri).
-// The number of each system is very important. Further index i shows the numer of the system
+// The number of each system is very important.
+// Further index i shows the number of the system.
// Further Beta, Gamma and Delta are coefficients of the equation:
// R +- Ri = Beta*X + Gamma*Y + Delta where i=2 or i=3
//! If we do not use Tolerance it is impossible to find
//! a solution in the following case : C2 is inside C1
//! and there is no intersection point between the two
-//! circles, and C3 is completly outside C1.
+//! circles, and C3 is completely outside C1.
//! With Tolerance we will find a solution if the
//! lowest distance between C1 and C2 is lower than or
//! equal Tolerance.
//! This method implements the algorithms used to
//! create 2d circles tangent to a circle and passing
- //! thrue 2 Points.
+ //! through 2 Points.
//! ConstructionError is raised if there is a problem during
//! the computation.
Standard_EXPORT GccAna_Circ2d3Tan(const GccEnt_QualifiedCirc& Qualified1, const gp_Pnt2d& Point2, const gp_Pnt2d& Point3, const Standard_Real Tolerance);
//! This method implements the algorithms used to
//! create 2d circles tangent to a line and passing
- //! thrue 2 Points.
+ //! through 2 Points.
//! ConstructionError is raised if there is a problem during
//! the computation.
Standard_EXPORT GccAna_Circ2d3Tan(const GccEnt_QualifiedLin& Qualified1, const gp_Pnt2d& Point2, const gp_Pnt2d& Point3, const Standard_Real Tolerance);
//! This method implements the algorithms used to
- //! create 2d circles passing thrue 3 Points.
+ //! create 2d circles passing through 3 Points.
//! ConstructionError is raised if there is a problem during
//! the computation.
Standard_EXPORT GccAna_Circ2d3Tan(const gp_Pnt2d& Point1, const gp_Pnt2d& Point2, const gp_Pnt2d& Point3, const Standard_Real Tolerance);
//=========================================================================
// Initialization of fields : +
-// - circle1 (Circle : first argument.) +
-// - circle2 (Line : second argument.) +
-// - intersection (Integer showing the smallest position +
-// of two circles correspondingly to each other.) +
-// - sameradius (Booleen showing if the two circles have +
-// the same radius or not.) +
-// - NbrSol (Integer showing the number of solutions.) +
-// - WellDone (Boolean showing succes or failure of the algo.). +
+// - circle1 (Circle : first argument) +
+// - circle2 (Line : second argument) +
+// - intersection (Integer showing the smallest position of +
+// two circles correspondingly to each other) +
+// - sameradius (Boolean showing if the two circles have +
+// the same radius or not) +
+// - NbrSol (Integer showing the number of solutions) +
+// - WellDone (Boolean showing success or failure of the algo) +
//=========================================================================
WellDone = Standard_False;
//! We want to create a circle tangent to an EnclosedCirc C1
//! with a tolerance Tolerance.
//! If we did not used Tolerance it is impossible to
-//! find a solution in the the following case : Pcenter is
+//! find a solution in the following case : Pcenter is
//! outside C1.
//! With Tolerance we will give a solution if the distance
//! between C1 and Pcenter is lower than or equal Tolerance.
Standard_EXPORT GccAna_Circ2dTanCen(const gp_Lin2d& Linetan, const gp_Pnt2d& Pcenter);
//! This method implements the algorithms used to
- //! create 2d circles passing thrue a point and
+ //! create 2d circles passing through a point and
//! centered on a point.
//! Tolerance is a tolerance criterion used by the algorithm
//! to find a solution when, mathematically, the problem
//! centered on a line OnLine with a radius Radius and with
//! a tolerance Tolerance.
//! If we did not use Tolerance it is impossible to
-//! find a solution in the the following case : OnLine is
+//! find a solution in the following case : OnLine is
//! outside C1. There is no intersection point between C1
//! and OnLine. The distance between the line and the
//! circle is greater than Radius.
//! This methods implements the algorithms used to
- //! create 2d lines passing thrue 2 points.
+ //! create 2d lines passing through 2 points.
//! Tolerance is used because we can't create a line
//! when the distance between the two points is too small.
Standard_EXPORT GccAna_Lin2d2Tan(const gp_Pnt2d& ThePoint1, const gp_Pnt2d& ThePoint2, const Standard_Real Tolerance);
//! This methods implements the algorithms used to
//! create 2d lines tangent to one circle and passing
- //! thrue a point.
+ //! through a point.
//! Exception BadQualifier is raised in the case of
//! EnclosedCirc
//! Tolerance is used because there is no solution
//! solution curv.
//! ParArg is the intrinsic parameter of the point on the
//! argument curv.
- //! ParArg is equal 0 when the solution is passing thrue
+ //! ParArg is equal 0 when the solution is passing through
//! a point. Raises NotDone if the construction algorithm
//! didn't succeed.
//! It raises OutOfRange if Index is greater than the
//! Some Curves such as OffsetCurve can be closed or not. These curves
//! are considered as closed if the distance between the first point
//! and the last point of the curve is lower or equal to the Resolution
- //! from package gp which is a fixed criterion independant of the
+ //! from package gp which is a fixed criterion independent of the
//! application.
Standard_EXPORT virtual Standard_Boolean IsClosed() const = 0;
//! Raised if Row < 1 or Row > 3 or Col < 1 or Col > 4
Standard_Real Value (const Standard_Integer theRow, const Standard_Integer theCol) const { return gpTrsf.Value (theRow, theCol); }
- //! Raised if the the transformation is singular. This means that
+ //! Raised if the transformation is singular. This means that
//! the ScaleFactor is lower or equal to Resolution from
//! package gp.
void Invert() { gpTrsf.Invert(); }
- //! Raised if the the transformation is singular. This means that
+ //! Raised if the transformation is singular. This means that
//! the ScaleFactor is lower or equal to Resolution from
//! package gp.
Standard_NODISCARD Standard_EXPORT Handle(Geom_Transformation) Inverted() const;
//! Some Curves such as OffsetCurve can be closed or not. These curves
//! are considered as closed if the distance between the first point
//! and the last point of the curve is lower or equal to the Resolution
- //! from package gp which is a fixed criterion independant of the
+ //! from package gp which is a fixed criterion independent of the
//! application.
Standard_EXPORT virtual Standard_Boolean IsClosed() const = 0;
//! Computes the inverse of this transformation.
//! and assigns the result to this transformatio
//!
- //! Raised if the the transformation is singular. This means that
+ //! Raised if the transformation is singular. This means that
//! the ScaleFactor is lower or equal to Resolution from
//! package gp.
Standard_EXPORT void Invert();
//! Computes the inverse of this transformation and creates a new one.
- //! Raises ConstructionError if the the transformation is singular. This means that
+ //! Raises ConstructionError if the transformation is singular. This means that
//! the ScaleFactor is lower or equal to Resolution from package gp.
Standard_NODISCARD Standard_EXPORT Handle(Geom2d_Transformation) Inverted() const;
//! inside a curve Cu2 with a radius Radius and a
//! tolerance Tolerance.
//! If we did not used Tolerance it is impossible to
-//! find a solution in the the following case : Cu2 is
+//! find a solution in the following case : Cu2 is
//! inside C1 and there is no intersection point
//! between the two elements.
//! with Tolerance we will give a solution if the
//! We want to create a circle tangent to an EnclosedCurv C1
//! with a tolerance Tolerance.
//! If we did not used Tolerance it is impossible to
-//! find a solution in the the following case : Pcenter is
+//! find a solution in the following case : Pcenter is
//! outside C1.
//! With Tolerance we will give a solution if the distance
//! between C1 and Pcenter is lower than or equal Tolerance/2.
//! centered on a line OnLine with a radius Radius and with
//! a tolerance Tolerance.
//! If we did not used Tolerance it is impossible to
-//! find a solution in the the following case : OnLine is
+//! find a solution in the following case : OnLine is
//! outside Cu1. There is no intersection point between Cu1
//! and OnLine. The distance between the line and the
//! circle is greater than Radius.
//! This abstract class describes a set on N Functions of
-//! M independant variables.
+//! M independent variables.
class Geom2dGcc_FunctionTanCuCuCu : public math_FunctionSetWithDerivatives
{
public:
//! This abstract class describes a set on N Functions of
-//! M independant variables.
+//! M independent variables.
class Geom2dGcc_FunctionTanCuCuOnCu : public math_FunctionSetWithDerivatives
{
public:
Standard_EXPORT Geom2dGcc_Lin2d2TanIter(const Geom2dGcc_QCurve& Qualified1, const gp_Pnt2d& ThePoint, const Standard_Real Param1, const Standard_Real Tolang);
//! This class implements the algorithms used to create 2d
- //! line tangent to a circle and to a cuve.
+ //! line tangent to a circle and to a curve.
//! Tolang is used to determine the tolerance for the
//! tangency points.
//! Param2 is used for the initial guess on the curve.
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! TolU is used to decide to stop the iterations.
//! At the nth iteration, the criteria is:
//! The close point is defined by the parameter value
//! U0.
//! 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.
//! Zeros are searched between Umin et Usup.
//! TolU is used to decide to stop the iterations.
Standard_EXPORT Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter(const Adaptor2d_Curve2d& Curve, const Standard_Integer NbPnt, const IntRes2d_Domain& Domain, const Standard_Real Tol);
//! The current polygon is modified if most
- //! of the points of the polygon are are
+ //! of the points of the polygon are
//! outside the box <OtherBox>. In this
//! situation, bounds are computed to build
//! a polygon inside or near the OtherBox.
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt.
- //! The Correspondance between Pnt and the point P(V)
+ //! The Correspondence between Pnt and the point P(V)
//! on the parametric curve must be coherent with the
//! way of determination of the signed distance
//! between a point and the implicit curve.
//! Returns the parameter V of the point on the
//! parametric curve corresponding to the Point Pnt.
- //! The Correspondance between Pnt and the point P(V)
+ //! The Correspondence between Pnt and the point P(V)
//! on the parametric curve must be coherent with the
//! way of determination of the signed distance
//! between a point and the implicit curve.
Standard_EXPORT void PerformInf (const Handle(Geom2d_Curve)& C, LProp_CurAndInf& Result);
//! Computes the locals extremas of curvature.
- //! in the interval of parmeters [UMin,UMax].
+ //! in the interval of parameters [UMin,UMax].
Standard_EXPORT void PerformCurExt (const Handle(Geom2d_Curve)& C, const Standard_Real UMin, const Standard_Real UMax, LProp_CurAndInf& Result);
//! Computes the inflections in the interval of
- //! parmeters [UMin,UMax].
+ //! parameters [UMin,UMax].
Standard_EXPORT void PerformInf (const Handle(Geom2d_Curve)& C, const Standard_Real UMin, const Standard_Real UMax, LProp_CurAndInf& Result);
//! True if the solutions are found.
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
-// Creted: Tue Jun 23 15:39:24 1998
+// Created: Tue Jun 23 15:39:24 1998
#include <Adaptor3d_Curve.hxx>
#include <Approx_CurvlinFunc.hxx>
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
//! Say if the law is defined, only by the 3d Geometry of
- //! the setted Curve
+ //! the set Curve
//! Return False by Default.
Standard_EXPORT virtual Standard_Boolean IsOnlyBy3dCurve() const Standard_OVERRIDE;
Standard_EXPORT virtual Standard_Boolean IsConstant() const Standard_OVERRIDE;
//! Say if the law is defined, only by the 3d Geometry of
- //! the setted Curve
+ //! the set Curve
//! Return False by Default.
Standard_EXPORT virtual Standard_Boolean IsOnlyBy3dCurve() const Standard_OVERRIDE;
{
if (myCurve.IsNull())
throw Standard_ConstructionError(
- "GeomFill_LocationGuide::The path is not setted !!");
+ "GeomFill_LocationGuide::The path is not set !!");
//repere fixe
gp_Ax3 Rep(gp::Origin(), gp::DZ(), gp::DX());
//! It is useful to keep a constant angle between
//! input surface and the pipe. --
//! 3) give a path and two sections. The section
-//! evoluate from First to Last Section.
+//! evaluate from First to Last Section.
//!
//! 3) give a path and N sections. The section
-//! evoluate from First to Last Section.
+//! evaluate from First to Last Section.
//!
//! In general case the result is a NURBS. But we
//! can generate plane, cylindrical, spherical,
Standard_EXPORT GeomFill_Pipe(const Handle(Geom_Curve)& Path, const Handle(Geom_Curve)& FirstSect, const gp_Dir& Dir);
//! Create a pipe with an evolving section
- //! The section evoluate from First to Last Section
+ //! The section evaluate from First to Last Section
Standard_EXPORT GeomFill_Pipe(const Handle(Geom_Curve)& Path, const Handle(Geom_Curve)& FirstSect, const Handle(Geom_Curve)& LastSect);
//! Create a pipe with N sections
- //! The section evoluate from First to Last Section
+ //! The section evaluate from First to Last Section
Standard_EXPORT GeomFill_Pipe(const Handle(Geom_Curve)& Path, const TColGeom_SequenceOfCurve& NSections);
//! Create a pipe with a constant radius with 2
//! Segmax : The maximum number of span in v required on
//! the surface
//!
- //! raise If Domain are infinite or Profile not Setted.
+ //! raise If Domain are infinite or Profile not set.
Standard_EXPORT void Build (const Handle(GeomFill_SectionLaw)& Section, const GeomFill_ApproxStyle Methode = GeomFill_Location, const GeomAbs_Shape Continuity = GeomAbs_C2, const Standard_Integer Degmax = 10, const Standard_Integer Segmax = 30);
//! Tells if the Surface is Buildt.
Standard_EXPORT GeomFill_SweepSectionGenerator(const Handle(Geom_Curve)& Path, const Handle(Geom_Curve)& FirstSect);
//! Create a sweept surface with an evolving section
- //! The section evoluate from First to Last Section
+ //! The section evaluate from First to Last Section
Standard_EXPORT GeomFill_SweepSectionGenerator(const Handle(Geom_Curve)& Path, const Handle(Geom_Curve)& FirstSect, const Handle(Geom_Curve)& LastSect);
//! Create a pipe with a constant radius with 2
Standard_EXPORT virtual Standard_Boolean IsConstant() const;
//! Say if the law is defined, only by the 3d Geometry of
- //! the setted Curve
+ //! the set Curve
//! Return False by Default.
Standard_EXPORT virtual Standard_Boolean IsOnlyBy3dCurve() const;
if(!bIsFirstInside && !bIsLastInside) {
if((ifprm < aListOfIndex.First()) && (ilprm > aListOfIndex.Last())) {
- // append whole line, and boundaries if neccesary
+ // append whole line, and boundaries if necessary
if(bhasfirstpoint) {
const IntSurf_PntOn2S& aP = aSeqOfPntOn2S->Value(aListOfFLIndex.First());
aLineOn2S->Add(aP);
return Derive(theX(1), theGrad(1));
}
- //returns 1st derivative of the the one-dimension-function when
+ //returns 1st derivative of the one-dimension-function when
//parameter is equal to theX
Standard_Boolean Derive(const Standard_Real theX, Standard_Real& theDeriv1, Standard_Real* const theDeriv2 = 0) const
{
//! Allows you to ensure that the array of curves returned by
//! Curves2d has the correct orientation. Returns the
- //! orientation of the curves in the the array returned by
+ //! orientation of the curves in the array returned by
//! Curves2d. Computation changes the orientation of
//! these curves. Consequently, this method returns the
//! orientation prior to computation.
__FILE__,
tuyau,g);
- theCommands.Add("sweep", "sweep result [options] path [Surf] curve [Tol [nbsegment]]\n sweep the
the curve along the path, options are \n -FX : Tangent and Normal are fixed\n -FR : Tangent and Normal are given by Frenet trihedron \n -CF : Tangente is given by Frenet, \n the Normal is computed to minimize the torsion \n -DX : Tangent and Normal are given by Darboux trihedron \n <path> have to be a 2d curve,\n <Surf> have to be defined\n -CN dx dy dz : Normal is given by dx dy dz" ,
+ theCommands.Add("sweep", "sweep result [options] path [Surf] curve [Tol [nbsegment]]\n sweep the curve along the path, options are \n -FX : Tangent and Normal are fixed\n -FR : Tangent and Normal are given by Frenet trihedron \n -CF : Tangente is given by Frenet, \n the Normal is computed to minimize the torsion \n -DX : Tangent and Normal are given by Darboux trihedron \n <path> have to be a 2d curve,\n <Surf> have to be defined\n -CN dx dy dz : Normal is given by dx dy dz" ,
__FILE__,
sweep, g);
//! Returns background image texture map.
virtual Handle(Graphic3d_TextureMap) BackgroundImage() = 0;
- //! Sets image texture or environment cubemap as backround.
+ //! Sets image texture or environment cubemap as background.
//! @param theTextureMap [in] source to set a background;
//! should be either Graphic3d_Texture2D or Graphic3d_CubeMap
//! @param theToUpdatePBREnv [in] defines whether IBL maps will be generated or not
//! Sets background image fill style.
virtual void SetBackgroundImageStyle (const Aspect_FillMethod theFillStyle) = 0;
- //! Returns cubemap being setted last time on background.
+ //! Returns cubemap being set last time on background.
virtual Handle(Graphic3d_CubeMap) BackgroundCubeMap() const = 0;
//! Generates PBR specular probe and irradiance map
//! @thePaths - array of paths to separate image files (has to have size equal 6).
Standard_EXPORT Graphic3d_CubeMapSeparate (const NCollection_Array1<TCollection_AsciiString>& thePaths);
- //! Initializes cubemap to be setted directly from PixMaps.
+ //! Initializes cubemap to be set directly from PixMaps.
//! @theImages - array if PixMaps (has to have size equal 6).
Standard_EXPORT Graphic3d_CubeMapSeparate(const NCollection_Array1<Handle(Image_PixMap)>& theImages);
public:
- //! Supress all primitives and attributes of <me>.
+ //! Suppress all primitives and attributes of <me>.
//! To clear group without update in Graphic3d_StructureManager
//! pass Standard_False as <theUpdateStructureMgr>. This
//! used on context and viewer destruction, when the pointer
//! cross-reference);
Standard_EXPORT virtual void Clear (const Standard_Boolean theUpdateStructureMgr = Standard_True);
- //! Supress the group <me> in the structure.
+ //! Suppress the group <me> in the structure.
Standard_EXPORT virtual ~Graphic3d_Group();
- //! Supress the group <me> in the structure.
+ //! Suppress the group <me> in the structure.
//! Warning: No more graphic operations in <me> after this call.
//! Modifies the current modelling transform persistence (pan, zoom or rotate)
//! Get the current modelling transform persistence (pan, zoom or rotate)
//! Aspect attributes of a 3d face.
//! Keywords: Material, FillArea, Shininess, Ambient, Color, Diffuse,
//! Specular, Transparency, Emissive, ReflectionMode,
-//! BackFace, FrontFace, Reflection, Absorbtion
+//! BackFace, FrontFace, Reflection, Absorption
class Graphic3d_MaterialAspect
{
public:
//! List of custom uniform shader variables.
typedef NCollection_Sequence<Handle(Graphic3d_ShaderVariable)> Graphic3d_ShaderVariableList;
-//! List of custom vertex shader attrubures
+//! List of custom vertex shader attributes
typedef NCollection_Sequence<Handle(Graphic3d_ShaderAttribute)> Graphic3d_ShaderAttributeList;
//! This class is responsible for managing shader programs.
//! method returns boundaries taking into account infinite state
//! of the structure. This approach generally used for application
//! specific fit operation (e.g. fitting the model into screen,
- //! not taking into accout infinite helper elements).
+ //! not taking into account infinite helper elements).
//! Warning: If the structure <me> is empty then the empty box is returned,
//! If the structure <me> is infinite then the whole box is returned.
Standard_EXPORT Bnd_Box MinMaxValues (const Standard_Boolean theToIgnoreInfiniteFlag = Standard_False) const;
//! This class provides the implementation
//! of a 1D texture applyable along a segment.
//! You might use the SetSegment() method
-//! to set the way the texture is "streched" on facets.
+//! to set the way the texture is "stretched" on facets.
class Graphic3d_Texture1Dsegment : public Graphic3d_Texture1D
{
if (!aDir.Exists() || !aTextureFile.Exists())
{
#ifdef OCCT_DEBUG
- std::cerr << " CSF_MDTVTexturesDirectory or CASROOT not correctly setted\n";
+ std::cerr << " CSF_MDTVTexturesDirectory or CASROOT not correctly set\n";
std::cerr << " not all files are found in : "<< VarName.ToCString() << std::endl;
#endif
- throw Standard_Failure("CSF_MDTVTexturesDirectory or CASROOT not correctly setted");
+ throw Standard_Failure("CSF_MDTVTexturesDirectory or CASROOT not correctly set");
}
}
return VarName;
Graphic3d_TypeOfLimit_HasBlendedOitMsaa, //!< indicates whether necessary GL extensions for Weighted, Blended OIT available (with MSAA).
Graphic3d_TypeOfLimit_HasFlatShading, //!< indicates whether Flat shading (Graphic3d_TOSM_FACET) is supported
Graphic3d_TypeOfLimit_HasMeshEdges, //!< indicates whether advanced mesh edges presentation is supported
- Graphic3d_TypeOfLimit_IsWorkaroundFBO, //!< indicates whether workaround for Intel driver problem with empty FBO for images with big width is applyed.
+ Graphic3d_TypeOfLimit_IsWorkaroundFBO, //!< indicates whether workaround for Intel driver problem with empty FBO for images with big width is applied.
Graphic3d_TypeOfLimit_NB //!< number of elements in this enumeration
};
//! * Create a Parab2d from one apex and the center.
//! * Create a Parab2d with the directrix and the focus point.
//! * Create a Parab2d with its vertex point and its axis
-//! of symetry and its focus length.
+//! of symmetry and its focus length.
class gce_MakeParab2d : public gce_Root
{
public:
Standard_Boolean IsOpposite (const gp_Dir2d& Other, const Standard_Real AngularTolerance) const;
- //! returns true if if the angle between this unit vector and unit
+ //! returns true if the angle between this unit vector and unit
//! vector Other is equal to 0, Pi or -Pi.
//! i.e. Abs(Angle(<me>, Other)) <= AngularTolerance or
//! PI - Abs(Angle(<me>, Other)) <= AngularTolerance
gp_Ax1 Directrix2() const;
- //! Returns the excentricity of the hyperbola (e > 1).
+ //! Returns the eccentricity of the hyperbola (e > 1).
//! If f is the distance between the location of the hyperbola
//! and the Focus1 then the eccentricity e = f / MajorRadius. Raises DomainError if MajorRadius = 0.0
Standard_Real Eccentricity() const;
gp_Ax2d Directrix2() const;
- //! Returns the excentricity of the hyperbola (e > 1).
+ //! Returns the eccentricity of the hyperbola (e > 1).
//! If f is the distance between the location of the hyperbola
//! and the Focus1 then the eccentricity e = f / MajorRadius. Raises DomainError if MajorRadius = 0.0.
Standard_Real Eccentricity() const;
Standard_EXPORT void SetRows (const gp_XYZ& Row1, const gp_XYZ& Row2, const gp_XYZ& Row3);
- //! Modifies the the matrix so that it represents
+ //! Modifies the matrix so that it represents
//! a scaling transformation, where S is the scale factor. :
//! | S 0.0 0.0 |
//! <me> = | 0.0 S 0.0 |
DEFINE_STANDARD_ALLOC
- //! Creates an XYZ object with zero co-ordinates (0,0,0)
+ //! Creates an XYZ object with zero coordinates (0,0,0)
gp_XYZ();
//! creates an XYZ with given coordinates
projects / occt.git / commitdiff