Go to the documentation of this file.
53 if( omp_in_parallel() )
56 "inline label polyMeshGenFaces::nInternalFaces() const"
57 ) <<
"Calculating addressing inside a parallel region."
72 if( omp_in_parallel() )
75 "inline label polyMeshGenFaces::owner() const"
76 ) <<
"Calculating addressing inside a parallel region."
91 if( omp_in_parallel() )
94 "inline label polyMeshGenFaces::neighbour() const"
95 ) <<
"Calculating addressing inside a parallel region."
122 std::map<label, meshSubset>::iterator it = faceSubsets_.find(setID);
123 if( it == faceSubsets_.end() )
126 it->second.addElement(faceI);
134 std::map<label, meshSubset>::iterator it = faceSubsets_.find(setI);
135 if( it == faceSubsets_.end() )
138 it->second.removeElement(faceI);
149 std::map<label, meshSubset>::const_iterator it;
152 it=faceSubsets_.begin();
153 it!=faceSubsets_.end();
157 if( it->second.contains(faceI) )
158 faceSubsets.
append(it->first);
166 std::map<label, meshSubset>::const_iterator it;
173 indices.
append(it->first);
176 template<
class ListType>
185 std::map<label, meshSubset>::const_iterator it =
186 faceSubsets_.find(setI);
187 if( it == faceSubsets_.end() )
190 it->second.containedElements(faceLabels);
193 template<
class ListType>
198 std::map<label, meshSubset>::iterator it=
faceSubsets_.begin();
202 it->second.updateSubset(newFaceLabels);
209 std::map<label, meshSubset>::iterator it=
faceSubsets_.begin();
213 it->second.updateSubset(newFacesForFace);
const labelList & neighbour() const
const labelList & owner() const
owner and neighbour cells for faces
void removeFaceFromSubset(const label, const label)
std::map< label, meshSubset > faceSubsets_
face subsets
void facesInSubset(const label, ListType &) const
void updateFaceSubsets(const ListType &)
const faceListPMG & faces() const
access to faces
label nInternalFaces() const
return number of internal faces
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
PtrList< processorBoundaryPatch > procBoundaries_
A templated 1D list of pointers to objects of type <T>, where the size of the array is known and used...
labelIOList * neighbourPtr_
errorManipArg< error, int > exit(error &err, const int errNo=1)
label nIntFaces_
number of internal faces, owner and neighbour
virtual void calculateOwnersAndNeighbours() const =0
calculate owner and neighbour addressing
void faceInSubsets(const label, DynList< label > &) const
faceListPMG faces_
list of faces
const PtrList< boundaryPatch > & boundaries() const
ordinary boundaries
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
const PtrList< processorBoundaryPatch > & procBoundaries() const
inter-processor boundaries
void addFaceToSubset(const label, const label)
#define FatalErrorIn(functionName)
Report an error message using Foam::FatalError.
void faceSubsetIndices(DynList< label > &) const
PtrList< boundaryPatch > boundaries_
boundary data
void clear()
Clear the list, i.e. set next free to zero.
void append(const T &e)
Append an element at the end of the list.