65 <<
"Specified IOobject::MUST_READ_IF_MODIFIED but class"
66 <<
" does not support automatic rereading."
86 patchEntries[
patchi].keyword(),
97 "polyBoundaryMesh::polyBoundaryMesh"
98 "(const IOobject&, const polyMesh&)"
141 <<
"Specified IOobject::MUST_READ_IF_MODIFIED but class"
142 <<
" does not support automatic rereading."
161 patchEntries[
patchi].keyword(),
172 "polyBoundaryMesh::polyBoundaryMesh"
173 "(const IOobject&, const polyMesh&, const polyPatchList&)"
202 operator[](
patchi).clearGeom();
210 nbrEdgesPtr_.clear();
212 patchFaceIDPtr_.clear();
213 groupPatchIDsPtr_.clear();
219 operator[](
patchi).clearAddressing();
227 void Foam::polyBoundaryMesh::calcGeometry()
239 operator[](
patchi).initCalcGeometry(pBufs);
242 pBufs.finishedSends();
246 operator[](
patchi).calcGeometry(pBufs);
251 const lduSchedule& patchSchedule = mesh().globalData().patchSchedule();
254 pBufs.finishedSends();
256 forAll(patchSchedule, patchEvali)
258 const label patchi = patchSchedule[patchEvali].patch;
260 if (patchSchedule[patchEvali].init)
262 operator[](
patchi).initCalcGeometry(pBufs);
266 operator[](
patchi).calcGeometry(pBufs);
279 <<
"Neighbour edge addressing not correct across parallel"
280 <<
" boundaries." <<
endl;
283 if (!nbrEdgesPtr_.valid())
289 label nEdgePairs = 0;
320 edgei < edges.
size();
325 const edge&
e = edges[edgei];
333 if (fnd == pointsToEdge.
end())
355 nbrEdges[edgeInfo[0]][edgeInfo[1]]
366 if (pointsToEdge.
size())
369 <<
"Not all boundary edges of patches match up." <<
nl
370 <<
"Is the outside of your mesh multiply connected?"
382 const labelPair& edgeInfo = nbrEdgesp[i];
384 if (edgeInfo[0] == -1 || edgeInfo[1] == -1)
390 <<
"Not all boundary edges of patches match up." <<
nl
391 <<
"Edge " << edgeI <<
" on patch " << pp.
name()
394 <<
" edge on any other patch." <<
nl
395 <<
"Is the outside of your mesh multiply connected?"
402 return nbrEdgesPtr_();
408 if (!patchIDPtr_.valid())
415 - mesh_.nInternalFaces()
424 label bFacei = bm[
patchi].start() - mesh_.nInternalFaces();
427 patchID[bFacei++] =
patchi;
431 return patchIDPtr_();
437 if (!patchFaceIDPtr_.valid())
439 patchFaceIDPtr_.reset
444 - mesh_.nInternalFaces()
447 labelList& patchFaceID = patchFaceIDPtr_();
453 label bFacei = bm[
patchi].start() - mesh_.nInternalFaces();
456 patchFaceID[bFacei++] = i;
460 return patchFaceIDPtr_();
467 if (!groupPatchIDsPtr_.valid())
487 if (iter != groupPatchIDs.
end())
504 <<
"Removing patchGroup '" << bm[
patchi].
name()
505 <<
"' which clashes with patch " <<
patchi
506 <<
" of the same name."
512 return groupPatchIDsPtr_();
518 const word& groupName,
522 groupPatchIDsPtr_.clear();
555 if (groups[i] != groupName)
557 groups[newI++] = groups[i];
615 const bool usePatchGroups
626 if (usePatchGroups && groupPatchIDs().size())
630 const wordList allGroupNames = groupPatchIDs().toc();
634 const word& grpName = allGroupNames[groupIDs[i]];
635 const labelList& patchIDs = groupPatchIDs()[grpName];
638 if (indexSet.
insert(patchIDs[j]))
640 indices.
append(patchIDs[j]);
654 if (key ==
operator[](i).
name())
661 if (usePatchGroups && groupPatchIDs().size())
664 groupPatchIDs().find(key);
666 if (iter != groupPatchIDs().end())
673 if (indexSet.
insert(patchIDs[j]))
675 indices.
append(patchIDs[j]);
696 if (!indices.
empty())
705 if (key ==
operator[](i).
name())
733 Pout<<
"label polyBoundaryMesh::findPatchID(const word&) const"
734 <<
"Patch named " << patchName <<
" not found. "
735 <<
"List of available patch names: " << names() <<
endl;
749 if (faceIndex < mesh().nInternalFaces())
753 else if (faceIndex >= mesh().nFaces())
756 <<
"given label " << faceIndex
757 <<
" greater than the number of geometric faces " << mesh().nFaces()
768 faceIndex >= bp.
start()
769 && faceIndex < bp.
start() + bp.size()
778 <<
"Cannot find face " << faceIndex <<
" in any of the patches "
780 <<
"It seems your patches are not consistent with the mesh :"
781 <<
" internalFaces:" << mesh().nInternalFaces()
782 <<
" total number of faces:" << mesh().nFaces()
792 const bool warnNotFound,
793 const bool usePatchGroups
796 const wordList allPatchNames(this->names());
812 if (patchIDs.
empty())
816 const wordList allGroupNames = groupPatchIDs().toc();
823 const word&
name = allGroupNames[groupIDs[i]];
826 forAll(extraPatchIDs, extraI)
828 ids.
insert(extraPatchIDs[extraI]);
832 if (groupIDs.
empty() && warnNotFound)
835 <<
"Cannot find any patch or group names matching "
840 else if (warnNotFound)
843 <<
"Cannot find any patch names matching " << patchName
870 groupPatchIDs.
begin();
871 iter != groupPatchIDs.
end();
882 label nMatch = nonGroupPatches.
erase(groupPatchSet);
884 if (nMatch == groupPatchSet.
size())
886 matchedGroups.
append(iter.key());
888 else if (nMatch != 0)
891 nonGroupPatches.
transfer(oldNonGroupPatches);
909 bool hasError =
false;
919 if (!isA<processorPolyPatch>(bm[
patchi]))
928 Pout<<
" ***Problem with boundary patch " <<
patchi
930 <<
" of type " << bm[
patchi].type()
931 <<
". The patch seems to be preceded by processor"
932 <<
" patches. This is can give problems."
939 types[nonProci] = bm[
patchi].type();
959 for (
label proci = 1; proci < allNames.
size(); ++proci)
963 (allNames[proci] != allNames[0])
964 || (allTypes[proci] != allTypes[0])
971 Info<<
" ***Inconsistent patches across processors, "
972 "processor 0 has patch names:" << allNames[0]
973 <<
" patch types:" << allTypes[0]
974 <<
" processor " << proci <<
" has patch names:"
976 <<
" patch types:" << allTypes[proci]
988 label nextPatchStart = mesh().nInternalFaces();
991 bool hasError =
false;
997 if (bm[
patchi].start() != nextPatchStart && !hasError)
1001 Info<<
" ****Problem with boundary patch " <<
patchi
1003 <<
" of type " << bm[
patchi].type()
1004 <<
". The patch should start on face no " << nextPatchStart
1005 <<
" and the patch specifies " << bm[
patchi].start()
1007 <<
"Possibly consecutive patches have this same problem."
1008 <<
" Suppressing future warnings." <<
endl;
1015 Info<<
" ****Duplicate boundary patch " <<
patchi
1017 <<
" of type " << bm[
patchi].type()
1019 <<
"Suppressing future warnings." <<
endl;
1027 if (debug || report)
1031 Pout<<
" ***Boundary definition is in error." <<
endl;
1035 Info<<
" Boundary definition OK." <<
endl;
1055 operator[](
patchi).initMovePoints(pBufs,
p);
1062 operator[](
patchi).movePoints(pBufs,
p);
1067 const lduSchedule& patchSchedule = mesh().globalData().patchSchedule();
1072 forAll(patchSchedule, patchEvali)
1074 const label patchi = patchSchedule[patchEvali].patch;
1076 if (patchSchedule[patchEvali].init)
1078 operator[](
patchi).initMovePoints(pBufs,
p);
1082 operator[](
patchi).movePoints(pBufs,
p);
1091 nbrEdgesPtr_.clear();
1092 patchIDPtr_.clear();
1093 patchFaceIDPtr_.clear();
1094 groupPatchIDsPtr_.clear();
1106 operator[](
patchi).initTopoChange(pBufs);
1113 operator[](
patchi).topoChange(pBufs);
1118 const lduSchedule& patchSchedule = mesh().globalData().patchSchedule();
1123 forAll(patchSchedule, patchEvali)
1125 const label patchi = patchSchedule[patchEvali].patch;
1127 if (patchSchedule[patchEvali].init)
1129 operator[](
patchi).initTopoChange(pBufs);
1133 operator[](
patchi).topoChange(pBufs);
1143 const bool validBoundary
1165 const bool validBoundary
1205 os.
check(
"polyBoundaryMesh::writeData(Ostream& os) const");
1227 const word& patchName
1235 <<
"Patch named " << patchName <<
" not found." <<
nl
1236 <<
"Available patch names: " << names() <<
endl
1240 return operator[](
patchi);
1246 const word& patchName
1254 <<
"Patch named " << patchName <<
" not found." <<
nl
1255 <<
"Available patch names: " << names() <<
endl
1259 return operator[](
patchi);
#define forAll(list, i)
Loop across all elements in list.
void setCapacity(const label)
Alter the size of the underlying storage.
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
bool insert(const Key &key)
Insert a new entry.
An STL-conforming const_iterator.
An STL-conforming iterator.
An STL-conforming hash table.
bool erase(const iterator &)
Erase a hashedEntry specified by given iterator.
void transfer(HashTable< T, Key, Hash > &)
Transfer the contents of the argument table into this table.
iterator begin()
Iterator set to the beginning of the HashTable.
label size() const
Return number of elements in table.
bool insert(const Key &, const T &newElmt)
Insert a new hashedEntry.
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
IOobject defines the attributes of an object for which implicit objectRegistry management is supporte...
readOption readOpt() const
autoPtr< IOobject > clone() const
Clone.
const word & name() const
Return name.
virtual bool check(const char *operation) const
Check IOstream status for given operation.
streamFormat
Enumeration for the format of data in the stream.
compressionType
Enumeration for the format of data in the stream.
bool good() const
Return true if next operation might succeed.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
void transfer(List< T > &)
Transfer the contents of the argument List into this list.
void append(const T &)
Append an element at the end of the list.
void size(const label)
Override size to be inconsistent with allocated storage.
void setSize(const label)
Reset size of List.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
label nEdges() const
Return number of edges in patch.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
label nInternalEdges() const
Number of internal edges.
const labelList & meshPoints() const
Return labelList of mesh points in patch. They are constructed.
const Field< PointType > & localPoints() const
Return pointField of points in patch.
Buffers for inter-processor communications streams (UOPstream, UIPstream).
void finishedSends(const bool block=true)
Mark all sends as having been done. This will start receives.
static void scatterList(const List< commsStruct > &comms, List< T > &Values, const int tag, const label comm)
Scatter data. Reverse of gatherList.
static void gatherList(const List< commsStruct > &comms, List< T > &Values, const int tag, const label comm)
Gather data but keep individual values separate.
A templated 1D list of pointers to objects of type <T>, where the size of the array is known and used...
bool set(const label) const
Is element set.
void reorder(const labelUList &oldToNew)
Reorders elements. Ordering does not have to be done in.
void shuffle(const labelUList &newToOld)
Reorders elements. Ordering does not have to be done in.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool empty() const
Return true if the UList is empty (ie, size() is zero)
static bool master(const label communicator=0)
Am I the master process.
static label nProcs(const label communicator=0)
Number of processes in parallel run.
static bool & parRun()
Is this a parallel run?
static commsTypes defaultCommsType
Default commsType.
static int myProcNo(const label communicator=0)
Number of this process (starting from masterNo() = 0)
label size() const
Return the number of elements in the UPtrList.
friend Ostream & operator(Ostream &, const UPtrList< T > &)
Write UPtrList to Ostream.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
bool inGroup(const word &) const
Test if in group.
const wordList & inGroups() const
Return the optional groups patch belongs to.
const word & name() const
Return name.
bool checkDefinition(const bool report=false) const
Check boundary definition. Return true if in error.
wordList physicalTypes() const
Return a list of physical types.
void topoChange()
Correct polyBoundaryMesh after topology update.
bool writeData(Ostream &) const
writeData member function required by regIOobject
wordList types() const
Return a list of patch types.
void clearGeom()
Clear geometry at this level and at patches.
const HashTable< labelList, word > & groupPatchIDs() const
Per patch group the patch indices.
void setGroup(const word &groupName, const labelList &patchIDs)
Set/add group with patches.
~polyBoundaryMesh()
Destructor.
bool writeObject(IOstream::streamFormat fmt, IOstream::versionNumber ver, IOstream::compressionType cmp, const bool write=true) const
Write using given format, version and form uncompression.
label whichPatch(const label faceIndex) const
Return patch index for a given face label.
void matchGroups(const labelUList &patchIDs, wordList &groups, labelHashSet &nonGroupPatches) const
Match the patches to groups. Returns all the (fully matched) groups.
void clearAddressing()
Clear addressing at this level and at patches.
const labelList & patchFaceID() const
Per boundary face label the patch face index.
void movePoints(const pointField &)
Correct polyBoundaryMesh after moving points.
void renamePatches(const wordUList &newNames, const bool validBoundary)
Rename the patches. If validBoundary is set this calls topoChange()
const labelList & patchID() const
Per boundary face label the patch index.
labelHashSet patchSet(const UList< wordRe > &patchNames, const bool warnNotFound=true, const bool usePatchGroups=true) const
Return the set of patch IDs corresponding to the given names.
label findIndex(const wordRe &) const
Return patch index for the first match, return -1 if not found.
label findPatchID(const word &patchName) const
Find patch index given a name.
void reorderPatches(const labelUList &newToOld, const bool validBoundary)
Reorders the patches. Ordering does not have to be done in.
polyBoundaryMesh(const IOobject &, const polyMesh &)
Read constructor given IOobject and a polyMesh reference.
wordList names() const
Return a list of patch names.
const List< labelPairList > & nbrEdges() const
Per patch the edges on the neighbouring patch. Is for every external.
bool checkParallelSync(const bool report=false) const
Check whether all procs have all patches and in same order. Return.
labelList findIndices(const wordRe &, const bool usePatchGroups=true) const
Return patch indices for all matches. Optionally matches patchGroups.
Mesh consisting of general polyhedral cells.
A patch is a list of labels that address the faces in the global face list.
static autoPtr< polyPatch > New(const word &patchType, const word &name, const label size, const label start, const label index, const polyBoundaryMesh &bm)
Return a pointer to a new patch created on freestore from.
label start() const
Return start label of this patch in the polyMesh face list.
regIOobject is an abstract class derived from IOobject to handle automatic object registration with t...
void close()
Close Istream.
virtual bool writeObject(IOstream::streamFormat, IOstream::versionNumber, IOstream::compressionType, const bool write) const
Write using given format, version and compression.
bool headerOk()
Read and check header info.
Istream & readStream(const word &, const bool read=true)
Return Istream and check object type against that given.
A wordRe is a word, but can also have a regular expression for matching words.
static bool isPattern(const string &)
Test string for regular expression meta characters.
A class for handling words, derived from string.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
const fvPatchList & patches
#define WarningInFunction
Report a warning using Foam::Warning.
void write(std::ostream &os, const bool binary, List< floatScalar > &fField)
Write floats ascii or binary.
Pair< label > labelPair
Label pair.
Ostream & decrIndent(Ostream &os)
Decrement the indent level.
List< label > labelList
A List of labels.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
bool findStrings(const wordReListMatcher &matcher, const std::string &str)
Return true if string matches one of the regular expressions.
Ostream & endl(Ostream &os)
Add newline and flush stream.
labelList findIndices(const ListType &, typename ListType::const_reference, const label start=0)
Find all occurrences of given element. Linear search.
errorManip< error > abort(error &err)
Ostream & incrIndent(Ostream &os)
Increment the indent level.
List< lduScheduleEntry > lduSchedule
void reduce(const List< UPstream::commsStruct > &comms, T &Value, const BinaryOp &bop, const int tag, const label comm)
edge meshEdge(const PrimitivePatch< FaceList, PointField > &p, const label edgei)
defineTypeNameAndDebug(combustionModel, 0)
prefixOSstream Pout(cout, "Pout")
HashSet< label, Hash< label > > labelHashSet
A HashSet with label keys.
Ostream & operator<<(Ostream &, const ensightPart &)
word name(const complex &)
Return a string representation of a complex.
Ostream & indent(Ostream &os)
Indent stream.
wordList patchNames(nPatches)
Operations on lists of strings.
static iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable