42 const label nNonProcessor =
patches.nNonProcessor();
45 label nLocalProcEdges = 0;
50 const auto* cpp = isA<processorFaPatch>(fap);
54 nLocalProcEdges += fap.nEdges();
61 UPstream::listGatherValues<label>(
mesh.nFaces())
65 UPstream::listGatherValues<label>(
mesh.nPoints())
69 UPstream::listGatherValues<label>(
mesh.nEdges())
73 UPstream::listGatherValues<label>(
mesh.nInternalEdges())
79 UPstream::listGatherValues<label>
81 mesh.nBoundaryEdges() - nLocalProcEdges
86 UPstream::listGatherValues<label>(nLocalProcEdges)
95 [&,verbose](
const char* tag,
const labelList& list)
97 Info<<
" Number of " << tag <<
": " <<
sum(list) <<
nl;
100 int padding =
static_cast<int> 107 do {
Info<<
' '; }
while (--padding > 0);
114 Info<<
"----------------" <<
nl 115 <<
"Mesh Information" <<
nl 116 <<
"----------------" <<
nl 121 reporter(
"faces", nFaces);
123 reporter(
"edges", nEdges);
124 reporter(
"internal edges", nIntEdges);
125 reporter(
"boundary edges", nBndEdges);
129 reporter(
"processor edges", nProcEdges);
133 Info<<
"----------------" <<
nl 135 <<
"----------------" <<
nl;
137 for (label patchi = 0; patchi < nNonProcessor; ++patchi)
142 Info<<
" " <<
"patch " <<
p.index()
144 <<
") name: " <<
p.name()
148 Info<<
"----------------" <<
nl 157 <<
" min = " <<
limit.min() <<
" max = " <<
limit.max() <<
nl;
166 for (label patchi = nNonProcessor; patchi <
nPatches; ++patchi)
174 Info<<
"Edge length (internal):" <<
nl 175 <<
" min = " <<
limit.min() <<
" max = " <<
limit.max() <<
nl;
179 for (label patchi = 0; patchi < nNonProcessor; ++patchi)
189 Info<<
"Edge length:" <<
nl 190 <<
" min = " <<
limit.min() <<
" max = " <<
limit.max() <<
nl;
198 Info<<
"Face area normals:" <<
nl 199 <<
" min = " <<
limit.min() <<
" max = " <<
limit.max() <<
nl;
Finite area mesh (used for 2-D non-Euclidian finite area method) defined using a patch of faces on a ...
dimensioned< Type > sum(const DimensionedField< Type, GeoMesh > &f1)
constexpr char nl
The newline '\n' character (0x0a)
static bool & parRun() noexcept
Test if this a parallel run.
A bounding box defined in terms of min/max extrema points.
T returnReduce(const T &value, const BinaryOp &bop, const int tag=UPstream::msgType(), const label comm=UPstream::worldComm)
Perform reduction on a copy, using specified binary operation.
MinMax< label > minMax(const labelHashSet &set)
Find the min/max values of labelHashSet.
complex limit(const complex &c1, const complex &c2)
MinMax< Type > gMinMax(const FieldField< Field, Type > &f)
Finite area patch class. Used for 2-D non-Euclidian finite area method.
static bool master(const label communicator=worldComm)
True if process corresponds to the master rank in the communicator.
const polyBoundaryMesh & patches
Finite area boundary mesh.
messageStream Info
Information stream (stdout output on master, null elsewhere)
void reduce(T &value, const BinaryOp &bop, const int tag=UPstream::msgType(), const label comm=UPstream::worldComm)
Reduce inplace (cf. MPI Allreduce) using linear/tree communication schedule.
Combine values and/or MinMax ranges.
FlatOutput::OutputAdaptor< Container, Delimiters > flatOutput(const Container &obj, Delimiters delim)
Global flatOutput() function with specified output delimiters.