STYLE: Correcting typos

applications/utilities/mesh/advanced/snappyRefineMesh/snappyRefineMesh.C

@@ -631,7 +631,7 @@ int main(int argc, char *argv[])
     #include "createTime.H"
     #include "createPolyMesh.H"
 
-    // If nessecary add oldInternalFaces patch
+    // If necessary add oldInternalFaces patch
     label newPatchi = addPatch(mesh, "oldInternalFaces");
 
 

applications/utilities/mesh/conversion/gambitToFoam/gambitToFoam.L

@@ -311,7 +311,7 @@ mtype                 {space}"MTYPE:"{space}
         scalar y = readScalar(nodeStream);
         scalar z = readScalar(nodeStream);
 
-        // add mapping and scalced node to the list
+        // add mapping and scaled node to the list
         pointMap[curNumberOfNodes] = nodeI;
         points[curNumberOfNodes] = point(x, y, z);
         curNumberOfNodes++;

applications/utilities/mesh/generation/extrude/extrudeToRegionMesh/extrudeToRegionMesh.C

@@ -718,7 +718,7 @@ void countExtrudePatches
             }
         }
     }
-    // Synchronise decistion. Actual numbers are not important, just make
+    // Synchronise decision. Actual numbers are not important, just make
     // sure that they're > 0 on all processors.
     Pstream::listCombineGather(zoneSidePatch, plusEqOp<label>());
     Pstream::listCombineScatter(zoneSidePatch);
@@ -2428,7 +2428,7 @@ int main(int argc, char *argv[])
             meshMod
         );
 
-        // Enforce actual point posititions according to extrudeModel (model)
+        // Enforce actual point positions according to extrudeModel (model)
         // (extruder.setRefinement only does fixed expansionRatio)
         // The regionPoints and nLayers are looped in the same way as in
         // createShellMesh

applications/utilities/mesh/generation/foamyMesh/conformalVoronoi2DMesh/cv2DControls/cv2DControls.H

@@ -81,15 +81,15 @@ public:
 
         // Controls
 
-            //- Minimum cell size below which protusions through the surface are
-            //  not split
+            //- Minimum cell size below which protrusions through the surface
+            //- are not split
             scalar minCellSize_;
 
             //- Square of minCellSize
             scalar minCellSize2_;
 
             //- Maximum quadrant angle allowed at a concave corner before
-            //  additional "mitering" lines are added
+            //- additional "mitering" lines are added
             scalar maxQuadAngle_;
 
             //- Near-wall region where cells are aligned with the wall
@@ -126,22 +126,22 @@ public:
             //- Square of span
             scalar span2_;
 
-            //- Minumum edge-length of the cell size below which protusions
-            //  through the surface are not split
+            //- Minimum edge-length of the cell size below which protrusions
+            //- through the surface are not split
             scalar minEdgeLen_;
 
             //- Square of minEdgeLen
             scalar minEdgeLen2_;
 
             //- Maximum notch size below which protusions into the surface are
-            //  not filled
+            //- not filled
             scalar maxNotchLen_;
 
             //- Square of maxNotchLen
             scalar maxNotchLen2_;
 
-            //- The minimum distance alowed between a dual-cell vertex
-            // and the surface before a point-pair is introduced
+            //- The minimum distance allowed between a dual-cell vertex
+            //- and the surface before a point-pair is introduced
             scalar minNearPointDist_;
 
             //- Square of minNearPoint

applications/utilities/mesh/generation/foamyMesh/conformalVoronoiMesh/conformalVoronoiMesh/conformalVoronoiMesh.H

@@ -439,7 +439,7 @@ private:
         ) const;
 
         //- Check to see if dual cell specified by given vertex iterator
-        //  intersects the boundary and hence reqires a point-pair
+        //  intersects the boundary and hence requires a point-pair
         bool dualCellSurfaceAnyIntersection
         (
             const Delaunay::Finite_vertices_iterator& vit
@@ -726,7 +726,7 @@ private:
 
         label classifyBoundaryPoint(Cell_handle cit) const;
 
-        //- Index all of the the Delaunay cells and calculate their dual points
+        //- Index all of the Delaunay cells and calculate their dual points
         void indexDualVertices
         (
             pointField& pts,

applications/utilities/mesh/generation/foamyMesh/conformalVoronoiMesh/conformalVoronoiMesh/conformalVoronoiMeshFeaturePoints.C

@@ -513,7 +513,7 @@ void Foam::conformalVoronoiMesh::createExternalEdgePointGroup
     // Convex. So refPt will be inside domain and hence a master point
     Foam::point refPt = edgePt - ppDist*refVec;
 
-    // Insert the master point pairing the the first slave
+    // Insert the master point pairing the first slave
 
     if (!geometryToConformTo_.inside(refPt))
     {
@@ -532,7 +532,7 @@ void Foam::conformalVoronoiMesh::createExternalEdgePointGroup
     );
 
     // Insert the slave points by reflecting refPt in both faces.
-    // with each slave refering to the master
+    // with each slave referring to the master
 
     Foam::point reflectedA = refPt + 2*ppDist*nA;
     pts.append

applications/utilities/mesh/generation/foamyMesh/conformalVoronoiMesh/initialPointsMethod/autoDensity/autoDensity.C

@@ -636,7 +636,7 @@ bool Foam::autoDensity::fillBox
         }
 
         // Using the sampledPoints as the first test locations as they are
-        // randomly shuffled, but unfiormly sampling space and have wellInside
+        // randomly shuffled, but uniformly sampling space and have wellInside
         // and size data already
 
         maxDensity = 1/pow3(max(minCellSize, SMALL));

applications/utilities/mesh/generation/foamyMesh/foamyHexMesh/foamyHexMeshDict

@@ -422,7 +422,7 @@ polyMeshFiltering
 
     // Maximum number of times an to allow an equal faceSet to be
     // returned from the face quality assessment before stopping iterations
-    // to break an infinitie loop.
+    // to break an infinite loop.
     maxConsecutiveEqualFaceSets             5;
     // Remove little steps (almost perp to surface) by collapsing face.
     surfaceStepFaceAngle                    80;

applications/utilities/mesh/generation/foamyMesh/foamyQuadMesh/CV2D.C

@@ -590,7 +590,7 @@ void Foam::CV2D::newPoints()
                     0.5*(sizes[vA->index()] + sizes[vB->index()]);
 
                 // Test for changing aspect ratio on second alignment (first
-                // alignment is neartest surface normal)
+                // alignment is nearest surface normal)
                 // if (aD == 1)
                 // {
                 //     targetFaceSize *= 2.0;
@@ -773,7 +773,7 @@ void Foam::CV2D::newPoints()
                 if (!is_infinite(ec)) break;
             } while (++ec != ecStart);
 
-            // Store the start-end of the first non-infinte edge
+            // Store the start-end of the first non-infinite edge
             point2D de0 = toPoint2D(circumcenter(ec->first));
 
             // Keep track of the maximum edge length^2

applications/utilities/mesh/generation/foamyMesh/foamyQuadMesh/CV2D.H

@@ -33,10 +33,10 @@ Description
 
     // Min cell size used in tolerances when inserting points for
     // boundary conforming.
-    // Also used to as the grid spacing usind in insertGrid.
+    // Also used to as the grid spacing using in insertGrid.
     minCellSize  0.05;
 
-    // Feature angle used to inser feature points
+    // Feature angle used to insert feature points
     // 0 = all features, 180 = no features
     featureAngle 45;
 
@@ -185,7 +185,7 @@ private:
         //- Keep track of the boundary conform point-pairs
         //  stored after the insertion of the surface point-pairs in case
         //  the boundary conform function is called more than once without
-        //  removing and insertin the surface point-pairs
+        //  removing and inserting the surface point-pairs
         label startOfBoundaryConformPointPairs_;
 
         //- Store the feature points
@@ -268,7 +268,7 @@ private:
         );
 
         //- Check to see if dual cell specified by given vertex iterator
-        //  intersects the boundary and hence reqires a point-pair.
+        //  intersects the boundary and hence requires a point-pair.
         bool dualCellSurfaceIntersection
         (
             const Triangulation::Finite_vertices_iterator& vit
@@ -311,7 +311,7 @@ private:
 
         void markNearBoundaryPoints();
 
-        //- Restore the Delaunay contraint
+        //- Restore the Delaunay constraint
         void fast_restore_Delaunay(Vertex_handle vh);
 
         // Flip operations used by fast_restore_Delaunay

applications/utilities/mesh/generation/foamyMesh/foamyQuadMesh/indexedVertex.H

@@ -169,14 +169,14 @@ public:
 
     // Friend Functions
 
-        //- Do the two given vertices consitute a boundary point-pair
+        //- Do the two given vertices constitute a boundary point-pair
         friend bool pointPair <Gt, Vb>
         (
             const indexedVertex<Gt, Vb>& v0,
             const indexedVertex<Gt, Vb>& v1
         );
 
-        //- Do the three given vertices consitute a boundary triangle
+        //- Do the three given vertices constitute a boundary triangle
         friend bool boundaryTriangle <Gt, Vb>
         (
             const indexedVertex<Gt, Vb>& v0,
@@ -184,7 +184,7 @@ public:
             const indexedVertex<Gt, Vb>& v2
         );
 
-        //- Do the three given vertices consitute an outside triangle
+        //- Do the three given vertices constitute an outside triangle
         friend bool outsideTriangle <Gt, Vb>
         (
             const indexedVertex<Gt, Vb>& v0,

applications/utilities/mesh/generation/foamyMesh/foamyQuadMesh/insertSurfaceNearestPointPairs.C

@@ -49,7 +49,7 @@ bool Foam::CV2D::dualCellSurfaceIntersection
 
             point e1 = toPoint3D(circumcenter(ec->first->neighbor(ec->second)));
 
-            // If other edge end is ouside bounding box then edge cuts boundary
+            // If other edge end is outside bounding box then edge cuts boundary
             if (!qSurf_.globalBounds().contains(e1))
             {
                 return true;

applications/utilities/mesh/generation/snappyHexMesh/snappyHexMesh.C

@@ -1319,7 +1319,7 @@ int main(int argc, char *argv[])
                 }
 
                 // For now: have single faceZone per surface. Use first
-                // region in surface for patch for zoneing
+                // region in surface for patch for zoning
                 if (regNames.size())
                 {
                     label globalRegioni = surfaces.globalRegion(surfi, 0);

applications/utilities/mesh/generation/snappyHexMesh/snappyHexMeshDict

@@ -277,7 +277,7 @@ castellatedMeshControls
     // in a given geometric region. The syntax is exactly the same as for the
     // refinementRegions; the cell level now specifies the upper limit
     // for any cell. Note that it does not override the refinement constraints
-    // given by the nCellsBetweenLevels settting.
+    // given by the nCellsBetweenLevels setting.
     limitRegions
     {
     }

applications/utilities/mesh/manipulation/createPatch/createPatch.C

@@ -464,7 +464,7 @@ void syncPoints
     }
 
     //- Note: hasTransformation is only used for warning messages so
-    //  reduction not strictly nessecary.
+    //  reduction not strictly necessary.
     //reduce(hasTransformation, orOp<bool>());
 
     // Synchronize multiple shared points.

applications/utilities/mesh/manipulation/mergeOrSplitBaffles/mergeOrSplitBaffles.C

@@ -244,7 +244,7 @@ labelList findBaffles(const polyMesh& mesh, const labelList& boundaryFaces)
     }
 
 
-    // Write to faceSet for ease of postprocessing.
+    // Write to faceSet for ease of post-processing.
     {
         faceSet duplicateSet
         (

applications/utilities/mesh/manipulation/mirrorMesh/mirrorFvMesh.C

@@ -112,7 +112,7 @@ Foam::mirrorFvMesh::mirrorFvMesh(const IOobject& io)
 
     // Algorithm:
     // During mirroring, the faces that were previously boundary faces
-    // in the mirror plane may become ineternal faces. In order to
+    // in the mirror plane may become internal faces. In order to
     // deal with the ordering of the faces, the algorithm is split
     // into two parts.  For original faces, the internal faces are
     // distributed to their owner cells.  Once all internal faces are

applications/utilities/mesh/manipulation/polyDualMesh/meshDualiser.C

@@ -278,7 +278,7 @@ Foam::label Foam::meshDualiser::addInternalFace
         //    << " points:" << UIndirectList<point>(meshMod.points(), newFace)
         //    << " n:" << n
         //    << " between dualowner:" << dualCell0
-        //    << " dualneigbour:" << dualCell1
+        //    << " dualneighbour:" << dualCell1
         //    << endl;
     }
     else
@@ -305,7 +305,7 @@ Foam::label Foam::meshDualiser::addInternalFace
         //    << " points:" << UIndirectList<point>(meshMod.points(), newFace)
         //    << " n:" << n
         //    << " between dualowner:" << dualCell1
-        //    << " dualneigbour:" << dualCell0
+        //    << " dualneighbour:" << dualCell0
         //    << endl;
     }
     return dualFacei;
@@ -1139,7 +1139,7 @@ void Foam::meshDualiser::setRefinement
         );
     }
     // Detect whether different dual cells on either side of a face. This
-    // would neccesitate having a dual face built from the face and thus a
+    // would necessitate having a dual face built from the face and thus a
     // dual point at the face centre.
     for (label facei = 0; facei < mesh_.nInternalFaces(); facei++)
     {

applications/utilities/mesh/manipulation/renumberMesh/renumberMesh.C

@@ -63,7 +63,7 @@ Description
 using namespace Foam;
 
 
-// Create named field from labelList for postprocessing
+// Create named field from labelList for post-processing
 tmp<volScalarField> createScalarField
 (
     const fvMesh& mesh,

applications/utilities/mesh/manipulation/renumberMesh/renumberMeshDict

@@ -26,7 +26,7 @@ sortCoupledFaceCells false;
 // blockCoeffs dictionary to construct a decompositionMethod to do
 // a block subdivision) and then applies the renumberMethod to each
 // block in turn. This can be used in large cases to keep the blocks
-// fitting in cache with all the the cache misses bunched at the end.
+// fitting in cache with all the cache misses bunched at the end.
 // This number is the approximate size of the blocks - this gets converted
 // to a number of blocks that is the input to the decomposition method.
 //blockSize 1000;