OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-04 13:13:25 +03:00
Code Activity

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

Browse Source 
Fix various typos

Fixed via `codespell v2.1.dev
This commit is contained in:
luz paz
2020-12-21 11:48:18 +03:00
committed by bugmaster
parent 3b1129a546
commit b81b237fa4
165 changed files with 413 additions and 455 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/BRepMesh/BRepMesh_CircleInspector.hxx
View File

@@ -23,7 +23,7 @@
#include <gp_XYZ.hxx>
#include <NCollection_CellFilter.hxx>
//! Auxilary class to find circles shot by the given point.
//! Auxiliary class to find circles shot by the given point.
class BRepMesh_CircleInspector : public NCollection_CellFilter_InspectorXY
{
public:

2
src/BRepMesh/BRepMesh_CircleTool.hxx
View File

@@ -83,7 +83,7 @@ public:
myFaceMax = theMax;
}
//! Retruns true if cell filter contains no circle.
//! Returns true if cell filter contains no circle.
Standard_Boolean IsEmpty () const
{
return mySelector.Circles ().IsEmpty ();

2
src/BRepMesh/BRepMesh_Classifier.hxx
View File

@@ -27,7 +27,7 @@
class gp_Pnt2d;
class CSLib_Class2d;
//! Auxilary class intended for classification of points
//! Auxiliary class intended for classification of points
//! regarding internals of discrete face.
class BRepMesh_Classifier : public Standard_Transient
{

2
src/BRepMesh/BRepMesh_Context.hxx
View File

@@ -18,7 +18,7 @@
#include <IMeshTools_Context.hxx>
//! Class implemeting default context of BRepMesh algorithm.
//! Class implementing default context of BRepMesh algorithm.
//! Initializes context by default algorithms.
class BRepMesh_Context : public IMeshTools_Context
{

2
src/BRepMesh/BRepMesh_CurveTessellator.hxx
View File

@@ -70,7 +70,7 @@ private:
//! Adds internal vertices to discrete polygon.
void addInternalVertices ();
//Check deflection in 2d space for improvement of edge tesselation.
//Check deflection in 2d space for improvement of edge tessellation.
void splitByDeflection2d ();
void splitSegment (

6
src/BRepMesh/BRepMesh_DataStructureOfDelaun.hxx
View File

@@ -162,9 +162,9 @@ public: //! @name API for accessing mesh links.
Standard_EXPORT void RemoveLink(const Standard_Integer theIndex,
const Standard_Boolean isForce = Standard_False);
//! Returns indices of elements conected to the link with the given index.
//! Returns indices of elements connected to the link with the given index.
//! @param theLinkIndex index of link whose data should be retrieved.
//! @return indices of elements conected to the link.
//! @return indices of elements connected to the link.
const BRepMesh_PairOfIndex& ElementsConnectedTo(
const Standard_Integer theLinkIndex) const
{
@@ -222,7 +222,7 @@ public: //! @name API for accessing mesh elements.
public: //! @name Auxilary API
public: //! @name Auxiliary API
//! Dumps information about this structure.
//! @param theStream stream to be used for dump.

18
src/BRepMesh/BRepMesh_Delaun.cxx
View File

@@ -936,7 +936,7 @@ void BRepMesh_Delaun::frontierAdjust()
cleanupMesh();
// When the mesh has been cleaned up, try to process frontier edges
// once again to fill the possible gaps that might be occured in case of "saw" -
// once again to fill the possible gaps that might be occurred in case of "saw" -
// situation when frontier edge has a triangle at a right side, but its free
// links cross another frontieres and meshLeftPolygonOf itself can't collect
// a closed polygon.
@@ -953,7 +953,7 @@ void BRepMesh_Delaun::frontierAdjust()
//=======================================================================
//function : fillBndBox
//purpose : Add boundig box for edge defined by start & end point to
//purpose : Add bounding box for edge defined by start & end point to
// the given vector of bounding boxes for triangulation edges
//=======================================================================
void BRepMesh_Delaun::fillBndBox(IMeshData::SequenceOfBndB2d& theBoxes,
@@ -1004,7 +1004,7 @@ Standard_Boolean BRepMesh_Delaun::meshLeftPolygonOf(
if ( aRefLinkDir.SquareMagnitude() < Precision2 )
return Standard_True;
// Auxilary structures.
// Auxiliary structures.
// Bounding boxes of polygon links to be used for preliminary
// analysis of intersections
IMeshData::SequenceOfBndB2d aBoxes;
@@ -1096,7 +1096,7 @@ Standard_Boolean BRepMesh_Delaun::meshLeftPolygonOf(
// angle respect the given reference link.
// Each time the next link is found other neighbor links at the
// pivot node are marked as leprous and will be excluded from
// consideration next time until a hanging end is occured.
// consideration next time until a hanging end is occurred.
//=======================================================================
Standard_Integer BRepMesh_Delaun::findNextPolygonLink(
const Standard_Integer& theFirstNode,
@@ -1204,7 +1204,7 @@ Standard_Integer BRepMesh_Delaun::findNextPolygonLink(
//=======================================================================
//function : checkIntersection
//purpose : Check is the given link intersects the polygon boundaries.
// Returns bounding box for the given link trough the
// Returns bounding box for the given link through the
// <theLinkBndBox> parameter.
//=======================================================================
Standard_Boolean BRepMesh_Delaun::checkIntersection(
@@ -1454,7 +1454,7 @@ void BRepMesh_Delaun::killTrianglesAroundVertex(
}
}
// Add link to the survivers to avoid cycling
// Add link to the survivors to avoid cycling
theSurvivedLinks.Add( aNeighborLinkId );
killLinkTriangles( aNeighborLinkId, theLoopEdges );
}
@@ -1760,7 +1760,7 @@ void BRepMesh_Delaun::meshPolygon(IMeshData::SequenceOfInteger& thePolygon,
// In this context only intersections between frontier edges
// are possible. If intersection between edges of different
// types occured - treat this case as invalid (i.e. result
// types occurred - treat this case as invalid (i.e. result
// might not reflect the expectations).
if ( !theSkipped.IsNull() )
{
@@ -1771,7 +1771,7 @@ void BRepMesh_Delaun::meshPolygon(IMeshData::SequenceOfInteger& thePolygon,
}
else if ( aIntFlag == BRepMesh_GeomTool::PointOnSegment )
{
// Indentify chopping link
// Identify chopping link
Standard_Boolean isFirstChopping = Standard_False;
Standard_Integer aCheckPointIt = 0;
for ( ; aCheckPointIt < 2; ++aCheckPointIt )
@@ -2034,7 +2034,7 @@ void BRepMesh_Delaun::decomposeSimplePolygon(
continue;
}
// Check is the test link crosses the polygon boudaries
// Check is the test link crosses the polygon boundaries
Standard_Boolean isIntersect = Standard_False;
for ( Standard_Integer aRefLinkNodeIt = 0; aRefLinkNodeIt < 2; ++aRefLinkNodeIt )
{

6
src/BRepMesh/BRepMesh_Delaun.hxx
View File

@@ -176,7 +176,7 @@ private:
const Standard_Integer theCellsCountU,
const Standard_Integer theCellsCountV);
//! Add boundig box for edge defined by start & end point to
//! Add bounding box for edge defined by start & end point to
//! the given vector of bounding boxes for triangulation edges.
void fillBndBox (IMeshData::SequenceOfBndB2d& theBoxes,
const BRepMesh_Vertex& theV1,
@@ -212,7 +212,7 @@ private:
//! angle respect the given reference link.
//! Each time the next link is found other neighbor links at the pivot
//! node are marked as leprous and will be excluded from consideration
//! next time until a hanging end is occured.
//! next time until a hanging end is occurred.
Standard_Integer findNextPolygonLink (const Standard_Integer& theFirstNode,
const Standard_Integer& thePivotNode,
const BRepMesh_Vertex& thePivotVertex,
@@ -228,7 +228,7 @@ private:
Bnd_B2d& theNextLinkBndBox);
//! Check is the given link intersects the polygon boundaries.
//! Returns bounding box for the given link trough the theLinkBndBox parameter.
//! Returns bounding box for the given link through the theLinkBndBox parameter.
Standard_Boolean checkIntersection (const BRepMesh_Edge& theLink,
const IMeshData::SequenceOfInteger& thePolygon,
const IMeshData::SequenceOfBndB2d& thePolyBoxes,

2
src/BRepMesh/BRepMesh_Edge.hxx
View File

@@ -57,7 +57,7 @@ public:
//! Checks if the given edge and this one have the same orientation.
//! @param theOther edge to be checked against this one.
//! \retrun TRUE if edges have the same orientation, FALSE if not.
//! \return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsSameOrientation(const BRepMesh_Edge& theOther) const
{
return BRepMesh_OrientedEdge::IsEqual(theOther);

2
src/BRepMesh/BRepMesh_FaceChecker.hxx
View File

@@ -25,7 +25,7 @@
//! Auxiliary class checking wires of target face for self-intersections.
//! Explodes wires of discrete face on sets of segments using tessellation
//! data stored in model. Each segment is then checked for intersection with
//! other ones. All collisions are registerd and returned as result of check.
//! other ones. All collisions are registered and returned as result of check.
class BRepMesh_FaceChecker : public Standard_Transient
{
public: //! @name mesher API

2
src/BRepMesh/BRepMesh_GeomTool.cxx
View File

@@ -505,7 +505,7 @@ Standard_Integer BRepMesh_GeomTool::classifyPoint(
if (thePointToCheck.IsEqual(thePoint1, aPrec) ||
thePointToCheck.IsEqual(thePoint2, aPrec))
{
return -1; //coinsides with an end point
return -1; //coincides with an end point
}
return 1;

4
src/BRepMesh/BRepMesh_GeomTool.hxx
View File

@@ -57,7 +57,7 @@ public:
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
//! @param theMinPointsNb minimum nuber of points to be produced.
//! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const BRepAdaptor_Curve& theCurve,
const Standard_Real theFirstParam,
@@ -77,7 +77,7 @@ public:
//! @param theLastParam last parameter of the curve.
//! @param theLinDeflection linear deflection.
//! @param theAngDeflection angular deflection.
//! @param theMinPointsNb minimum nuber of points to be produced.
//! @param theMinPointsNb minimum number of points to be produced.
Standard_EXPORT BRepMesh_GeomTool(
const Handle(BRepAdaptor_Surface)& theSurface,
const GeomAbs_IsoType theIsoType,

2
src/BRepMesh/BRepMesh_IncrementalMesh.hxx
View File

@@ -53,7 +53,7 @@ public: //! @name mesher API
const IMeshTools_Parameters& theParameters,
const Message_ProgressRange& theRange = Message_ProgressRange());
//! Performs meshing ot the shape.
//! Performs meshing of the shape.
Standard_EXPORT virtual void Perform(const Message_ProgressRange& theRange = Message_ProgressRange()) Standard_OVERRIDE;
//! Performs meshing using custom context;

2
src/BRepMesh/BRepMesh_MeshTool.hxx
View File

@@ -151,7 +151,7 @@ public:
Standard_EXPORT void CleanFrontierLinks();
//! Erases the given set of triangles.
//! Fills map of loop edges forming the countour surrounding the erased triangles.
//! Fills map of loop edges forming the contour surrounding the erased triangles.
void EraseTriangles(const IMeshData::MapOfInteger& theTriangles,
IMeshData::MapOfIntegerInteger& theLoopEdges);

2
src/BRepMesh/BRepMesh_ModelBuilder.hxx
View File

@@ -23,7 +23,7 @@
//! Class implements interface representing tool for discrete model building.
//!
//! The following statuses should be used by default:
//! Message_Done1 - model has been sucessfully built.
//! Message_Done1 - model has been successfully built.
//! Message_Fail1 - empty shape.
//! Message_Fail2 - model has not been build due to unexpected reason.
class BRepMesh_ModelBuilder : public IMeshTools_ModelBuilder

4
src/BRepMesh/BRepMesh_ModelHealer.hxx
View File

@@ -32,7 +32,7 @@
//! tolerances of 3D space only. This means that there are no specific
//! computations are made for the sake of determination of U and V tolerance.
//! Registers intersections on edges forming the face's shape and tries to
//! amplify discrete represenation by decreasing of deflection for the target edge.
//! amplify discrete representation by decreasing of deflection for the target edge.
//! Checks can be performed in parallel mode.
class BRepMesh_ModelHealer : public IMeshTools_ModelAlgo
{
@@ -86,7 +86,7 @@ private:
//! Connects pcurves of previous and current edge on the specified face
//! according to topological connectivity. Uses next edge in order to
//! identify closest point in case of signle vertex shared between both
//! identify closest point in case of single vertex shared between both
//! ends of edge (degenerative edge)
Standard_Boolean connectClosestPoints(
const IMeshData::IPCurveHandle& thePrevDEdge,

2
src/BRepMesh/BRepMesh_ModelPreProcessor.cxx
View File

@@ -172,7 +172,7 @@ namespace
return aSteps.second;
}
//! Splits 3D and all pcurves accoring using the specified step.
//! Splits 3D and all pcurves accordingly using the specified step.
Standard_Boolean splitEdge(const IMeshData::IEdgePtr& theDEdge,
const Standard_Real theDU) const
{

2
src/BRepMesh/BRepMesh_OrientedEdge.hxx
View File

@@ -64,7 +64,7 @@ public:
//! Checks this and other edge for equality.
//! @param theOther edge to be checked against this one.
//! @retrun TRUE if edges have the same orientation, FALSE if not.
//! @return TRUE if edges have the same orientation, FALSE if not.
Standard_Boolean IsEqual(const BRepMesh_OrientedEdge& theOther) const
{
return (myFirstNode == theOther.myFirstNode && myLastNode == theOther.myLastNode);

2
src/BRepMesh/BRepMesh_PairOfIndex.hxx
View File

@@ -69,7 +69,7 @@ public:
return (myIndex[0] < 0);
}
//! Returns number of initialized indeces.
//! Returns number of initialized indices.
Standard_Integer Extent() const
{
return (myIndex[0] < 0 ? 0 : (myIndex[1] < 0 ? 1 : 2));

4
src/BRepMesh/BRepMesh_ShapeTool.cxx
View File

@@ -30,7 +30,7 @@ IMPLEMENT_STANDARD_RTTIEXT(BRepMesh_ShapeTool, Standard_Transient)
namespace
{
//! Auxilary struct to take a tolerance of edge.
//! Auxiliary struct to take a tolerance of edge.
struct EdgeTolerance
{
static Standard_Real Get(const TopoDS_Shape& theEdge)
@@ -39,7 +39,7 @@ namespace
}
};
//! Auxilary struct to take a tolerance of vertex.
//! Auxiliary struct to take a tolerance of vertex.
struct VertexTolerance
{
static Standard_Real Get(const TopoDS_Shape& theVertex)

8
src/BRepMesh/BRepMesh_Triangulator.cxx
View File

@@ -134,7 +134,7 @@ Standard_Boolean BRepMesh_Triangulator::Perform (NCollection_List<Poly_Triangle>
//=======================================================================
//function : addTriange34
//purpose : auxilary for makeTrianglesUsingBRepMesh
//purpose : auxiliary for makeTrianglesUsingBRepMesh
//=======================================================================
void BRepMesh_Triangulator::addTriange34(
const TColStd_SequenceOfInteger& theW,
@@ -178,7 +178,7 @@ void BRepMesh_Triangulator::addTriange34(
//=======================================================================
//function : checkCondition
//purpose : auxilary for addTriange34
//purpose : auxiliary for addTriange34
//=======================================================================
Standard_Boolean BRepMesh_Triangulator::checkCondition(
const int (&theNodes)[4],
@@ -204,7 +204,7 @@ Standard_Boolean BRepMesh_Triangulator::prepareMeshStructure ()
myIndices = new IMeshData::VectorOfInteger (wireNodesNb(myWires));
myMeshStructure = new BRepMesh_DataStructureOfDelaun (new NCollection_IncAllocator);
// fill this structure created BRepMesh_Vertexes using 2d points recieved
// fill this structure created BRepMesh_Vertexes using 2d points received
// by projection initial 3d point on plane.
try
{
@@ -242,7 +242,7 @@ Standard_Boolean BRepMesh_Triangulator::prepareMeshStructure ()
//=======================================================================
//function : triangulate
//purpose : auxilary
//purpose : auxiliary
//=======================================================================
Standard_Boolean BRepMesh_Triangulator::triangulate (NCollection_List<Poly_Triangle>& thePolyTriangles)
{

10
src/BRepMesh/BRepMesh_Triangulator.hxx
View File

@@ -31,7 +31,7 @@
class Message_Messenger;
//! Auxilary tool to generate triangulation
//! Auxiliary tool to generate triangulation
class BRepMesh_Triangulator
{
public:
@@ -51,7 +51,7 @@ public:
const NCollection_List<TColStd_SequenceOfInteger>& theWires,
const gp_Dir& theNorm);
//! Perfroms triangulation of source wires and stores triangles the the output list.
//! Performs triangulation of source wires and stores triangles the the output list.
Standard_EXPORT Standard_Boolean Perform (NCollection_List<Poly_Triangle>& thePolyTriangles);
//! Set messenger for output information
@@ -65,12 +65,12 @@ public:
private:
// auxilary for makeTrianglesUsingBRepMesh
// auxiliary for makeTrianglesUsingBRepMesh
void addTriange34 (
const TColStd_SequenceOfInteger& theW,
NCollection_List<Poly_Triangle>& thePolyTriangles);
// auxilary for addTriange34
// auxiliary for addTriange34
Standard_Boolean checkCondition(
const int (&theNodes)[4],
const TColStd_SequenceOfInteger& theWire);
@@ -78,7 +78,7 @@ private:
// performs initialization of mesh data structure.
Standard_Boolean prepareMeshStructure();
// auxilary for triangulation
// auxiliary for triangulation
Standard_Boolean triangulate (NCollection_List<Poly_Triangle>& thePolyTriangles);
private:

12
src/BRepMesh/delabella.cpp
View File

@@ -216,7 +216,7 @@ struct CDelaBella : IDelaBella
int points = inp_verts;
std::sort(vert_alloc, vert_alloc + points);
// rmove dups
// remove dups
{
int w = 0, r = 1; // skip initial no-dups block
while (r < points && !Vert::overlap(vert_alloc + r, vert_alloc + w))
@@ -261,7 +261,7 @@ struct CDelaBella : IDelaBella
else
{
if (errlog_proc)
errlog_proc(errlog_file, "[WRN] all input points are identical, returning signle point!\n");
errlog_proc(errlog_file, "[WRN] all input points are identical, returning single point!\n");
first_hull_vert = vert_alloc + 0;
vert_alloc[0].next = 0;
}
@@ -333,7 +333,7 @@ struct CDelaBella : IDelaBella
// so we calc all signs...
// why not testing sign of dot prod of 2 normals?
// that way we'd fall into precission problems
// that way we'd fall into precision problems
Norm LvH = (*v - *last).cross(*head - *last);
bool lvh =
@@ -614,7 +614,7 @@ struct CDelaBella : IDelaBella
Face* _f = hull;
// 1. FIND FIRST VISIBLE FACE
// simply iterate around last vertex using last added triange adjecency info
// simply iterate around last vertex using last added triangle adjecency info
while (_f->dot(*_q) <= 0)
{
_f = _f->Next(_p);
@@ -725,8 +725,8 @@ struct CDelaBella : IDelaBella
}
// if add<del+2 hungry hull has consumed some point
// that means we can't do delaunay for some under precission reasons
// althought convex hull would be fine with it
// that means we can't do delaunay for some under precision reasons
// although convex hull would be fine with it
assert(add == del + 2);
// 3. SEW SIDES OF CONE BUILT ON SLIHOUTTE SEGMENTS