33 const scalar reportLenSqr,
38 const faceList& faces = this->faces();
40 scalar minLenSqr =
sqr(GREAT);
41 scalar maxLenSqr = -
sqr(GREAT);
47 const face&
f = faces[facei];
53 scalar magSqrE =
magSqr(points[f[fp]] - points[f[fp1]]);
55 if (magSqrE < reportLenSqr)
57 smallEdgeSet.
insert(f[fp]);
58 smallEdgeSet.
insert(f[fp1]);
61 minLenSqr =
min(minLenSqr, magSqrE);
62 maxLenSqr =
max(maxLenSqr, magSqrE);
81 Info<<
" *Edges too small, min/max edge length = " 82 <<
sqrt(minLenSqr) <<
" " <<
sqrt(maxLenSqr)
83 <<
", number too small: " << nSmall <<
endl;
92 Info<<
" Min/max edge length = " 93 <<
sqrt(minLenSqr) <<
" " <<
sqrt(maxLenSqr)
#define forAll(list, i)
Loop across all elements in list.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
A face is a list of labels corresponding to mesh vertices.
dimensioned< Type > max(const dimensioned< Type > &, const dimensioned< Type > &)
dimensionedSymmTensor sqr(const dimensionedVector &dv)
dimensionedScalar sqrt(const dimensionedScalar &ds)
Ostream & endl(Ostream &os)
Add newline and flush stream.
label size() const
Return number of elements in table.
void transfer(HashTable< T, Key, Hash > &)
Transfer the contents of the argument table into this table.
bool insert(const Key &key)
Insert a new entry.
label fcIndex(const label i) const
Return the forward circular index, i.e. the next index.
dimensioned< scalar > magSqr(const dimensioned< Type > &)
dimensioned< Type > min(const dimensioned< Type > &, const dimensioned< Type > &)
void reduce(const List< UPstream::commsStruct > &comms, T &Value, const BinaryOp &bop, const int tag, const label comm)
virtual bool checkEdgeLength(const bool report, const scalar minLenSqr, labelHashSet *setPtr=NULL) const
Check edge length.