zhyang-dev/OpenFOAM-5.x
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Standardized cell, patch and face loop index names

Browse Source
This commit is contained in:
Henry Weller
2016-04-25 10:28:32 +01:00
parent 6a27f7af46
commit 8c4f6b8fcb
849 changed files with 13266 additions and 13266 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -46,19 +46,19 @@ bool validTri
(
const bool verbose,
const triSurface& surf,
const label faceI
const label facei
)
{
// Simple check on indices ok.
const labelledTri& f = surf[faceI];
const labelledTri& f = surf[facei];
forAll(f, fp)
{
if (f[fp] < 0 || f[fp] >= surf.points().size())
{
WarningInFunction
<< "triangle " << faceI << " vertices " << f
<< "triangle " << facei << " vertices " << f
<< " uses point indices outside point range 0.."
<< surf.points().size()-1 << endl;
return false;
@ -68,7 +68,7 @@ bool validTri
if ((f[0] == f[1]) || (f[0] == f[2]) || (f[1] == f[2]))
{
WarningInFunction
<< "triangle " << faceI
<< "triangle " << facei
<< " uses non-unique vertices " << f
<< " coords:" << f.points(surf.points())
<< endl;
@ -77,7 +77,7 @@ bool validTri
// duplicate triangle check
const labelList& fFaces = surf.faceFaces()[faceI];
const labelList& fFaces = surf.faceFaces()[facei];
// Check if faceNeighbours use same points as this face.
// Note: discards normal information - sides of baffle are merged.
@ -85,7 +85,7 @@ bool validTri
{
label nbrFaceI = fFaces[i];
if (nbrFaceI <= faceI)
if (nbrFaceI <= facei)
{
// lower numbered faces already checked
continue;
@ -101,7 +101,7 @@ bool validTri
)
{
WarningInFunction
<< "triangle " << faceI << " vertices " << f
<< "triangle " << facei << " vertices " << f
<< " has the same vertices as triangle " << nbrFaceI
<< " vertices " << nbrF
<< " coords:" << f.points(surf.points())
@ -248,14 +248,14 @@ int main(int argc, char *argv[])
{
labelList regionSize(surf.patches().size(), 0);
forAll(surf, faceI)
forAll(surf, facei)
{
label region = surf[faceI].region();
label region = surf[facei].region();
if (region < 0 || region >= regionSize.size())
{
WarningInFunction
<< "Triangle " << faceI << " vertices " << surf[faceI]
<< "Triangle " << facei << " vertices " << surf[facei]
<< " has region " << region << " which is outside the range"
<< " of regions 0.." << surf.patches().size()-1
<< endl;
@ -283,11 +283,11 @@ int main(int argc, char *argv[])
{
DynamicList<label> illegalFaces(surf.size()/100 + 1);
forAll(surf, faceI)
forAll(surf, facei)
{
if (!validTri(verbose, surf, faceI))
if (!validTri(verbose, surf, facei))
{
illegalFaces.append(faceI);
illegalFaces.append(facei);
}
}
@ -315,19 +315,19 @@ int main(int argc, char *argv[])
{
scalarField triQ(surf.size(), 0);
forAll(surf, faceI)
forAll(surf, facei)
{
const labelledTri& f = surf[faceI];
const labelledTri& f = surf[facei];
if (f[0] == f[1] || f[0] == f[2] || f[1] == f[2])
{
//WarningIn(args.executable())
// << "Illegal triangle " << faceI << " vertices " << f
// << "Illegal triangle " << facei << " vertices " << f
// << " coords " << f.points(surf.points()) << endl;
}
else
{
triQ[faceI] = triPointRef
triQ[facei] = triPointRef
(
surf.points()[f[0]],
surf.points()[f[1]],
@ -377,11 +377,11 @@ int main(int argc, char *argv[])
{
DynamicList<label> problemFaces(surf.size()/100+1);
forAll(triQ, faceI)
forAll(triQ, facei)
{
if (triQ[faceI] < 1e-11)
if (triQ[facei] < 1e-11)
{
problemFaces.append(faceI);
problemFaces.append(facei);
}
}
@ -645,11 +645,11 @@ int main(int argc, char *argv[])
{
boolList includeMap(surf.size(), false);
forAll(faceZone, faceI)
forAll(faceZone, facei)
{
if (faceZone[faceI] == zone)
if (faceZone[facei] == zone)
{
includeMap[faceI] = true;
includeMap[facei] = true;
}
}