STYLE: use edgeHashes include

STYLE: use initial hash size 128 instead of 100 in a few places
This commit is contained in:
Mark Olesen
2018-08-08 23:54:27 +02:00
parent dd9ecd4988
commit ca5d91239d
27 changed files with 32 additions and 32 deletions

View File

@ -24,12 +24,12 @@ License
\*---------------------------------------------------------------------------*/
#include "edgeMesh.H"
#include "bitSet.H"
#include "edgeHashes.H"
#include "mergePoints.H"
#include "ListOps.H"
#include "addToRunTimeSelectionTable.H"
#include "addToMemberFunctionSelectionTable.H"
#include "ListOps.H"
#include "edgeHashes.H"
#include "bitSet.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //

View File

@ -346,7 +346,7 @@ void Foam::localPointRegion::calcPointRegions
// Transport minimum from face across cell
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Map<label> minPointValue(100);
Map<label> minPointValue(128);
label nChanged = 0;
forAllConstIter(Map<label>, candidateCell, iter)
{

View File

@ -26,7 +26,7 @@ License
#include "triSurfaceMesh.H"
#include "Random.H"
#include "addToRunTimeSelectionTable.H"
#include "EdgeMap.H"
#include "edgeHashes.H"
#include "triSurfaceFields.H"
#include "Time.H"
#include "PatchTools.H"
@ -162,7 +162,7 @@ bool Foam::triSurfaceMesh::isSurfaceClosed() const
// Every edge should be used by two faces exactly.
// To prevent doing work twice per edge only look at edges to higher
// point
EdgeMap<label> facesPerEdge(100);
EdgeMap<label> facesPerEdge(128);
forAll(pointFaces, pointi)
{
const labelList& pFaces = pointFaces[pointi];

View File

@ -57,7 +57,7 @@ SourceFiles
#include "treeDataTriSurface.H"
#include "treeDataPrimitivePatch.H"
#include "treeDataEdge.H"
#include "EdgeMap.H"
#include "edgeHashes.H"
#include "triSurface.H"
#include "triSurfaceRegionSearch.H"

View File

@ -32,7 +32,7 @@ License
#include "linePointRef.H"
#include "Fstream.H"
#include "unitConversion.H"
#include "EdgeMap.H"
#include "edgeHashes.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //