Go to the documentation of this file.
36 const scalar reportLenSqr,
41 const faceList& faces = this->faces();
43 scalar minLenSqr =
sqr(GREAT);
44 scalar maxLenSqr = -
sqr(GREAT);
50 const face&
f = faces[facei];
54 label fp1 =
f.fcIndex(fp);
58 if (magSqrE < reportLenSqr)
64 minLenSqr =
min(minLenSqr, magSqrE);
65 maxLenSqr =
max(maxLenSqr, magSqrE);
72 label nSmall = smallEdgeSet.
size();
84 Info<<
" *Edges too small, min/max edge length = "
85 <<
sqrt(minLenSqr) <<
" " <<
sqrt(maxLenSqr)
86 <<
", number too small: " << nSmall <<
endl;
94 Info<<
" Min/max edge length = "
95 <<
sqrt(minLenSqr) <<
" " <<
sqrt(maxLenSqr) <<
" OK." <<
endl;
label size() const noexcept
The number of elements in table.
Ostream & endl(Ostream &os)
Add newline and flush stream.
label min(const labelHashSet &set, label minValue=labelMax)
Find the min value in labelHashSet, optionally limited by second argument.
#define forAll(list, i)
Loop across all elements in list.
dimensioned< typename typeOfMag< Type >::type > magSqr(const dimensioned< Type > &dt)
virtual bool checkEdgeLength(const bool report, const scalar minLenSqr, labelHashSet *setPtr=nullptr) const
Check edge length.
messageStream Info
Information stream (uses stdout - output is on the master only)
label max(const labelHashSet &set, label maxValue=labelMin)
Find the max value in labelHashSet, optionally limited by second argument.
reduce(hasMovingMesh, orOp< bool >())
void transfer(HashTable< T, Key, Hash > &rhs)
Transfer contents into this table.
dimensionedSymmTensor sqr(const dimensionedVector &dv)
dimensionedScalar sqrt(const dimensionedScalar &ds)
bool insert(const Key &key)
Insert a new entry, not overwriting existing entries.
A face is a list of labels corresponding to mesh vertices.