lili/OCCT
1
0
Fork 0
mirror of https://github.com/Open-Cascade-SAS/OCCT.git synced 2026-05-11 01:58:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

Documentation - Fix whitespaces and typos (#824)

Browse Source 
- Fixed excessive whitespace in multi-line comments
- Corrected spelling errors (e.g., "selectionnable" → "selectable", "begenning" → "beginning")
- Improved comment formatting and readability
This commit is contained in:
luzpaz
2025-11-13 15:31:57 -05:00
committed by GitHub
parent 570b34b666
commit 79289339d8
161 changed files with 879 additions and 883 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep.hxx
View File

@@ -28,7 +28,7 @@ class HLRBRep_Curve;
//! Hidden Lines Removal
//! algorithms on the BRep DataStructure.
//!
//! The class PolyAlgo is used to remove Hidden lines
//! The class PolyAlgo is used to remove Hidden lines
//! on Shapes with Triangulations.
class HLRBRep
{

19
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_CLPropsATool.hxx
View File

@@ -30,15 +30,15 @@ class HLRBRep_CLPropsATool
public:
DEFINE_STANDARD_ALLOC
//! Computes the point <P> of parameter <U> on the
//! Computes the point <P> of parameter <U> on the
//! Curve from HLRBRep <C>.
static void Value(const HLRBRep_Curve* A, const Standard_Real U, gp_Pnt2d& P);
//! Computes the point <P> and first derivative <V1>
//! Computes the point <P> and first derivative <V1>
//! of parameter <U> on the curve <C>.
static void D1(const HLRBRep_Curve* A, const Standard_Real U, gp_Pnt2d& P, gp_Vec2d& V1);
//! Computes the point <P>, the first derivative <V1>
//! Computes the point <P>, the first derivative <V1>
//! and second derivative <V2> of parameter <U> on the
//! curve <C>.
static void D2(const HLRBRep_Curve* A,
@@ -48,7 +48,7 @@ public:
gp_Vec2d& V2);
//! Computes the point <P>, the first derivative <V1>,
//! the second derivative <V2> and third derivative
//! the second derivative <V2> and third derivative
//! <V3> of parameter <U> on the curve <C>.
static void D3(const HLRBRep_Curve* A,
const Standard_Real U,
@@ -57,17 +57,16 @@ public:
gp_Vec2d& V2,
gp_Vec2d& V3);
//! returns the order of continuity of the curve <C>.
//! returns 1 : first derivative only is computable
//! returns 2 : first and second derivative only are
//! computable. returns 3 : first, second and third
//! are computable.
//! returns the order of continuity of the curve <C>.
//! returns 1: first derivative only is computable.
//! returns 2: first and second derivative only are computable.
//! returns 3: first, second and third are computable.
static Standard_Integer Continuity(const HLRBRep_Curve* A);
//! returns the first parameter bound of the curve.
static Standard_Real FirstParameter(const HLRBRep_Curve* A);
//! returns the last parameter bound of the curve.
//! returns the last parameter bound of the curve.
//! FirstParameter must be less than LastParamenter.
static Standard_Real LastParameter(const HLRBRep_Curve* A);

32
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_Curve.hxx
View File

@@ -65,11 +65,11 @@ public:
//! Returns the 3D curve.
const BRepAdaptor_Curve& GetCurve() const;
//! Returns the parameter on the 2d curve from the
//! Returns the parameter on the 2d curve from the
//! parameter on the 3d curve.
Standard_EXPORT Standard_Real Parameter2d(const Standard_Real P3d) const;
//! Returns the parameter on the 3d curve from the
//! Returns the parameter on the 3d curve from the
//! parameter on the 2d curve.
Standard_EXPORT Standard_Real Parameter3d(const Standard_Real P2d) const;
@@ -79,25 +79,25 @@ public:
//! Update the minmax returns tol for enlarge;
Standard_EXPORT Standard_Real UpdateMinMax(Standard_Real TotMin[16], Standard_Real TotMax[16]);
//! Computes the Z coordinate of the point of
//! Computes the Z coordinate of the point of
//! parameter U on the curve in the viewing coordinate system
Standard_EXPORT Standard_Real Z(const Standard_Real U) const;
//! Computes the 3D point of parameter U on the
//! Computes the 3D point of parameter U on the
//! curve.
gp_Pnt Value3D(const Standard_Real U) const;
//! Computes the 3D point of parameter U on the
//! Computes the 3D point of parameter U on the
//! curve.
void D0(const Standard_Real U, gp_Pnt& P) const;
//! Computes the point of parameter U on the curve
//! Computes the point of parameter U on the curve
//! with its first derivative.
void D1(const Standard_Real U, gp_Pnt& P, gp_Vec& V) const;
//! Depending on <AtStart> computes the 2D point and
//! tangent on the curve at sart (or at end). If the first
//! derivative is null look after at start (or before at end)
//! tangent on the curve at sart (or at end). If the first
//! derivative is null look after at start (or before at end)
//! with the second derivative.
Standard_EXPORT void Tangent(const Standard_Boolean AtStart, gp_Pnt2d& P, gp_Dir2d& D) const;
@@ -107,15 +107,15 @@ public:
GeomAbs_Shape Continuity() const;
//! If necessary, breaks the curve in intervals of
//! continuity <S>. And returns the number of
//! If necessary, breaks the curve in intervals of
//! continuity <S>. And returns the number of
//! intervals.
Standard_Integer NbIntervals(const GeomAbs_Shape S) const;
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
void Intervals(TColStd_Array1OfReal& T, const GeomAbs_Shape S) const;
@@ -131,7 +131,7 @@ public:
//! Computes the point of parameter U on the curve.
Standard_EXPORT void D0(const Standard_Real U, gp_Pnt2d& P) const;
//! Computes the point of parameter U on the curve
//! Computes the point of parameter U on the curve
//! with its first derivative.
//! Raised if the continuity of the current interval
//! is not C1.
@@ -158,12 +158,12 @@ public:
//! Raised if N < 1.
Standard_EXPORT gp_Vec2d DN(const Standard_Real U, const Standard_Integer N) const;
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
Standard_Real Resolution(const Standard_Real R3d) const;
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
GeomAbs_CurveType GetType() const;

18
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_CurveTool.hxx
View File

@@ -48,14 +48,14 @@ public:
static GeomAbs_Shape Continuity(const Standard_Address C);
//! Returns the number of intervals for continuity
//! Returns the number of intervals for continuity
//! <S>. May be one if Continuity(myclass) >= <S>
static Standard_Integer NbIntervals(const Standard_Address C);
//! Stores in <T> the parameters bounding the intervals
//! Stores in <T> the parameters bounding the intervals
//! of continuity <S>.
//!
//! The array must provide enough room to accommodate
//! The array must provide enough room to accommodate
//! for the parameters. i.e. T.Length() > NbIntervals()
static void Intervals(const Standard_Address C, TColStd_Array1OfReal& T);
@@ -79,7 +79,7 @@ public:
//! Computes the point of parameter U on the curve.
static void D0(const Standard_Address C, const Standard_Real U, gp_Pnt2d& P);
//! Computes the point of parameter U on the curve
//! Computes the point of parameter U on the curve
//! with its first derivative.
//! Raised if the continuity of the current interval
//! is not C1.
@@ -113,17 +113,17 @@ public:
//! Raised if N < 1.
static gp_Vec2d DN(const Standard_Address C, const Standard_Real U, const Standard_Integer N);
//! Returns the parametric resolution corresponding
//! Returns the parametric resolution corresponding
//! to the real space resolution <R3d>.
static Standard_Real Resolution(const Standard_Address C, const Standard_Real R3d);
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType GetType(const Standard_Address C);
//! Returns the type of the curve in the current
//! interval : Line, Circle, Ellipse, Hyperbola,
//! Returns the type of the curve in the current
//! interval: Line, Circle, Ellipse, Hyperbola,
//! Parabola, BezierCurve, BSplineCurve, OtherCurve.
static GeomAbs_CurveType TheType(const Standard_Address C);

56
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_Data.hxx
View File

@@ -55,13 +55,13 @@ class HLRBRep_Data : public Standard_Transient
{
public:
//! Create an empty data structure of <NV> vertices,
//! Create an empty data structure of <NV> vertices,
//! <NE> edges and <NF> faces.
Standard_EXPORT HLRBRep_Data(const Standard_Integer NV,
const Standard_Integer NE,
const Standard_Integer NF);
//! Write <DS> in me with a translation of
//! Write <DS> in me with a translation of
//! <dv>,<de>,<df>.
Standard_EXPORT void Write(const Handle(HLRBRep_Data)& DS,
const Standard_Integer dv,
@@ -72,15 +72,15 @@ public:
HLRBRep_Array1OfFData& FDataArray();
//! Set the tolerance for the rejections during the
//! Set the tolerance for the rejections during the
//! exploration
void Tolerance(const Standard_ShortReal tol);
//! returns the tolerance for the rejections during
//! returns the tolerance for the rejections during
//! the exploration
Standard_ShortReal Tolerance() const;
//! end of building of the Data and updating
//! end of building of the Data and updating
//! all the information linked to the projection.
Standard_EXPORT void Update(const HLRAlgo_Projector& P);
@@ -101,7 +101,7 @@ public:
const Standard_Integer e1,
const Standard_Integer e2);
//! Begin an iteration only on visible Edges
//! Begin an iteration only on visible Edges
//! crossing the face number <FI>.
Standard_EXPORT void InitEdge(const Standard_Integer FI, BRepTopAdaptor_MapOfShapeTool& MST);
@@ -109,19 +109,19 @@ public:
Standard_EXPORT void NextEdge(const Standard_Boolean skip = Standard_True);
//! Returns the current Edge
//! Returns the current Edge
Standard_EXPORT Standard_Integer Edge() const;
//! Returns true if the current edge to be hidden
//! Returns true if the current edge to be hidden
//! belongs to the hiding face.
Standard_Boolean HidingTheFace() const;
//! Returns true if the current hiding face is not an
//! Returns true if the current hiding face is not an
//! auto-intersected one.
Standard_Boolean SimpleHidingFace() const;
//! Intersect the current Edge with the boundary of
//! the hiding face. The interferences are given by
//! Intersect the current Edge with the boundary of
//! the hiding face. The interferences are given by
//! the More, Next, and Value methods.
Standard_EXPORT void InitInterference();
@@ -129,7 +129,7 @@ public:
Standard_EXPORT void NextInterference();
//! Returns True if the interference is rejected.
//! Returns True if the interference is rejected.
Standard_EXPORT Standard_Boolean RejectedInterference();
//! Returns True if the rejected interference is above
@@ -139,21 +139,21 @@ public:
HLRAlgo_Interference& Interference();
//! Returns the local description of the projection of
//! the current LEdge at parameter <Param>.
//! the current LEdge at parameter <Param>.
Standard_EXPORT void LocalLEGeometry2D(const Standard_Real Param,
gp_Dir2d& Tg,
gp_Dir2d& Nm,
Standard_Real& Cu);
//! Returns the local description of the projection of
//! the current FEdge at parameter <Param>.
//! the current FEdge at parameter <Param>.
Standard_EXPORT void LocalFEGeometry2D(const Standard_Integer FE,
const Standard_Real Param,
gp_Dir2d& Tg,
gp_Dir2d& Nm,
Standard_Real& Cu);
//! Returns the local 3D state of the intersection
//! Returns the local 3D state of the intersection
//! between the current edge and the current face at the
//! <p1> and <p2> parameters.
Standard_EXPORT void EdgeState(const Standard_Real p1,
@@ -161,23 +161,23 @@ public:
TopAbs_State& stbef,
TopAbs_State& staf);
//! Returns the true if the Edge <ED> belongs to the
//! Returns the true if the Edge <ED> belongs to the
//! Hiding Face.
Standard_Boolean EdgeOfTheHidingFace(const Standard_Integer E, const HLRBRep_EdgeData& ED) const;
//! Returns the number of levels of hiding face above
//! the first point of the edge <ED>. The
//! InterferenceList is given to compute far away of
//! Returns the number of levels of hiding face above
//! the first point of the edge <ED>. The
//! InterferenceList is given to compute far away of
//! the Interferences and then come back.
Standard_EXPORT Standard_Integer HidingStartLevel(const Standard_Integer E,
const HLRBRep_EdgeData& ED,
const HLRAlgo_InterferenceList& IL);
//! Returns the state of the Edge <ED> after
//! Returns the state of the Edge <ED> after
//! classification.
Standard_EXPORT TopAbs_State Compare(const Standard_Integer E, const HLRBRep_EdgeData& ED);
//! Simple classification of part of edge [p1, p2].
//! Simple classification of part of edge [p1, p2].
//! Returns OUT if at least 1 of Nbp points of edge is out; otherwise returns IN.
//! It is used to check "suspicion" hidden part of edge.
Standard_EXPORT TopAbs_State SimplClassify(const Standard_Integer E,
@@ -203,22 +203,22 @@ public:
DEFINE_STANDARD_RTTIEXT(HLRBRep_Data, Standard_Transient)
private:
//! Orient the OutLines ( left must be inside in
//! projection ). Returns True if the face of a closed
//! shell has been inverted;
//! Orient the OutLines (left must be inside projection).
//! Returns True if the face of a closed shell has been
//! inverted.
Standard_EXPORT Standard_Boolean OrientOutLine(const Standard_Integer I, HLRBRep_FaceData& FD);
//! Orient the Edges which are not Internal OutLine,
//! Orient the Edges which are not Internal OutLine,
//! not Double and not IsoLine.
Standard_EXPORT void OrientOthEdge(const Standard_Integer I, HLRBRep_FaceData& FD);
//! Returns True if the intersection is rejected.
//! Returns True if the intersection is rejected.
Standard_EXPORT Standard_Boolean RejectedPoint(const IntRes2d_IntersectionPoint& PInter,
const TopAbs_Orientation BoundOri,
const Standard_Integer NumSeg);
//! Returns True if there is a common vertex between myLE and myFE depending on <head1> and
//! <head2>.
//! Returns True if there is a common vertex between
//! myLE and myFE depending on <head1> and <head2>.
Standard_EXPORT Standard_Boolean SameVertex(const Standard_Boolean head1,
const Standard_Boolean head2);

26
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_TheInterferenceOfInterCSurf.hxx
View File

@@ -38,7 +38,7 @@ class HLRBRep_TheInterferenceOfInterCSurf : public Intf_Interference
public:
DEFINE_STANDARD_ALLOC
//! Constructs an empty interference between Polygon and
//! Constructs an empty interference between Polygon and
//! Polyhedron.
Standard_EXPORT HLRBRep_TheInterferenceOfInterCSurf();
@@ -48,29 +48,29 @@ public:
const HLRBRep_ThePolygonOfInterCSurf& thePolyg,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Line and the Polyhedron.
Standard_EXPORT HLRBRep_TheInterferenceOfInterCSurf(
const gp_Lin& theLin,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Lines and the Polyhedron.
Standard_EXPORT HLRBRep_TheInterferenceOfInterCSurf(
const Intf_Array1OfLin& theLins,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Computes an interference between the Polygon and the
//! Computes an interference between the Polygon and the
//! Polyhedron.
Standard_EXPORT void Perform(const HLRBRep_ThePolygonOfInterCSurf& thePolyg,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Computes an interference between the Straight Line and the
//! Computes an interference between the Straight Line and the
//! Polyhedron.
Standard_EXPORT void Perform(const gp_Lin& theLin,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Computes an interference between the Straight Lines and
//! Computes an interference between the Straight Lines and
//! the Polyhedron.
Standard_EXPORT void Perform(const Intf_Array1OfLin& theLins,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
@@ -82,33 +82,33 @@ public:
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Line and the Polyhedron.
Standard_EXPORT HLRBRep_TheInterferenceOfInterCSurf(
const gp_Lin& theLin,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Constructs and computes an interference between the
//! Constructs and computes an interference between the
//! Straight Lines and the Polyhedron.
Standard_EXPORT HLRBRep_TheInterferenceOfInterCSurf(
const Intf_Array1OfLin& theLins,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Polygon and the
//! Computes an interference between the Polygon and the
//! Polyhedron.
Standard_EXPORT void Perform(const HLRBRep_ThePolygonOfInterCSurf& thePolyg,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Straight Line and the
//! Computes an interference between the Straight Line and the
//! Polyhedron.
Standard_EXPORT void Perform(const gp_Lin& theLin,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
Bnd_BoundSortBox& theBoundSB);
//! Computes an interference between the Straight Lines and
//! Computes an interference between the Straight Lines and
//! the Polyhedron.
Standard_EXPORT void Perform(const Intf_Array1OfLin& theLins,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh,
@@ -127,7 +127,7 @@ public:
protected:
private:
//! Computes the intersection between the segment <BegO><EndO>
//! Computes the intersection between the segment <BegO><EndO>
//! and the triangle <TTri> of <thePolyh>.
Standard_EXPORT void Intersect(const gp_Pnt& BegO,
const gp_Pnt& EndO,
@@ -135,7 +135,7 @@ private:
const Standard_Integer TTri,
const HLRBRep_ThePolyhedronOfInterCSurf& thePolyh);
//! Computes the intersection between the segment <BegO><EndO>
//! Computes the intersection between the segment <BegO><EndO>
//! and the triangle <TTri> of <thePolyh>.
Standard_EXPORT void Intersect(const gp_Pnt& BegO,
const gp_Pnt& EndO,

8
src/ModelingAlgorithms/TKHLR/HLRBRep/HLRBRep_VertexList.hxx
View File

@@ -50,19 +50,19 @@ public:
//! Returns True if the current vertex is on the boundary of the edge.
Standard_EXPORT Standard_Boolean IsBoundary() const;
//! Returns True if the current vertex is an
//! Returns True if the current vertex is an
//! interference.
Standard_EXPORT Standard_Boolean IsInterference() const;
//! Returns the orientation of the current vertex if
//! Returns the orientation of the current vertex if
//! it is on the boundary of the edge.
Standard_EXPORT TopAbs_Orientation Orientation() const;
//! Returns the transition of the current vertex if
//! Returns the transition of the current vertex if
//! it is an interference.
Standard_EXPORT TopAbs_Orientation Transition() const;
//! Returns the transition of the current vertex
//! Returns the transition of the current vertex
//! relative to the boundary if it is an interference.
Standard_EXPORT TopAbs_Orientation BoundaryTransition() const;

14
src/ModelingAlgorithms/TKHLR/HLRTopoBRep/HLRTopoBRep_DSFiller.hxx
View File

@@ -30,13 +30,13 @@ class TopoDS_Vertex;
class Contap_Point;
class TopoDS_Edge;
//! Provides methods to fill a HLRTopoBRep_Data.
//! Provides methods to fill a HLRTopoBRep_Data.
class HLRTopoBRep_DSFiller
{
public:
DEFINE_STANDARD_ALLOC
//! Stores in <DS> the outlines of <S> using the current
//! Stores in <DS> the outlines of <S> using the current
//! outliner and stores the isolines in <DS> using a Hatcher.
Standard_EXPORT static void Insert(const TopoDS_Shape& S,
Contap_Contour& FO,
@@ -46,7 +46,7 @@ public:
protected:
private:
//! Stores in <DS> the outlines of <F> using the current
//! Stores in <DS> the outlines of <F> using the current
//! outliner.
Standard_EXPORT static void InsertFace(const Standard_Integer FI,
const TopoDS_Face& F,
@@ -54,21 +54,21 @@ private:
HLRTopoBRep_Data& DS,
const Standard_Boolean withPCurve);
//! Make a vertex from an intersection point <P>and
//! Make a vertex from an intersection point <P>and
//! store it in the data structure <DS>.
Standard_EXPORT static TopoDS_Vertex MakeVertex(const Contap_Point& P,
const Standard_Real tol,
HLRTopoBRep_Data& DS);
//! Insert a vertex from an internal intersection
//! point <P> on restriction <E> and store it in the
//! Insert a vertex from an internal intersection
//! point <P> on restriction <E> and store it in the
//! data structure <DS>.
Standard_EXPORT static void InsertVertex(const Contap_Point& P,
const Standard_Real tol,
const TopoDS_Edge& E,
HLRTopoBRep_Data& DS);
//! Split all the edges with vertices in the data
//! Split all the edges with vertices in the data
//! structure.
Standard_EXPORT static void ProcessEdges(HLRTopoBRep_Data& DS);
};

6
src/ModelingAlgorithms/TKHLR/HLRTopoBRep/HLRTopoBRep_Data.hxx
View File

@@ -34,7 +34,7 @@ class TopoDS_Face;
class TopoDS_Shape;
class TopoDS_Vertex;
//! Stores the results of the OutLine and IsoLine
//! Stores the results of the OutLine and IsoLine
//! processes.
class HLRTopoBRep_Data
{
@@ -46,7 +46,7 @@ public:
//! Clear of all the maps.
Standard_EXPORT void Clear();
//! Clear of all the data not needed during and after
//! Clear of all the data not needed during and after
//! the hiding process.
Standard_EXPORT void Clean();
@@ -85,7 +85,7 @@ public:
//! Returns the list of the IsoLines.
const TopTools_ListOfShape& FaceIsoL(const TopoDS_Face& F) const;
//! Returns True if V is an outline vertex on a
//! Returns True if V is an outline vertex on a
//! restriction.
Standard_Boolean IsOutV(const TopoDS_Vertex& V) const;

74
src/ModelingAlgorithms/TKOffset/BRepOffset/BRepOffset_SimpleOffset.hxx
View File

@@ -31,8 +31,8 @@
class BRepOffset_SimpleOffset;
DEFINE_STANDARD_HANDLE(BRepOffset_SimpleOffset, BRepTools_Modification)
//! This class represents mechanism of simple offset algorithm i. e.
//! topology-preserve offset construction without intersection.
//! This class represents mechanism of simple offset algorithm
//! i.e. topology-preserve offset construction without intersection.
//!
//! The list below shows mapping scheme:
//! - Each surface is mapped to its geometric offset surface.
@@ -54,17 +54,17 @@ public:
const Standard_Real theOffsetValue,
const Standard_Real theTolerance);
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location,<Tol>
//! the new tolerance.<RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface.(the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! face changes in the shells which contain it. --
//! Here, <RevFace> will return Standard_True if the
//! -- gp_Trsf is negative.
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location,
//! <Tol> the new tolerance. <RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface. (the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! face changes in the shells which contain it.
//! Here, <RevFace> will return Standard_True if the
//! gp_Trsf is negative.
Standard_EXPORT Standard_Boolean NewSurface(const TopoDS_Face& F,
Handle(Geom_Surface)& S,
TopLoc_Location& L,
@@ -72,31 +72,31 @@ public:
Standard_Boolean& RevWires,
Standard_Boolean& RevFace) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>, <Tol> are not
//! significant.
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location,
//! <Tol> the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>,
//! <Tol> are not significant.
Standard_EXPORT Standard_Boolean NewCurve(const TopoDS_Edge& E,
Handle(Geom_Curve)& C,
TopLoc_Location& L,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>,
//! <Tol> are not significant.
Standard_EXPORT Standard_Boolean NewPoint(const TopoDS_Vertex& V,
gp_Pnt& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has a new
//! curve on surface on the face <F>.In this case, <C>
//! is the new geometric support of the edge, <L> the
//! new location, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <C>, <L>,
//! Returns Standard_True if the edge <E> has a new
//! curve on surface on the face <F>. In this case,
//! <C> is the new geometric support of the edge,
//! <L> the new location, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <C>, <L>,
//! <Tol> are not significant.
Standard_EXPORT Standard_Boolean NewCurve2d(const TopoDS_Edge& E,
const TopoDS_Face& F,
@@ -105,21 +105,21 @@ public:
Handle(Geom2d_Curve)& C,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case, <P> is
//! the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case,
//! <P> is the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>,
//! <Tol> are not significant.
Standard_EXPORT Standard_Boolean NewParameter(const TopoDS_Vertex& V,
const TopoDS_Edge& E,
Standard_Real& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns the continuity of <NewE> between <NewF1>
//! Returns the continuity of <NewE> between <NewF1>
//! and <NewF2>.
//!
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! (resp. <F2>).
Standard_EXPORT GeomAbs_Shape Continuity(const TopoDS_Edge& E,
const TopoDS_Face& F1,

114
src/ModelingAlgorithms/TKPrim/BRepPrim/BRepPrim_OneAxis.hxx
View File

@@ -29,46 +29,44 @@
#include <TopoDS_Face.hxx>
class gp_Pnt2d;
//! Algorithm to build primitives with one axis of
//! Algorithm to build primitives with one axis of
//! revolution.
//!
//! The revolution body is described by :
//! The revolution body is described by:
//!
//! A coordinate system (Ax2 from gp). The Z axis is
//! A coordinate system (Ax2 from gp). The Z axis is
//! the rotational axis.
//!
//! An Angle around the Axis, When the Angle is 2*PI
//! the primitive is not limited by planar faces. The
//! An Angle around the Axis, When the Angle is 2*PI
//! the primitive is not limited by planar faces. The
//! U parameter range from 0 to Angle.
//!
//! A parameter range VMin, VMax on the meridian.
//!
//! A meridian : The meridian is a curve described by
//! A meridian: The meridian is a curve described by
//! a set of deferred methods.
//!
//! The topology consists of A shell, Faces, Wires,
//! Edges and Vertices. Methods are provided to build
//! all the elements. Building an element implies the
//! automatic building of all its sub-elements.
//! The topology consists of A shell, Faces, Wires,
//! Edges and Vertices. Methods are provided to build
//! all the elements. Building an element implies the
//! automatic building of all its sub-elements.
//!
//! So building the shell builds everything.
//!
//! There are at most 5 faces :
//! There are at most 5 faces:
//!
//! - The LateralFace.
//!
//! - The TopFace and the BottomFace.
//!
//! - The StartFace and the EndFace.
class BRepPrim_OneAxis
{
public:
DEFINE_STANDARD_ALLOC
//! The MeridianOffset is added to the parameters on
//! the meridian curve and to the V values of the
//! pcurves. This is used for the sphere for example,
//! to give a range on the meridian edge which is not
//! The MeridianOffset is added to the parameters on
//! the meridian curve and to the V values of the
//! pcurves. This is used for the sphere for example,
//! to give a range on the meridian edge which is not
//! VMin, VMax.
Standard_EXPORT void SetMeridianOffset(const Standard_Real MeridianOffset = 0);
@@ -89,20 +87,20 @@ public:
Standard_EXPORT void VMax(const Standard_Real V);
//! Returns a face with no edges. The surface is the
//! Returns a face with no edges. The surface is the
//! lateral surface with normals pointing outward. The
//! U parameter is the angle with the origin on the X
//! axis. The V parameter is the parameter of the
//! U parameter is the angle with the origin on the X
//! axis. The V parameter is the parameter of the
//! meridian.
Standard_EXPORT virtual TopoDS_Face MakeEmptyLateralFace() const = 0;
//! Returns an edge with a 3D curve made from the
//! meridian in the XZ plane rotated by <Ang> around
//! Returns an edge with a 3D curve made from the
//! meridian in the XZ plane rotated by <Ang> around
//! the Z-axis. Ang may be 0 or myAngle.
Standard_EXPORT virtual TopoDS_Edge MakeEmptyMeridianEdge(const Standard_Real Ang) const = 0;
//! Sets the parametric curve of the edge <E> in the
//! face <F> to be the 2d representation of the
//! Sets the parametric curve of the edge <E> in the
//! face <F> to be the 2d representation of the
//! meridian.
Standard_EXPORT virtual void SetMeridianPCurve(TopoDS_Edge& E, const TopoDS_Face& F) const = 0;
@@ -110,72 +108,72 @@ public:
//! plane XZ.
Standard_EXPORT virtual gp_Pnt2d MeridianValue(const Standard_Real V) const = 0;
//! Returns True if the point of parameter <V> on the
//! Returns True if the point of parameter <V> on the
//! meridian is on the Axis. Default implementation is
//! Abs(MeridianValue(V).X()) < Precision::Confusion()
Standard_EXPORT virtual Standard_Boolean MeridianOnAxis(const Standard_Real V) const;
//! Returns True if the meridian is closed. Default
//! implementation is
//! Returns True if the meridian is closed.
//! Default implementation is:
//! MeridianValue(VMin).IsEqual(MeridianValue(VMax),
//! Precision::Confusion())
Standard_EXPORT virtual Standard_Boolean MeridianClosed() const;
//! Returns True if VMax is infinite. Default
//! Precision::IsPositiveInfinite(VMax);
//! Returns True if VMax is infinite.
//! Default Precision::IsPositiveInfinite(VMax);
Standard_EXPORT virtual Standard_Boolean VMaxInfinite() const;
//! Returns True if VMin is infinite. Default
//! Precision::IsNegativeInfinite(VMax);
//! Returns True if VMin is infinite.
//! Default Precision::IsNegativeInfinite(VMax);
Standard_EXPORT virtual Standard_Boolean VMinInfinite() const;
//! Returns True if there is a top face.
//! Returns True if there is a top face.
//!
//! That is neither : VMaxInfinite()
//! That is neither: VMaxInfinite()
//! MeridianClosed()
//! MeridianOnAxis(VMax)
Standard_EXPORT virtual Standard_Boolean HasTop() const;
//! Returns True if there is a bottom face.
//! Returns True if there is a bottom face.
//!
//! That is neither : VMinInfinite()
//! That is neither: VMinInfinite()
//! MeridianClosed()
//! MeridianOnAxis(VMin)
Standard_EXPORT virtual Standard_Boolean HasBottom() const;
//! Returns True if there are Start and End faces.
//! Returns True if there are Start and End faces.
//!
//! That is : 2*PI - Angle > Precision::Angular()
//! That is: 2*PI - Angle > Precision::Angular()
Standard_EXPORT virtual Standard_Boolean HasSides() const;
//! Returns the Shell containing all the Faces of the
//! Returns the Shell containing all the Faces of the
//! primitive.
Standard_EXPORT const TopoDS_Shell& Shell();
//! Returns the lateral Face. It is oriented toward
//! Returns the lateral Face. It is oriented toward
//! the outside of the primitive.
Standard_EXPORT const TopoDS_Face& LateralFace();
//! Returns the top planar Face. It is Oriented
//! Returns the top planar Face. It is Oriented
//! toward the +Z axis (outside).
Standard_EXPORT const TopoDS_Face& TopFace();
//! Returns the Bottom planar Face. It is Oriented
//! Returns the Bottom planar Face. It is Oriented
//! toward the -Z axis (outside).
Standard_EXPORT const TopoDS_Face& BottomFace();
//! Returns the Face starting the slice, it is
//! Returns the Face starting the slice, it is
//! oriented toward the exterior of the primitive.
Standard_EXPORT const TopoDS_Face& StartFace();
//! Returns the Face ending the slice, it is oriented
//! Returns the Face ending the slice, it is oriented
//! toward the exterior of the primitive.
Standard_EXPORT const TopoDS_Face& EndFace();
//! Returns the wire in the lateral face.
//! Returns the wire in the lateral face.
Standard_EXPORT const TopoDS_Wire& LateralWire();
//! Returns the wire in the lateral face with the
//! Returns the wire in the lateral face with the
//! start edge.
Standard_EXPORT const TopoDS_Wire& LateralStartWire();
@@ -189,17 +187,17 @@ public:
//! Returns the wire in the bottom face.
Standard_EXPORT const TopoDS_Wire& BottomWire();
//! Returns the wire in the start face.
//! Returns the wire in the start face.
Standard_EXPORT const TopoDS_Wire& StartWire();
//! Returns the wire in the start face with the
//! Returns the wire in the start face with the
//! AxisEdge.
Standard_EXPORT const TopoDS_Wire& AxisStartWire();
//! Returns the Wire in the end face.
//! Returns the Wire in the end face.
Standard_EXPORT const TopoDS_Wire& EndWire();
//! Returns the Wire in the end face with the
//! Returns the Wire in the end face with the
//! AxisEdge.
Standard_EXPORT const TopoDS_Wire& AxisEndWire();
@@ -207,10 +205,10 @@ public:
//! on +Z of the Axis.
Standard_EXPORT const TopoDS_Edge& AxisEdge();
//! Returns the Edge at angle 0.
//! Returns the Edge at angle 0.
Standard_EXPORT const TopoDS_Edge& StartEdge();
//! Returns the Edge at angle Angle. If !HasSides()
//! Returns the Edge at angle Angle. If !HasSides()
//! the StartEdge and the EndEdge are the same edge.
Standard_EXPORT const TopoDS_Edge& EndEdge();
@@ -218,30 +216,30 @@ public:
//! Face.
Standard_EXPORT const TopoDS_Edge& StartTopEdge();
//! Returns the linear Edge between start Face and
//! Returns the linear Edge between start Face and
//! bottom Face.
Standard_EXPORT const TopoDS_Edge& StartBottomEdge();
//! Returns the linear Edge between end Face and top
//! Returns the linear Edge between end Face and top
//! Face.
Standard_EXPORT const TopoDS_Edge& EndTopEdge();
//! Returns the linear Edge between end Face and
//! Returns the linear Edge between end Face and
//! bottom Face.
Standard_EXPORT const TopoDS_Edge& EndBottomEdge();
//! Returns the edge at VMax. If MeridianClosed() the
//! Returns the edge at VMax. If MeridianClosed() the
//! TopEdge and the BottomEdge are the same edge.
Standard_EXPORT const TopoDS_Edge& TopEdge();
//! Returns the edge at VMin. If MeridianClosed() the
//! Returns the edge at VMin. If MeridianClosed() the
//! TopEdge and the BottomEdge are the same edge.
Standard_EXPORT const TopoDS_Edge& BottomEdge();
//! Returns the Vertex at the Top altitude on the axis.
Standard_EXPORT const TopoDS_Vertex& AxisTopVertex();
//! Returns the Vertex at the Bottom altitude on the
//! Returns the Vertex at the Bottom altitude on the
//! axis.
Standard_EXPORT const TopoDS_Vertex& AxisBottomVertex();
@@ -259,7 +257,7 @@ public:
Standard_EXPORT virtual ~BRepPrim_OneAxis();
protected:
//! Creates a OneAxis algorithm. <B> is used to build
//! Creates a OneAxis algorithm. <B> is used to build
//! the Topology. The angle defaults to 2*PI.
Standard_EXPORT BRepPrim_OneAxis(const BRepPrim_Builder& B,
const gp_Ax2& A,

64
src/ModelingAlgorithms/TKPrim/BRepSweep/BRepSweep_Translation.hxx
View File

@@ -29,16 +29,16 @@ class TopoDS_Shape;
class Sweep_NumShape;
class TopLoc_Location;
//! Provides an algorithm to build object by
//! Provides an algorithm to build object by
//! translation sweep.
class BRepSweep_Translation : public BRepSweep_Trsf
{
public:
DEFINE_STANDARD_ALLOC
//! Creates a topology by translating <S> with the
//! vector <V>. If C is true S Sucomponents are
//! copied. If Canonize is true then generated surfaces
//! Creates a topology by translating <S> with the
//! vector <V>. If C is true S Sucomponents are copied
//! If Canonize is true then generated surfaces
//! are attempted to be canonized in simple types
Standard_EXPORT BRepSweep_Translation(const TopoDS_Shape& S,
const Sweep_NumShape& N,
@@ -62,8 +62,8 @@ public:
Standard_EXPORT TopoDS_Shape MakeEmptyGeneratingEdge(const TopoDS_Shape& aGenE,
const Sweep_NumShape& aDirV);
//! Sets the parameters of the new vertex on the new
//! face. The new face and new vertex where generated
//! Sets the parameters of the new vertex on the new
//! face. The new face and new vertex where generated
//! from aGenF, aGenV and aDirV .
Standard_EXPORT void SetParameters(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewVertex,
@@ -71,8 +71,8 @@ public:
const TopoDS_Shape& aGenV,
const Sweep_NumShape& aDirV);
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! from aGenV aDirE, and aDirV.
Standard_EXPORT void SetDirectingParameter(const TopoDS_Shape& aNewEdge,
TopoDS_Shape& aNewVertex,
@@ -80,8 +80,8 @@ public:
const Sweep_NumShape& aDirE,
const Sweep_NumShape& aDirV);
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! from aGenE, aGenV and aDirV .
Standard_EXPORT void SetGeneratingParameter(const TopoDS_Shape& aNewEdge,
TopoDS_Shape& aNewVertex,
@@ -89,16 +89,16 @@ public:
const TopoDS_Shape& aGenV,
const Sweep_NumShape& aDirV);
//! Builds the face addressed by [aGenS,aDirS], with
//! Builds the face addressed by [aGenS,aDirS], with
//! its geometric part, but without subcomponents. The
//! couple aGenS, aDirS can be a "generating face and
//! a directing vertex" or "a generating edge and a
//! directing edge".
//! couple aGenS, aDirS can be a "generating face and
//! a directing vertex" or "a generating edge and a
//! directing edge".
Standard_EXPORT TopoDS_Shape MakeEmptyFace(const TopoDS_Shape& aGenS,
const Sweep_NumShape& aDirS);
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenF, aGenE and aDirV.
Standard_EXPORT void SetPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -108,7 +108,7 @@ public:
const TopAbs_Orientation orien);
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenE, aDirE and aDirV.
Standard_EXPORT void SetGeneratingPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -118,7 +118,7 @@ public:
const TopAbs_Orientation orien);
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenE, aDirE and aGenV.
Standard_EXPORT void SetDirectingPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -127,15 +127,15 @@ public:
const Sweep_NumShape& aDirE,
const TopAbs_Orientation orien);
//! Returns the Orientation of the shell in the solid
//! generated by the face aGenS with the edge aDirS.
//! It is REVERSED if the surface is swept in the
//! Returns the Orientation of the shell in the solid
//! generated by the face aGenS with the edge aDirS.
//! It is REVERSED if the surface is swept in the
//! direction of the normal.
Standard_EXPORT TopAbs_Orientation DirectSolid(const TopoDS_Shape& aGenS,
const Sweep_NumShape& aDirS);
//! Returns true if aNewSubShape (addressed by
//! aSubGenS and aDirS) must be added in aNewShape
//! Returns true if aNewSubShape (addressed by
//! aSubGenS and aDirS) must be added in aNewShape
//! (addressed by aGenS and aDirS).
Standard_EXPORT Standard_Boolean GGDShapeIsToAdd(const TopoDS_Shape& aNewShape,
const TopoDS_Shape& aNewSubShape,
@@ -143,8 +143,8 @@ public:
const TopoDS_Shape& aSubGenS,
const Sweep_NumShape& aDirS) const;
//! Returns true if aNewSubShape (addressed by
//! aGenS and aSubDirS) must be added in aNewShape
//! Returns true if aNewSubShape (addressed by
//! aGenS and aSubDirS) must be added in aNewShape
//! (addressed by aGenS and aDirS).
Standard_EXPORT Standard_Boolean GDDShapeIsToAdd(const TopoDS_Shape& aNewShape,
const TopoDS_Shape& aNewSubShape,
@@ -152,9 +152,9 @@ public:
const Sweep_NumShape& aDirS,
const Sweep_NumShape& aSubDirS) const;
//! In some particular cases the topology of a
//! generated face must be composed of independent
//! closed wires, in this case this function returns
//! In some particular cases the topology of a
//! generated face must be composed of independent
//! closed wires, in this case this function returns
//! true.
//! Here it always returns false.
Standard_EXPORT Standard_Boolean SeparatedWires(const TopoDS_Shape& aNewShape,
@@ -163,18 +163,18 @@ public:
const TopoDS_Shape& aSubGenS,
const Sweep_NumShape& aDirS) const;
//! Returns true if aDirS and aGenS addresses a
//! resulting Shape. In some specific cases the shape
//! can be geometrically inexsistant, then this
//! Returns true if aDirS and aGenS addresses a
//! resulting Shape. In some specific cases the shape
//! can be geometrically inexsistant, then this
//! function returns false.
Standard_EXPORT Standard_Boolean HasShape(const TopoDS_Shape& aGenS,
const Sweep_NumShape& aDirS) const;
//! Returns always false because here the
//! Returns always false because here the
//! transformation is a translation.
Standard_EXPORT Standard_Boolean IsInvariant(const TopoDS_Shape& aGenS) const;
//! Returns the Vector of the Prism, if it is an infinite
//! Returns the Vector of the Prism, if it is an infinite
//! prism the Vec is unitar.
Standard_EXPORT gp_Vec Vec() const;

78
src/ModelingAlgorithms/TKPrim/BRepSweep/BRepSweep_Trsf.hxx
View File

@@ -28,15 +28,15 @@ class TopoDS_Shape;
class Sweep_NumShape;
//! This class is inherited from NumLinearRegularSweep
//! to implement the simple swept primitives built
//! moving a Shape with a Trsf. It often is possible
//! to build the constructed subshapes by a simple
//! move of the generating subshapes (shared topology
//! and geometry). So two ways of construction are
//! proposed :
//! to implement the simple swept primitives built
//! moving a Shape with a Trsf. It often is possible
//! to build the constructed subshapes by a simple
//! move of the generating subshapes (shared topology
//! and geometry). So two ways of construction are
//! proposed:
//!
//! - sharing basis elements (the generatrice can be
//! modified , for example PCurves can be added on
//! - sharing basis elements (the generatrice can be
//! modified, for example PCurves can be added on
//! faces);
//!
//! - copying everything.
@@ -45,7 +45,7 @@ class BRepSweep_Trsf : public BRepSweep_NumLinearRegularSweep
public:
DEFINE_STANDARD_ALLOC
//! ends the construction of the swept primitive
//! ends the construction of the swept primitive
//! calling the virtual geometric functions that can't
//! be called in the initialize.
Standard_EXPORT void Init();
@@ -69,17 +69,17 @@ public:
Standard_EXPORT virtual TopoDS_Shape MakeEmptyGeneratingEdge(const TopoDS_Shape& aGenE,
const Sweep_NumShape& aDirV) = 0;
//! Sets the parameters of the new vertex on the new
//! face. The new face and new vertex where generated
//! from aGenF, aGenV and aDirV .
//! Sets the parameters of the new vertex on the new
//! face. The new face and new vertex where generated
//! from aGenF, aGenV and aDirV.
Standard_EXPORT virtual void SetParameters(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewVertex,
const TopoDS_Shape& aGenF,
const TopoDS_Shape& aGenV,
const Sweep_NumShape& aDirV) = 0;
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! from aGenV aDirE, and aDirV.
Standard_EXPORT virtual void SetDirectingParameter(const TopoDS_Shape& aNewEdge,
TopoDS_Shape& aNewVertex,
@@ -87,25 +87,25 @@ public:
const Sweep_NumShape& aDirE,
const Sweep_NumShape& aDirV) = 0;
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! from aGenE, aGenV and aDirV .
//! Sets the parameter of the new vertex on the new
//! edge. The new edge and new vertex where generated
//! from aGenE, aGenV and aDirV.
Standard_EXPORT virtual void SetGeneratingParameter(const TopoDS_Shape& aNewEdge,
TopoDS_Shape& aNewVertex,
const TopoDS_Shape& aGenE,
const TopoDS_Shape& aGenV,
const Sweep_NumShape& aDirV) = 0;
//! Builds the face addressed by [aGenS,aDirS], with
//! Builds the face addressed by [aGenS,aDirS], with
//! its geometric part, but without subcomponents. The
//! couple aGenS, aDirS can be a "generating face and
//! a directing vertex" or "a generating edge and a
//! directing edge".
//! couple aGenS, aDirS can be a "generating face and
//! a directing vertex" or "a generating edge and a
//! directing edge".
Standard_EXPORT virtual TopoDS_Shape MakeEmptyFace(const TopoDS_Shape& aGenS,
const Sweep_NumShape& aDirS) = 0;
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenF, aGenE and aDirV.
Standard_EXPORT virtual void SetPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -115,7 +115,7 @@ public:
const TopAbs_Orientation orien) = 0;
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenE, aDirE and aDirV.
Standard_EXPORT virtual void SetGeneratingPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -125,7 +125,7 @@ public:
const TopAbs_Orientation orien) = 0;
//! Sets the PCurve for a new edge on a new face. The
//! new edge and the new face were generated using
//! new edge and the new face were generated using
//! aGenE, aDirE and aGenV.
Standard_EXPORT virtual void SetDirectingPCurve(const TopoDS_Shape& aNewFace,
TopoDS_Shape& aNewEdge,
@@ -134,8 +134,8 @@ public:
const Sweep_NumShape& aDirE,
const TopAbs_Orientation orien) = 0;
//! Returns true if aNewSubShape (addressed by
//! aSubGenS and aDirS) must be added in aNewShape
//! Returns true if aNewSubShape (addressed by
//! aSubGenS and aDirS) must be added in aNewShape
//! (addressed by aGenS and aDirS).
Standard_EXPORT virtual Standard_Boolean GGDShapeIsToAdd(const TopoDS_Shape& aNewShape,
const TopoDS_Shape& aNewSubShape,
@@ -143,8 +143,8 @@ public:
const TopoDS_Shape& aSubGenS,
const Sweep_NumShape& aDirS) const = 0;
//! Returns true if aNewSubShape (addressed by
//! aGenS and aSubDirS) must be added in aNewShape
//! Returns true if aNewSubShape (addressed by
//! aGenS and aSubDirS) must be added in aNewShape
//! (addressed by aGenS and aDirS).
Standard_EXPORT virtual Standard_Boolean GDDShapeIsToAdd(
const TopoDS_Shape& aNewShape,
@@ -153,9 +153,9 @@ public:
const Sweep_NumShape& aDirS,
const Sweep_NumShape& aSubDirS) const = 0;
//! In some particular cases the topology of a
//! generated face must be composed of independent
//! closed wires, in this case this function returns
//! In some particular cases the topology of a
//! generated face must be composed of independent
//! closed wires, in this case this function returns
//! true.
Standard_EXPORT virtual Standard_Boolean SeparatedWires(const TopoDS_Shape& aNewShape,
const TopoDS_Shape& aNewSubShape,
@@ -163,25 +163,25 @@ public:
const TopoDS_Shape& aSubGenS,
const Sweep_NumShape& aDirS) const = 0;
//! Returns true if aDirS and aGenS addresses a
//! resulting Shape. In some specific cases the shape
//! can be geometrically inexsistant, then this
//! Returns true if aDirS and aGenS addresses a
//! resulting Shape. In some specific cases the shape
//! can be geometrically inexsistant, then this
//! function returns false.
Standard_EXPORT virtual Standard_Boolean HasShape(const TopoDS_Shape& aGenS,
const Sweep_NumShape& aDirS) const = 0;
//! Returns true if the geometry of aGenS is not
//! Returns true if the geometry of aGenS is not
//! modified by the trsf of the BRepSweep Trsf.
Standard_EXPORT virtual Standard_Boolean IsInvariant(const TopoDS_Shape& aGenS) const = 0;
//! Called to propagate the continuity of every vertex
//! between two edges of the generating wire aGenS on
//! Called to propagate the continuity of every vertex
//! between two edges of the generating wire aGenS on
//! the generated edge and faces.
Standard_EXPORT void SetContinuity(const TopoDS_Shape& aGenS, const Sweep_NumShape& aDirS);
protected:
//! Initialize the Trsf BrepSweep, if aCopy is true
//! the basis elements are shared as often as
//! Initialize the Trsf BrepSweep, if aCopy is true
//! the basis elements are shared as often as
//! possible, else everything is copied.
Standard_EXPORT BRepSweep_Trsf(const BRep_Builder& aBuilder,
const TopoDS_Shape& aGenShape,

20
src/ModelingAlgorithms/TKPrim/Sweep/Sweep_NumShape.hxx
View File

@@ -25,7 +25,7 @@
#include <Standard_Boolean.hxx>
#include <TopAbs_Orientation.hxx>
//! Gives a simple indexed representation of a
//! Gives a simple indexed representation of a
//! Directing Edge topology.
class Sweep_NumShape
{
@@ -37,14 +37,14 @@ public:
//! Creates a new simple indexed edge.
//!
//! For an Edge : Index is the number of vertices (0,
//! 1 or 2),Type is TopAbs_EDGE, Closed is true if it
//! is a closed edge, BegInf is true if the Edge is
//! infinite at the begenning, EndInf is true if the
//! For an Edge : Index is the number of vertices (0,
//! 1 or 2),Type is TopAbs_EDGE, Closed is true if it
//! is a closed edge, BegInf is true if the Edge is
//! infinite at the beginning, EndInf is true if the
//! edge is infinite at the end.
//!
//! For a Vertex : Index is the index of the vertex in
//! the edge (1 or 2), Type is TopAbsVERTEX, all the
//! the edge (1 or 2), Type is TopAbsVERTEX, all the
//! other fields have no meanning.
Standard_EXPORT Sweep_NumShape(const Standard_Integer Index,
const TopAbs_ShapeEnum Type,
@@ -54,10 +54,10 @@ public:
//! Reinitialize a simple indexed edge.
//!
//! For an Edge : Index is the number of vertices (0,
//! 1 or 2),Type is TopAbs_EDGE, Closed is true if it
//! is a closed edge, BegInf is true if the Edge is
//! infinite at the begenning, EndInf is true if the
//! For an Edge : Index is the number of vertices (0,
//! 1 or 2),Type is TopAbs_EDGE, Closed is true if it
//! is a closed edge, BegInf is true if the Edge is
//! infinite at the beginning, EndInf is true if the
//! edge is infinite at the end.
//!
//! For a Vertex : Index is the index of the vertex in

44
src/ModelingAlgorithms/TKShHealing/ShapeCustom/ShapeCustom_BSplineRestriction.hxx
View File

@@ -74,18 +74,18 @@ public:
const Standard_Boolean Rational,
const Handle(ShapeCustom_RestrictionParameters)& aModes);
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location,<Tol>
//! the new tolerance.<RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface.(the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location,
//! <Tol> the new tolerance. <RevWires> has to be set to
//! Standard_True when the modification reverses the
//! normal of the surface. (the wires have to be
//! reversed). <RevFace> has to be set to
//! Standard_True if the orientation of the modified
//! face changes in the shells which contain it.
//!
//! Otherwise, returns Standard_False, and <S>, <L>,
//! <Tol> , <RevWires> ,<RevFace> are not significant.
//! Otherwise, returns Standard_False, and <S>, <L>,
//! <Tol>, <RevWires>, <RevFace> are not significant.
Standard_EXPORT Standard_Boolean NewSurface(const TopoDS_Face& F,
Handle(Geom_Surface)& S,
TopLoc_Location& L,
@@ -93,30 +93,30 @@ public:
Standard_Boolean& RevWires,
Standard_Boolean& RevFace) Standard_OVERRIDE;
//! Returns Standard_True if curve from the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance.
//! Returns Standard_True if curve from the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance.
//! Otherwise, returns Standard_True if Surface is modified or
//! one of pcurves of edge is modified. In this case C is copy of
//! geometric support of the edge.
//! In other cases returns Standard_False, and <C>, <L>, <Tol> are not
//! In other cases returns Standard_False, and <C>, <L>, <Tol> are not
//! significant.
Standard_EXPORT Standard_Boolean NewCurve(const TopoDS_Edge& E,
Handle(Geom_Curve)& C,
TopLoc_Location& L,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has been modified.
//! Returns Standard_True if the edge <E> has been modified.
//! In this case,if curve on the surface is modified, <C>
//! is the new geometric support of the edge, <L> the
//! is the new geometric support of the edge, <L> the
//! new location, <Tol> the new tolerance. If curve on the surface
//! is not modified C is copy curve on surface from the edge <E>.
//!
//! Otherwise, returns Standard_False, and <C>, <L>,
//! Otherwise, returns Standard_False, and <C>, <L>,
//! <Tol> are not significant.
//!
//! <NewE> is the new edge created from <E>. <NewF>
//! <NewE> is the new edge created from <E>. <NewF>
//! is the new face created from <F>. They may be useful.
Standard_EXPORT Standard_Boolean NewCurve2d(const TopoDS_Edge& E,
const TopoDS_Face& F,
@@ -125,7 +125,7 @@ public:
Handle(Geom2d_Curve)& C,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the surface has been modified.
//! Returns Standard_True if the surface has been modified.
//! if flag IsOf equals Standard_True Offset surfaces are approximated to Offset
//! if Standard_False to BSpline
Standard_EXPORT Standard_Boolean ConvertSurface(const Handle(Geom_Surface)& aSurface,
@@ -136,7 +136,7 @@ public:
const Standard_Real VL,
const Standard_Boolean IsOf = Standard_True);
//! Returns Standard_True if the curve has been modified.
//! Returns Standard_True if the curve has been modified.
//! if flag IsOf equals Standard_True Offset curves are approximated to Offset
//! if Standard_False to BSpline
Standard_EXPORT Standard_Boolean ConvertCurve(const Handle(Geom_Curve)& aCurve,
@@ -187,7 +187,7 @@ public:
//! Sets max number of segments for approximation.
void SetMaxNbSegments(const Standard_Integer MaxNbSegments);
//! Sets priority for approximation curves and surface.
//! Sets priority for approximation curves and surface.
//! If Degree is True approximation is made with degree less
//! then specified MaxDegree at the expense of number of spanes.
//! If Degree is False approximation is made with number of

48
src/ModelingAlgorithms/TKShHealing/ShapeCustom/ShapeCustom_ConvertToBSpline.hxx
View File

@@ -58,11 +58,11 @@ public:
//! Sets mode for conversion of Plane surfaces.
Standard_EXPORT void SetPlaneMode(const Standard_Boolean planeMode);
//! Returns Standard_True if the face <F> has been
//! Returns Standard_True if the face <F> has been
//! modified. In this case, <S> is the new geometric
//! support of the face, <L> the new location, <Tol>
//! the new tolerance. Otherwise, returns
//! Standard_False, and <S>, <L>, <Tol> are not
//! support of the face, <L> the new location,
//! <Tol> the new tolerance. Otherwise, returns
//! Standard_False, and <S>, <L>, <Tol> are not
//! significant.
Standard_EXPORT Standard_Boolean NewSurface(const TopoDS_Face& F,
Handle(Geom_Surface)& S,
@@ -71,35 +71,35 @@ public:
Standard_Boolean& RevWires,
Standard_Boolean& RevFace) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location, <Tol>
//! the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>, <Tol> are not
//! Returns Standard_True if the edge <E> has been
//! modified. In this case, <C> is the new geometric
//! support of the edge, <L> the new location,
//! <Tol> the new tolerance. Otherwise, returns
//! Standard_False, and <C>, <L>, <Tol> are not
//! significant.
Standard_EXPORT Standard_Boolean NewCurve(const TopoDS_Edge& E,
Handle(Geom_Curve)& C,
TopLoc_Location& L,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! Returns Standard_True if the vertex <V> has been
//! modified. In this case, <P> is the new geometric
//! support of the vertex, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
Standard_EXPORT Standard_Boolean NewPoint(const TopoDS_Vertex& V,
gp_Pnt& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the edge <E> has a new
//! Returns Standard_True if the edge <E> has a new
//! curve on surface on the face <F>.In this case, <C>
//! is the new geometric support of the edge, <L> the
//! is the new geometric support of the edge, <L> the
//! new location, <Tol> the new tolerance.
//!
//! Otherwise, returns Standard_False, and <C>, <L>,
//! Otherwise, returns Standard_False, and <C>, <L>,
//! <Tol> are not significant.
//!
//! <NewE> is the new edge created from <E>. <NewF>
//! <NewE> is the new edge created from <E>. <NewF>
//! is the new face created from <F>. They may be useful.
Standard_EXPORT Standard_Boolean NewCurve2d(const TopoDS_Edge& E,
const TopoDS_Face& F,
@@ -108,21 +108,21 @@ public:
Handle(Geom2d_Curve)& C,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case, <P> is
//! the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! Returns Standard_True if the Vertex <V> has a new
//! parameter on the edge <E>. In this case, <P> is
//! the parameter, <Tol> the new tolerance.
//! Otherwise, returns Standard_False, and <P>, <Tol>
//! are not significant.
Standard_EXPORT Standard_Boolean NewParameter(const TopoDS_Vertex& V,
const TopoDS_Edge& E,
Standard_Real& P,
Standard_Real& Tol) Standard_OVERRIDE;
//! Returns the continuity of <NewE> between <NewF1>
//! Returns the continuity of <NewE> between <NewF1>
//! and <NewF2>.
//!
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! <NewE> is the new edge created from <E>. <NewF1>
//! (resp. <NewF2>) is the new face created from <F1>
//! (resp. <F2>).
Standard_EXPORT GeomAbs_Shape Continuity(const TopoDS_Edge& E,
const TopoDS_Face& F1,

12
src/ModelingAlgorithms/TKTopAlgo/BRepBuilderAPI/BRepBuilderAPI_MakeWire.hxx
View File

@@ -136,13 +136,13 @@ public:
//! Add the edges of <W> to the current wire.
Standard_EXPORT void Add(const TopoDS_Wire& W);
//! Adds the edges of <L> to the current wire. The
//! edges are not to be consecutive. But they are to
//! be all connected geometrically or topologically.
//! If some of them are not connected the Status give
//! Adds the edges of <L> to the current wire. The
//! edges are not to be consecutive. But they are to
//! be all connected geometrically or topologically.
//! If some of them are not connected the Status give
//! DisconnectedWire but the "Maker" is Done() and you
//! can get the partial result. (ie connected to the
//! first edgeof the list <L>)
//! can get the partial result.
//! (i.e. connected to the first edgeof the list <L>)
Standard_EXPORT void Add(const TopTools_ListOfShape& L);
//! Returns true if this algorithm contains a valid wire.

4
src/ModelingAlgorithms/TKTopAlgo/BRepExtrema/BRepExtrema_SolutionElem.hxx
View File

@@ -55,7 +55,7 @@ public:
{
}
//! This constructor is used when the solution of distance is on an Edge.
//! This constructor is used when the solution of distance is on an Edge.
//! The different initialized fields are:
//! @param theDist the distance
//! @param thePoint the solution point
@@ -76,7 +76,7 @@ public:
{
}
//! This constructor is used when the solution of distance is in a Face.
//! This constructor is used when the solution of distance is in a Face.
//! The different initialized fields are:
//! @param theDist the distance
//! @param thePoint the solution point

28
src/ModelingAlgorithms/TKTopAlgo/BRepLib/BRepLib_FindSurface.hxx
View File

@@ -25,25 +25,25 @@
class Geom_Surface;
class TopoDS_Shape;
//! Provides an algorithm to find a Surface through a
//! Provides an algorithm to find a Surface through a
//! set of edges.
//!
//! The edges of the shape given as argument are
//! explored if they are not coplanar at the required
//! tolerance the method Found returns false.
//! The edges of the shape given as argument are
//! explored if they are not coplanar at the required
//! tolerance the method Found returns false.
//!
//! If a null tolerance is given the max of the edges
//! If a null tolerance is given the max of the edges
//! tolerances is used.
//!
//! The method Tolerance returns the true distance of
//! The method Tolerance returns the true distance of
//! the edges to the Surface.
//!
//! The method Surface returns the Surface if found.
//!
//! The method Existed returns returns True if the
//! The method Existed returns True if the
//! Surface was already attached to some of the edges.
//!
//! When Existed returns True the Surface may have a
//! When Existed returns True the Surface may have a
//! location given by the Location method.
class BRepLib_FindSurface
{
@@ -52,26 +52,26 @@ public:
Standard_EXPORT BRepLib_FindSurface();
//! Computes the Surface from the edges of <S> with the
//! Computes the Surface from the edges of <S> with the
//! given tolerance.
//! if <OnlyPlane> is true, the computed surface will be
//! a plane. If it is not possible to find a plane, the
//! flag NotDone will be set.
//! If <OnlyClosed> is true, then S should be a wire
//! and the existing surface, on which wire S is not
//! If <OnlyClosed> is true, then S should be a wire
//! and the existing surface, on which wire S is not
//! closed in 2D, will be ignored.
Standard_EXPORT BRepLib_FindSurface(const TopoDS_Shape& S,
const Standard_Real Tol = -1,
const Standard_Boolean OnlyPlane = Standard_False,
const Standard_Boolean OnlyClosed = Standard_False);
//! Computes the Surface from the edges of <S> with the
//! Computes the Surface from the edges of <S> with the
//! given tolerance.
//! if <OnlyPlane> is true, the computed surface will be
//! a plane. If it is not possible to find a plane, the
//! flag NotDone will be set.
//! If <OnlyClosed> is true, then S should be a wire
//! and the existing surface, on which wire S is not
//! If <OnlyClosed> is true, then S should be a wire
//! and the existing surface, on which wire S is not
//! closed in 2D, will be ignored.
Standard_EXPORT void Init(const TopoDS_Shape& S,
const Standard_Real Tol = -1,

26
src/ModelingAlgorithms/TKTopAlgo/BRepLib/BRepLib_FuseEdges.hxx
View File

@@ -31,13 +31,13 @@
class TopoDS_Vertex;
class TopoDS_Edge;
//! This class can detect vertices in a face that can
//! This class can detect vertices in a face that can
//! be considered useless and then perform the fuse of
//! the edges and remove the useless vertices. By
//! useles vertices, we mean :
//! * vertices that have exactly two connex edges
//! the edges and remove the useless vertices. By
//! useles vertices, we mean:
//! * vertices that have exactly two connex edges
//! * the edges connex to the vertex must have
//! exactly the same 2 connex faces .
//! exactly the same 2 connex faces.
//! * The edges connex to the vertex must have the
//! same geometric support.
class BRepLib_FuseEdges
@@ -45,7 +45,7 @@ class BRepLib_FuseEdges
public:
DEFINE_STANDARD_ALLOC
//! Initialise members and build construction of map
//! Initialise members and build construction of map
//! of ancestors.
Standard_EXPORT BRepLib_FuseEdges(const TopoDS_Shape& theShape,
const Standard_Boolean PerformNow = Standard_False);
@@ -54,18 +54,18 @@ public:
Standard_EXPORT void AvoidEdges(const TopTools_IndexedMapOfShape& theMapEdg);
//! set mode to enable concatenation G1 BSpline edges in one
//! End Modified by IFV 19.04.07
//! End Modified by IFV 19.04.07
Standard_EXPORT void SetConcatBSpl(const Standard_Boolean theConcatBSpl = Standard_True);
//! returns all the list of edges to be fused
//! returns all the list of edges to be fused
//! each list of the map represent a set of connex edges
//! that can be fused.
Standard_EXPORT void Edges(TopTools_DataMapOfIntegerListOfShape& theMapLstEdg);
//! returns all the fused edges. each integer entry in
//! the map corresponds to the integer in the
//! DataMapOfIntegerListOfShape we get in method
//! Edges. That is to say, to the list of edges in
//! the map corresponds to the integer in the
//! DataMapOfIntegerListOfShape we get in method
//! Edges. That is to say, to the list of edges in
//! theMapLstEdg(i) corresponds the resulting edge theMapEdge(i)
Standard_EXPORT void ResultEdges(TopTools_DataMapOfIntegerShape& theMapEdg);
@@ -79,7 +79,7 @@ public:
//! returns the number of vertices candidate to be removed
Standard_EXPORT Standard_Integer NbVertices();
//! Using map of list of connex edges, fuse each list to
//! Using map of list of connex edges, fuse each list to
//! one edge and then update myShape
Standard_EXPORT void Perform();
@@ -88,7 +88,7 @@ private:
//! Build the all the lists of edges that are to be fused
Standard_EXPORT void BuildListEdges();
//! Build result fused edges according to the list
//! Build result fused edges according to the list
//! builtin BuildLisEdges
Standard_EXPORT void BuildListResultEdges();

22
src/ModelingAlgorithms/TKTopAlgo/BRepLib/BRepLib_MakeEdge.hxx
View File

@@ -37,34 +37,34 @@ class TopoDS_Edge;
//! Provides methods to build edges.
//!
//! The methods have the following syntax, where
//! The methods have the following syntax, where
//! TheCurve is one of Lin, Circ, ...
//!
//! Create(C : TheCurve)
//!
//! Makes an edge on the whole curve. Add vertices
//! Makes an edge on the whole curve. Add vertices
//! on finite curves.
//!
//! Create(C : TheCurve; p1,p2 : Real)
//!
//! Make an edge on the curve between parameters p1
//! Make an edge on the curve between parameters p1
//! and p2. if p2 < p1 the edge will be REVERSED. If
//! p1 or p2 is infinite the curve will be open in
//! that direction. Vertices are created for finite
//! p1 or p2 is infinite the curve will be open in
//! that direction. Vertices are created for finite
//! values of p1 and p2.
//!
//! Create(C : TheCurve; P1, P2 : Pnt from gp)
//!
//! Make an edge on the curve between the points P1
//! and P2. The points are projected on the curve
//! and the previous method is used. An error is
//! Make an edge on the curve between the points P1
//! and P2. The points are projected on the curve
//! and the previous method is used. An error is
//! raised if the points are not on the curve.
//!
//! Create(C : TheCurve; V1, V2 : Vertex from TopoDS)
//!
//! Make an edge on the curve between the vertices
//! V1 and V2. Same as the previous but no vertices
//! are created. If a vertex is Null the curve will
//! Make an edge on the curve between the vertices
//! V1 and V2. Same as the previous but no vertices
//! are created. If a vertex is Null the curve will
//! be open in this direction.
class BRepLib_MakeEdge : public BRepLib_MakeShape
{

22
src/ModelingAlgorithms/TKTopAlgo/BRepLib/BRepLib_MakeEdge2d.hxx
View File

@@ -35,34 +35,34 @@ class TopoDS_Edge;
//! Provides methods to build edges.
//!
//! The methods have the following syntax, where
//! The methods have the following syntax, where
//! TheCurve is one of Lin2d, Circ2d, ...
//!
//! Create(C : TheCurve)
//!
//! Makes an edge on the whole curve. Add vertices
//! Makes an edge on the whole curve. Add vertices
//! on finite curves.
//!
//! Create(C : TheCurve; p1,p2 : Real)
//!
//! Make an edge on the curve between parameters p1
//! Make an edge on the curve between parameters p1
//! and p2. if p2 < p1 the edge will be REVERSED. If
//! p1 or p2 is infinite the curve will be open in
//! that direction. Vertices are created for finite
//! p1 or p2 is infinite the curve will be open in
//! that direction. Vertices are created for finite
//! values of p1 and p2.
//!
//! Create(C : TheCurve; P1, P2 : Pnt2d from gp)
//!
//! Make an edge on the curve between the points P1
//! and P2. The points are projected on the curve
//! and the previous method is used. An error is
//! Make an edge on the curve between the points P1
//! and P2. The points are projected on the curve
//! and the previous method is used. An error is
//! raised if the points are not on the curve.
//!
//! Create(C : TheCurve; V1, V2 : Vertex from TopoDS)
//!
//! Make an edge on the curve between the vertices
//! V1 and V2. Same as the previous but no vertices
//! are created. If a vertex is Null the curve will
//! Make an edge on the curve between the vertices
//! V1 and V2. Same as the previous but no vertices
//! are created. If a vertex is Null the curve will
//! be open in this direction.
class BRepLib_MakeEdge2d : public BRepLib_MakeShape
{

18
src/ModelingAlgorithms/TKTopAlgo/BRepLib/BRepLib_MakeWire.hxx
View File

@@ -34,26 +34,26 @@ class TopoDS_Wire;
//! Provides methods to build wires.
//!
//! A wire may be built :
//! A wire may be built:
//!
//! * From a single edge.
//!
//! * From a wire and an edge.
//!
//! - A new wire is created with the edges of the
//! - A new wire is created with the edges of the
//! wire + the edge.
//!
//! - If the edge is not connected to the wire the
//! flag NotDone is set and the method Wire will
//! - If the edge is not connected to the wire the
//! flag NotDone is set and the method Wire will
//! raise an error.
//!
//! - The connection may be :
//! - The connection may be:
//!
//! . Through an existing vertex. The edge is shared.
//!
//! . Through a geometric coincidence of vertices.
//! The edge is copied and the vertices from the
//! edge are replaced by the vertices from the
//! The edge is copied and the vertices from the
//! edge are replaced by the vertices from the
//! wire.
//!
//! . The new edge and the connection vertices are
@@ -61,7 +61,7 @@ class TopoDS_Wire;
//!
//! * From 2, 3, 4 edges.
//!
//! - A wire is created from the first edge, the
//! - A wire is created from the first edge, the
//! following edges are added.
//!
//! * From many edges.
@@ -113,7 +113,7 @@ public:
Standard_EXPORT void Add(const TopoDS_Wire& W);
//! Add the edges of <L> to the current wire.
//! The edges are not to be consecutive. But they are
//! The edges are not to be consecutive. But they are
//! to be all connected geometrically or topologically.
Standard_EXPORT void Add(const TopTools_ListOfShape& L);

20
src/ModelingAlgorithms/TKTopAlgo/BRepMAT2d/BRepMAT2d_BisectingLocus.hxx
View File

@@ -41,8 +41,8 @@ class MAT_Arc;
//!
//! If the set of lines contains closed lines:
//! ------------------------------------------
//! These lines cut the plane in areas.
//! One map can be computed for each area.
//! These lines cut the plane in areas.
//! One map can be computed for each area.
//!
//! Bisecting locus computes a map in an area.
//! The area is defined by a side (MAT_Left,MAT_Right)
@@ -52,7 +52,7 @@ class MAT_Arc;
//! --------------------------------------------
//! the map recovers all the plane.
//!
//! Warning: Assume the orientation of the closed lines are
//! Warning: Assume the orientation of the closed lines are
//! compatible.
//!
//! Assume the explo contains only lines located in the
@@ -61,12 +61,12 @@ class MAT_Arc;
//! Assume a line don't cross itself or an other line.
//!
//! Remark:
//! the curves coming from the explorer can be
//! decomposed in different parts. It the case for the
//! the curves coming from the explorer can be
//! decomposed in different parts. It the case for the
//! curves other than circles or lines.
//!
//! The map of bisecting locus is described by a graph.
//! - The BasicsElements correspond to elements on
//! The map of bisecting locus is described by a graph.
//! - The BasicsElements correspond to elements on
//! the figure described by the Explorer from BRepMAT2d.
//! - The Arcs correspond to the bisectors.
//! - The Nodes are the extremities of the arcs.
@@ -115,12 +115,12 @@ public:
//! Returns the geometry linked to the <BasicElt>.
Standard_EXPORT Handle(Geom2d_Geometry) GeomElt(const Handle(MAT_BasicElt)& aBasicElt) const;
//! Returns the geometry of type <gp> linked to
//! Returns the geometry of type <gp> linked to
//! the <Node>.
Standard_EXPORT gp_Pnt2d GeomElt(const Handle(MAT_Node)& aNode) const;
//! Returns the geometry of type <Bissec>
//! linked to the arc <ARC>.
//! Returns the geometry of type <Bissec>
//! linked to the arc <ARC>.
//! <Reverse> is False when the FirstNode of <anArc>
//! correspond to the first point of geometry.
Standard_EXPORT Bisector_Bisec GeomBis(const Handle(MAT_Arc)& anArc,

8
src/ModelingAlgorithms/TKTopAlgo/BRepMAT2d/BRepMAT2d_Explorer.hxx
View File

@@ -50,11 +50,11 @@ public:
//! Returns the Number of contours.
Standard_EXPORT Standard_Integer NumberOfContours() const;
//! Returns the Number of Curves in the Contour number
//! Returns the Number of Curves in the Contour number
//! <IndexContour>.
Standard_EXPORT Standard_Integer NumberOfCurves(const Standard_Integer IndexContour) const;
//! Initialisation of an Iterator on the curves of
//! Initialisation of an Iterator on the curves of
//! the Contour number <IndexContour>.
Standard_EXPORT void Init(const Standard_Integer IndexContour);
@@ -83,7 +83,7 @@ public:
protected:
private:
//! Construction from a set of curves from Geom2d.
//! Assume the orientation of the closed lines are
//! Assume the orientation of the closed lines are
//! compatible. (ie if A is in B, the orientation of A and B
//! has to be different.
//!
@@ -98,7 +98,7 @@ private:
//! afirst point of a curve in a contour is equal to the last
//! point of the precedent curve.
//!
//! No control of this rules is done in the construction
//! No control of this rules is done in the construction
//! of the explorer
Standard_EXPORT void Add(const TopoDS_Wire& Spine,
const TopoDS_Face& aFace,

2
src/ModelingAlgorithms/TKTopAlgo/BRepMAT2d/BRepMAT2d_LinkTopoBilo.hxx
View File

@@ -57,7 +57,7 @@ public:
//! raises if <S> is not an edge or a vertex.
Standard_EXPORT void Init(const TopoDS_Shape& S);
//! Returns True if there is a current BasicElt.
//! Returns True if there is a current BasicElt.
Standard_EXPORT Standard_Boolean More();
//! Proceed to the next BasicElt.

2
src/ModelingAlgorithms/TKTopAlgo/IntCurvesFace/IntCurvesFace_Intersector.hxx
View File

@@ -68,7 +68,7 @@ public:
//! segment L and the loaded face.
//!
//! PInf is the smallest parameter on the line
//! PSup is the highest parameter on the line
//! PSup is the highest parameter on the line
//!
//! For an infinite line PInf and PSup can be
//! +/- RealLast.

4
src/ModelingAlgorithms/TKTopAlgo/IntCurvesFace/IntCurvesFace_ShapeIntersector.hxx
View File

@@ -50,7 +50,7 @@ public:
//! segment L and the loaded shape.
//!
//! PInf is the smallest parameter on the line
//! PSup is the highest parameter on the line
//! PSup is the highest parameter on the line
//!
//! For an infinite line PInf and PSup can be
//! +/- RealLast.
@@ -60,7 +60,7 @@ public:
//! segment L and the loaded shape.
//!
//! PInf is the smallest parameter on the line
//! PSup is the highest parameter on the line
//! PSup is the highest parameter on the line
//!
//! For an infinite line PInf and PSup can be
//! +/- RealLast.

4
src/ModelingAlgorithms/TKTopAlgo/MAT/MAT_BasicElt.hxx
View File

@@ -27,8 +27,8 @@ class MAT_Arc;
class MAT_BasicElt;
DEFINE_STANDARD_HANDLE(MAT_BasicElt, Standard_Transient)
//! A BasicELt is associated to each elementary
//! constituent of the figure.
//! A BasicELt is associated to each elementary
//! constituent of the figure.
class MAT_BasicElt : public Standard_Transient
{

26
src/ModelingAlgorithms/TKTopAlgo/MAT/MAT_Graph.hxx
View File

@@ -75,22 +75,22 @@ public:
//! Return the number of infinites nodes of <me>.
Standard_EXPORT Standard_Integer NumberOfInfiniteNodes() const;
//! Merge two BasicElts. The End of the BasicElt Elt1
//! of IndexElt1 becomes The End of the BasicElt Elt2
//! of IndexElt2. Elt2 is replaced in the arcs by
//! Merge two BasicElts. The End of the BasicElt Elt1
//! of IndexElt1 becomes The End of the BasicElt Elt2
//! of IndexElt2. Elt2 is replaced in the arcs by
//! Elt1, Elt2 is eliminated.
//!
//! <MergeArc1> is True if the fusion of the BasicElts =>
//! a fusion of two Arcs which separated the same elements.
//! In this case <GeomIndexArc1> and <GeomIndexArc2> are the
//! Geometric Index of this arcs.
//! <MergeArc1> is True if the fusion of the BasicElts =>
//! a fusion of two Arcs which separated the same elements.
//! In this case <GeomIndexArc1> and <GeomIndexArc2> are the
//! Geometric Index of this arcs.
//!
//! If the BasicElt corresponds to a close line ,
//! If the BasicElt corresponds to a close line,
//! the StartArc and the EndArc of Elt1 can separate the same
//! elements .
//! elements.
//! In this case there is a fusion of this arcs, <MergeArc2>
//! is true and <GeomIndexArc3> and <GeomIndexArc4> are the
//! Geometric Index of this arcs.
//! is true and <GeomIndexArc3> and <GeomIndexArc4> are the
//! Geometric Index of this arcs.
Standard_EXPORT void FusionOfBasicElts(const Standard_Integer IndexElt1,
const Standard_Integer IndexElt2,
Standard_Boolean& MergeArc1,
@@ -112,8 +112,8 @@ public:
protected:
private:
//! Merge two Arcs. the second node of <Arc2> becomes
//! the first node of <Arc1>. Update of the first
//! Merge two Arcs. the second node of <Arc2> becomes
//! the first node of <Arc1>. Update of the first
//! node and the neighbours of <Arc1>.
//! <Arc2> is eliminated.
Standard_EXPORT void FusionOfArcs(const Handle(MAT_Arc)& Arc1, const Handle(MAT_Arc)& Arc2);

2
src/ModelingAlgorithms/TKTopAlgo/MAT/MAT_Node.hxx
View File

@@ -49,7 +49,7 @@ public:
//! Returns in <S> the Arcs linked to <me>.
Standard_EXPORT void LinkedArcs(MAT_SequenceOfArc& S) const;
//! Returns in <S> the BasicElts equidistant
//! Returns in <S> the BasicElts equidistant
//! to <me>.
Standard_EXPORT void NearElts(MAT_SequenceOfBasicElt& S) const;

4
src/ModelingAlgorithms/TKTopAlgo/MAT/MAT_Zone.hxx
View File

@@ -50,8 +50,8 @@ public:
//! Return the number Of Arcs On the frontier of <me>.
Standard_EXPORT Standard_Integer NumberOfArcs() const;
//! Return the Arc number <Index> on the frontier.
//! of <me>.
//! Return the Arc number <Index> on the frontier.
//! of <me>.
Standard_EXPORT Handle(MAT_Arc) ArcOnFrontier(const Standard_Integer Index) const;
//! Return TRUE if <me> is not empty .

6
src/ModelingAlgorithms/TKTopAlgo/MAT2d/MAT2d_Connexion.hxx
View File

@@ -27,8 +27,8 @@
class MAT2d_Connexion;
DEFINE_STANDARD_HANDLE(MAT2d_Connexion, Standard_Transient)
//! A Connexion links two lines of items in a set
//! of lines. It s contains two points and their paramatric
//! A Connexion links two lines of items in a set
//! of lines. It contains two points and their paramatric
//! definitions on the lines.
//! The items can be points or curves.
class MAT2d_Connexion : public Standard_Transient
@@ -93,7 +93,7 @@ public:
Standard_EXPORT void Distance(const Standard_Real aDistance);
//! Returns the reverse connexion of <me>.
//! the firstpoint is the secondpoint.
//! the firstpoint is the secondpoint.
//! the secondpoint is the firstpoint.
Standard_EXPORT Handle(MAT2d_Connexion) Reverse() const;

30
src/ModelingAlgorithms/TKTopAlgo/MAT2d/MAT2d_MiniPath.hxx
View File

@@ -28,13 +28,13 @@
#include <MAT2d_SequenceOfSequenceOfGeometry.hxx>
class MAT2d_Connexion;
//! MiniPath computes a path to link all the lines in
//! a set of lines. The path is described as a set of
//! MiniPath computes a path to link all the lines in
//! a set of lines. The path is described as a set of
//! connexions.
//!
//! The set of connexions can be seen as an arbitrary Tree.
//! The node of the tree are the lines. The arcs of the
//! tree are the connexions. The ancestror of a line is
//! The set of connexions can be seen as an arbitrary Tree.
//! The node of the tree are the lines. The arcs of the
//! tree are the connexions. The ancestror of a line is
//! the connexion which ends on it. The children of a line
//! are the connexions which start on it.
//!
@@ -48,10 +48,10 @@ public:
Standard_EXPORT MAT2d_MiniPath();
//! Computes the path to link the lines in <Figure>.
//! the path starts on the line of index <IndStart>
//! <Sense> = True if the Circuit turns in the
//! trigonometric sense.
//! Computes the path to link the lines in <Figure>.
//! the path starts on the line of index <IndStart>
//! <Sense> = True if the Circuit turns in the
//! trigonometric sense.
Standard_EXPORT void Perform(const MAT2d_SequenceOfSequenceOfGeometry& Figure,
const Standard_Integer IndStart,
const Standard_Boolean Sense);
@@ -70,24 +70,24 @@ public:
//! E->F, F->E, E->A.
Standard_EXPORT void RunOnConnexions();
//! Returns the sequence of connexions corresponding to
//! the path.
//! Returns the sequence of connexions corresponding to
//! the path.
Standard_EXPORT const MAT2d_SequenceOfConnexion& Path() const;
//! Returns <True> if there is one Connexion which starts
//! on line designed by <Index>.
Standard_EXPORT Standard_Boolean IsConnexionsFrom(const Standard_Integer Index) const;
//! Returns the connexions which start on line
//! designed by <Index>.
//! Returns the connexions which start on line
//! designed by <Index>.
Standard_EXPORT MAT2d_SequenceOfConnexion& ConnexionsFrom(const Standard_Integer Index);
//! Returns <True> if the line designed by <Index> is
//! the root.
Standard_EXPORT Standard_Boolean IsRoot(const Standard_Integer Index) const;
//! Returns the connexion which ends on line
//! designed by <Index>.
//! Returns the connexion which ends on line
//! designed by <Index>.
Standard_EXPORT Handle(MAT2d_Connexion) Father(const Standard_Integer Index);
protected:

10
src/ModelingAlgorithms/TKTopAlgo/MAT2d/MAT2d_Tool2d.hxx
View File

@@ -62,7 +62,7 @@ public:
Standard_EXPORT Standard_Real ToleranceOfConfusion() const;
//! Creates the point at the origin of the bisector between
//! anitem and the previous item.
//! anitem and the previous item.
//! dist is the distance from the FirstPoint to <anitem>.
//! Returns the index of this point in <theGeomPnts>.
Standard_EXPORT Standard_Integer FirstPoint(const Standard_Integer anitem, Standard_Real& dist);
@@ -100,10 +100,10 @@ public:
Standard_EXPORT Standard_Boolean TrimBisector(const Handle(MAT_Bisector)& abisector,
const Standard_Integer apoint);
//! Computes the point of intersection between the
//! bisectors defined by <bisectorone> and
//! Computes the point of intersection between the
//! bisectors defined by <bisectorone> and
//! <bisectortwo> .
//! If this point exists, <intpnt> is its index
//! If this point exists, <intpnt> is its index
//! in <theGeomPnts> and Return the distance of the point
//! from the bisector else Return <RealLast>.
Standard_EXPORT Standard_Real IntersectBisector(const Handle(MAT_Bisector)& bisectorone,
@@ -130,7 +130,7 @@ public:
//! Returns the point of index <Index> in the <theGeomPnts>.
Standard_EXPORT const gp_Pnt2d& GeomPnt(const Standard_Integer Index) const;
//! Returns the vector of index <Index> in the
//! Returns the vector of index <Index> in the
//! <theGeomVecs>.
Standard_EXPORT const gp_Vec2d& GeomVec(const Standard_Integer Index) const;