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

Misc. typos

Browse Source
This commit is contained in:
Unknown
2017-12-06 11:17:50 -05:00
committed by wmayer
parent 1628e57409
commit f5146508bb
19 changed files with 24 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/Mod/Draft/Resources/icons/Draft_Stretch.svg
View File

@@ -272,7 +272,7 @@
<rdf:li />
</rdf:Bag>
</dc:subject>
<dc:description>A small square in the bottom left corner of a large dotted box ith an arrow pointing from the top left corner of the inner box to the top left corner of the outer box</dc:description>
<dc:description>A small square in the bottom left corner of a large dotted box with an arrow pointing from the top left corner of the inner box to the top left corner of the outer box</dc:description>
</cc:Work>
</rdf:RDF>
</metadata>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 11 KiB

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

@@ -148,8 +148,8 @@ public:
*/
void GetMeshBorder(unsigned long uFacet, std::list<unsigned long>& rBorder) const;
/**
* Boundaries that consist of several loops must be splitted in several independent boundaries
* to perfoom e.g. a polygon triangulation algorithm on them.
* Boundaries that consist of several loops must be split in several independent boundaries
* to perform e.g. a polygon triangulation algorithm on them.
*/
void SplitBoundaryLoops( std::list<std::vector<unsigned long> >& aBorders );
/**

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

@@ -59,7 +59,7 @@ public:
/** @name Topological Operations */
//@{
/**
* Inserts a new vertex in the given triangle so that is splitted into three
* Inserts a new vertex in the given triangle so that is split into three
* triangles. The given point must lie inside the triangle not outside or on
* an edge.
*/
@@ -106,7 +106,7 @@ public:
* \a rP1 and \a rP2 should lie on two different edges of the facet. This method
* splits up the both neighbour facets as well.
* If either \a rP1 or \a rP2 (probably due to a previous call of SplitFacet())
* is coincident with a corner point then the facet is splitted into two facets.
* is coincident with a corner point then the facet is split into two facets.
* If both points are coincident with corner points of this facet nothing is done.
*/
void SplitFacet(unsigned long ulFacetPos, const Base::Vector3f& rP1,

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

@@ -35,7 +35,7 @@
namespace Mesh
{
/** The mesh algorithems container class
/** The mesh algorithms container class
*/
class MeshExport GTSAlgos
{

2
src/Mod/Mesh/Gui/SoFCMeshFaceSet.h
View File

@@ -109,7 +109,7 @@ protected:
/**
* \brief The SoFCMeshFaceSet class renders the mesh data structure.
* It does basically the same as SoFCMeshNode by rendering directly the FreeCAD mesh structure whereas this class follows more the Inventor way.
* While SoFCMeshFaceSet has a pointer to the mesh structure as a whole for SoFCMeshFaceSet the mesh is splitted into two nodes:
* While SoFCMeshFaceSet has a pointer to the mesh structure as a whole for SoFCMeshFaceSet the mesh is split into two nodes:
* an SoFCMeshVertex has a field that holds a pointer to vertex array and SoFCMeshFacet has a field that holds a pointer to the face array.
*
* The advantage of separating the mesh structure is higher flexibility. E.g. to render open edges the class SoFCMeshOpenEdgeSet just takes the

2
src/Mod/MeshPart/App/CurveProjector.h
View File

@@ -51,7 +51,7 @@ using MeshCore::MeshGeomFacet;
namespace MeshPart
{
/** The father of all projection algorithems
/** The father of all projection algorithms
*/
class MeshPartExport CurveProjector
{

2
src/Mod/MeshPart/App/MeshAlgos.h
View File

@@ -47,7 +47,7 @@ using MeshCore::MeshKernel;
namespace MeshPart
{
/** The mesh algorithems container class
/** The mesh algorithms container class
*/
class MeshPartExport MeshAlgos
{

2
src/Mod/Part/App/TopoShape.cpp
View File

@@ -2483,7 +2483,7 @@ TopoDS_Shape TopoShape::makeOffset2D(double offset, short joinType, bool fill, b
offsetShape = mkOffset.Shape();
if(offsetShape.IsNull())
throw Base::Exception("makeOffset2D: result of offseting is null!");
throw Base::Exception("makeOffset2D: result of offsetting is null!");
//Copying shape to fix strange orientation behavior, OCC7.0.0. See bug #2699
// http://www.freecadweb.org/tracker/view.php?id=2699

4
src/Mod/Part/App/TopologyPy.h
View File

@@ -37,8 +37,8 @@ namespace Part
{
/** The TopoDSShape wrapper class
* This class wrapps the functionality of the Topology package. It wrapps not
* strictly after the OCC rules. It includes also a lot algorithems from oter
* This class wraps the functionality of the Topology package. It wraps not
* strictly after the OCC rules. It also includes a lot of algorithms from other
* packages like BRepTools and BRepBuilder. Also iterators and so on.
*/
class AppPartExport TopoShapePyOld :public Base::PyObjectBase

2
src/Mod/Path/App/Area.cpp
View File

@@ -1733,7 +1733,7 @@ TopoDS_Shape Area::getShape(int index) {
}
// for pocketing, we discard the outer most offset wire in order to achieve
// the effect of offseting shape first than pocket, where the actual offset
// the effect of offsetting shape first than pocket, where the actual offset
// path is not wanted. For extra outline profiling, add extra_offset
if(front) {
areaPocket.add(toShape(*areas.front(),myParams.Fill));

2
src/Mod/Path/App/AreaPyImp.cpp
View File

@@ -119,7 +119,7 @@ static const PyMethodDef areaOverrides[] = {
"\nThe first shape's wires will be unioned together regardless of the op code given\n"
"(except for 'Compound'). Subsequent shape's wire will be combined using the op code.\n"
"All shape wires shall be coplanar, and are used to determine a working plane for face\n"
"making and offseting. You can call setPlane() to supply a reference shape to determine\n"
"making and offsetting. You can call setPlane() to supply a reference shape to determine\n"
"the workplane in case the added shapes are all colinear lines.\n",
},

6
src/Mod/Path/PathScripts/PathDressupRampEntry.py
View File

@@ -321,7 +321,7 @@ class ObjectDressup:
while not done:
for i, redge in enumerate(rampedges):
if redge.Length >= rampremaining:
# will reach end of ramp within this edge, needs to be splitted
# will reach end of ramp within this edge, needs to be split
p1 = self.getSplitPoint(redge, rampremaining)
splitEdge = PathGeom.splitEdgeAt(redge, p1)
PathLog.debug("Ramp remaining: {}".format(rampremaining))
@@ -387,7 +387,7 @@ class ObjectDressup:
while not done:
for i, redge in enumerate(rampedges):
if redge.Length >= rampremaining:
# will reach end of ramp within this edge, needs to be splitted
# will reach end of ramp within this edge, needs to be split
p1 = self.getSplitPoint(redge, rampremaining)
splitEdge = PathGeom.splitEdgeAt(redge, p1)
PathLog.debug("Got split edge (index: {}) with lengths: {}, {}".format(i, splitEdge[0].Length, splitEdge[1].Length))
@@ -454,7 +454,7 @@ class ObjectDressup:
else:
for i, redge in enumerate(rampedges):
if redge.Length >= rampremaining:
# this edge needs to be splitted
# this edge needs to be split
p1 = self.getSplitPoint(redge, rampremaining)
splitEdge = PathGeom.splitEdgeAt(redge, p1)
PathLog.debug("Got split edges with lengths: {}, {}".format(splitEdge[0].Length, splitEdge[1].Length))