mirror of
https://develop.openfoam.com/Development/openfoam.git
synced 2025-11-28 03:28:01 +00:00
STYLE: Correcting typos
This commit is contained in:
@ -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
|
||||
|
||||
@ -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
|
||||
|
||||
@ -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,
|
||||
|
||||
@ -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
|
||||
|
||||
@ -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));
|
||||
|
||||
@ -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;
|
||||
|
||||
@ -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
|
||||
|
||||
@ -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
|
||||
|
||||
@ -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,
|
||||
|
||||
@ -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;
|
||||
|
||||
@ -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);
|
||||
|
||||
@ -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
|
||||
{
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user