kindred/create
1
1
Fork 0
Code Issues 37 Pull Requests Actions Packages Projects 9 Releases 2 Wiki Activity

Misc. typo fixes

Browse Source 
Various workbenches
This commit is contained in:
Unknown
2017-12-23 07:59:21 -05:00
committed by wmayer
parent 3df389f5f2
commit a8ecffb652
98 changed files with 169 additions and 169 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/Mod/Mesh/App/AppMeshPy.cpp
View File

@@ -127,7 +127,7 @@ public:
);
initialize("The functions in this module allow working with mesh objects.\n"
"A set of functions are provided for reading in registered mesh\n"
"file formats to either a new or exising document.\n"
"file formats to either a new or existing document.\n"
"\n"
"open(string) -- Create a new document and a Mesh feature\n"
" to load the file into the document.\n"

12
src/Mod/Mesh/App/Core/Algorithm.cpp
View File

@@ -932,12 +932,12 @@ void MeshAlgorithm::GetFacetsFromToolMesh(const MeshKernel& rToolMesh, const Bas
MeshAlgorithm cToolAlg(rToolMesh);
// To speed up the algorithm we use the grid built up from the associated mesh. For each grid
// element we check whether it lies completely inside or outside the toolmesh or even intersect
// element we check whether it lies completely inside or outside the toolmesh or even intersects
// with the toolmesh. So we can reduce the number of facets with further tests dramatically.
// If the grid box is outside the toolmesh all the facets inside can be skipped. If the grid
// box is inside the toolmesh all facets are stored with no further tests because they must
// also lie inside the toolmesh. Finally, if the grid box intersect with the toolmesh we must
// also check for each whether it intersect we the toolmesh as well.
// also lie inside the toolmesh. Finally, if the grid box intersects with the toolmesh we must
// also check for each whether it intersects with the toolmesh as well.
std::vector<unsigned long> aulInds;
for (clGridIter.Init(); clGridIter.More(); clGridIter.Next()) {
int ret = cToolAlg.Surround(clGridIter.GetBoundBox(), rcDir);
@@ -947,15 +947,15 @@ void MeshAlgorithm::GetFacetsFromToolMesh(const MeshKernel& rToolMesh, const Bas
// these facets can be removed without more checks
clGridIter.GetElements(raclCutted);
}
// the box intersect with toolmesh
// the box intersects with toolmesh
else if (ret == 0) {
// these facets must be tested for intersectons with the toolmesh
// these facets must be tested for intersections with the toolmesh
clGridIter.GetElements(aulInds);
}
// the box is outside the toolmesh but this could still mean that the triangles
// inside the grid intersect with the toolmesh
else if (ret == -1) {
// these facets must be tested for intersectons with the toolmesh
// these facets must be tested for intersections with the toolmesh
clGridIter.GetElements(aulInds);
}
}

2
src/Mod/Mesh/App/Core/Evaluation.cpp
View File

@@ -233,7 +233,7 @@ std::vector<unsigned long> MeshEvalOrientation::GetIndices() const
ulStartFacet = ULONG_MAX;
}
// in some very rare cases where we have some strange artefacts in the mesh structure
// in some very rare cases where we have some strange artifacts in the mesh structure
// we get false-positives. If we find some we check all 'invalid' faces again
cAlg.ResetFacetFlag(MeshFacet::TMP0);
cAlg.SetFacetsFlag(uIndices, MeshFacet::TMP0);

2
src/Mod/Mesh/App/Core/Evaluation.h
View File

@@ -104,7 +104,7 @@ private:
/**
* This class searches for inconsistent orientation of neighboured facets.
* Note: The 'TMP0' flag for facets must be resetted before using this class.
* Note: The 'TMP0' flag for facets must be reset before using this class.
* @author Werner Mayer
*/
class MeshExport MeshOrientationCollector : public MeshOrientationVisitor

4
src/Mod/Mesh/App/Core/Iterator.h
View File

@@ -59,7 +59,7 @@ public:
/** @name Transformation */
//@{
/// Transforms the returned facet points with the current tranformation
/// Transforms the returned facet points with the current transformation
inline void Transform( const Base::Matrix4D& rclTrf );
//@}
@@ -180,7 +180,7 @@ public:
/** @name Transformation */
//@{
/// Transforms the returned points with the current tranformation
/// Transforms the returned points with the current transformation
inline void Transform( const Base::Matrix4D& rclTrf );
//@}

2
src/Mod/Mesh/App/Core/SetOperations.cpp
View File

@@ -531,7 +531,7 @@ bool SetOperations::CollectFacetVisitor::AllowVisit (const MeshFacet& rclFacet,
if (it != _edges.end()) {
if (_addFacets == -1) {
// detemine if the facets shoud add or not only once
// determine if the facets should add or not only once
MeshGeomFacet facet = _mesh.GetFacet(rclFrom); // triangulated facet
MeshGeomFacet facetOther = it->second.facets[1-_side][0]; // triangulated facet from same edge and other mesh
Vector3f normalOther = facetOther.GetNormal();

4
src/Mod/Mesh/App/Core/Triangulation.h
View File

@@ -79,11 +79,11 @@ public:
const std::vector<MeshGeomFacet>& GetTriangles() const { return _triangles;}
/** Returns the topologic facets of the polygon. */
const std::vector<MeshFacet>& GetFacets() const { return _facets;}
/** Returns the the triangle to a given topologic facet. */
/** Returns the triangle to a given topologic facet. */
virtual MeshGeomFacet GetTriangle(const MeshPointArray&, const MeshFacet&) const;
/** Returns the length of the polygon */
float GetLength() const;
/** Get information about the pol<gons that were processed.
/** Get information about the polygons that were processed.
* It returns an array of the number of edges for each closed
* polygon.
*/

2
src/Mod/Mesh/App/GTSAlgos.cpp
View File

@@ -245,7 +245,7 @@ GtsSurface* GTSAlgos::createGTSSurface(const Mesh::MeshObject& Mesh)
Base::Vector3f Vertex;
// Geting all the points
// Getting all the points
GtsVertex ** aVertex = (GtsVertex **) malloc(Mesh.getKernel().CountPoints() * sizeof (GtsVertex *));
for (unsigned int PIter = 0;PIter < Mesh.getKernel().CountPoints(); PIter++)
{