38void Foam::faPatchMapper::calcAddressing()
const
43 <<
"Addressing already calculated"
57 Map<label> edgeIndexLookup;
61 forAll(oldEdgeFaces_, oefI)
63 if (reverseFaceMap[oldEdgeFaces_[oefI]] > -1)
66 edgeIndexLookup.insert(reverseFaceMap[oldEdgeFaces_[oefI]], oefI);
75 if (edgeIndexLookup.found(ef[efI]))
77 addr[efI] = edgeIndexLookup[ef[efI]];
91void Foam::faPatchMapper::clearOut()
108 sizeBeforeMapping_(patch.size()),
109 oldEdgeFaces_(patch.edgeFaces()),
111 directAddrPtr_(nullptr)
132 return *directAddrPtr_;
139 <<
"Requested interpolative addressing for a direct mapper."
149 <<
"Requested interpolative weights for a direct mapper."
static const List< labelList > & null()
Return a null List.
Mapping class for a faPatchField. Edge mapping is calculated based on faceCells comparison of old and...
virtual const labelListList & addressing() const
Return interpolated addressing.
virtual const scalarListList & weights() const
Return interpolation weights.
virtual const labelUList & directAddressing() const
Return direct addressing.
virtual ~faPatchMapper()
Destructor.
Finite area patch class. Used for 2-D non-Euclidian finite area method.
virtual label size() const
Patch size is the number of edge labels.
const labelUList & edgeFaces() const
Return edge-face addressing.
Class containing mesh-to-mesh mapping information after a change in polyMesh topology.
const labelList & reverseFaceMap() const
Reverse face map.
Template functions to aid in the implementation of demand driven data.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
List< label > labelList
A List of labels.
errorManip< error > abort(error &err)
static constexpr const zero Zero
Global zero (0)
void deleteDemandDrivenData(DataPtr &dataPtr)
#define forAll(list, i)
Loop across all elements in list.