zhyang-dev/openfoam
1
0
Fork 0
mirror of https://develop.openfoam.com/Development/openfoam.git synced 2025-11-28 03:28:01 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Further standardization of loop index naming: pointI -> pointi, patchI -> patchi

Browse Source
This commit is contained in:
Henry Weller
2016-05-18 21:20:42 +01:00
parent ac632e7984
commit 67de20df25
365 changed files with 4877 additions and 4877 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
applications/utilities/surface/surfaceHookUp/surfaceHookUp.C
View File

@ -44,13 +44,13 @@ Usage
using namespace Foam;
// Split facei along edgeI at position newPointI
// Split facei along edgeI at position newPointi
void greenRefine
(
const triSurface& surf,
const label facei,
const label edgeI,
const label newPointI,
const label newPointi,
DynamicList<labelledTri>& newFaces
)
{
@ -71,7 +71,7 @@ void greenRefine
labelledTri
(
f[fp0],
newPointI,
newPointi,
f[fp2],
f.region()
)
@ -80,7 +80,7 @@ void greenRefine
(
labelledTri
(
newPointI,
newPointi,
f[fp1],
f[fp2],
f.region()
@ -94,7 +94,7 @@ void greenRefine
labelledTri
(
f[fp2],
newPointI,
newPointi,
f[fp1],
f.region()
)
@ -103,7 +103,7 @@ void greenRefine
(
labelledTri
(
newPointI,
newPointi,
f[fp0],
f[fp1],
f.region()
@ -383,14 +383,14 @@ int main(int argc, char *argv[])
const labelListList& pointEdges = surf.pointEdges();
forAll(bPointsTobEdges, bPointI)
forAll(bPointsTobEdges, bPointi)
{
pointIndexHit& nearestHit = bPointsTobEdges[bPointI];
pointIndexHit& nearestHit = bPointsTobEdges[bPointi];
const label pointI = surf.boundaryPoints()[bPointI];
const point& samplePt = surf.localPoints()[pointI];
const label pointi = surf.boundaryPoints()[bPointi];
const point& samplePt = surf.localPoints()[pointi];
const labelList& pEdges = pointEdges[pointI];
const labelList& pEdges = pointEdges[pointi];
// Add edges connected to the edge to the shapeMask
DynamicList<label> shapeMask;
@ -428,7 +428,7 @@ int main(int argc, char *argv[])
)
{
nearestHit = currentHit;
bPointsHitTree[bPointI] = treeI;
bPointsHitTree[bPointi] = treeI;
}
}
@ -441,7 +441,7 @@ int main(int argc, char *argv[])
// (
// surf,
// nearestHit.index(),
// pointI,
// pointi,
// 30
// );
@ -452,20 +452,20 @@ int main(int argc, char *argv[])
}
}
forAll(bPointsTobEdges, bPointI)
forAll(bPointsTobEdges, bPointi)
{
const pointIndexHit& eHit = bPointsTobEdges[bPointI];
const pointIndexHit& eHit = bPointsTobEdges[bPointi];
if (eHit.hit())
{
const label hitSurfI = bPointsHitTree[bPointI];
const label hitSurfI = bPointsHitTree[bPointi];
const triSurface& hitSurf = newSurfaces[hitSurfI];
const label eIndex =
treeBoundaryEdges[hitSurfI][eHit.index()];
const edge& e = hitSurf.edges()[eIndex];
const label pointI = surf.boundaryPoints()[bPointI];
const label pointi = surf.boundaryPoints()[bPointi];
const labelList& eFaces = hitSurf.edgeFaces()[eIndex];
@ -487,7 +487,7 @@ int main(int argc, char *argv[])
DynamicList<labelledTri> newFacesFromSplit(2);
const point& pt = surf.localPoints()[pointI];
const point& pt = surf.localPoints()[pointi];
if
(
@ -506,17 +506,17 @@ int main(int argc, char *argv[])
nChanged++;
label newPointI = -1;
label newPointi = -1;
// Keep the points in the same place and move the edge
if (hitSurfI == surfI)
{
newPointI = pointI;
newPointi = pointi;
}
else
{
newPoints[hitSurfI].append(newPoints[surfI][pointI]);
newPointI = newPoints[hitSurfI].size() - 1;
newPoints[hitSurfI].append(newPoints[surfI][pointi]);
newPointi = newPoints[hitSurfI].size() - 1;
}
// Split the other face.
@ -525,7 +525,7 @@ int main(int argc, char *argv[])
hitSurf,
facei,
eIndex,
newPointI,
newPointi,
newFacesFromSplit
);