42 #ifndef faMeshLduAddressing_H 43 #define faMeshLduAddressing_H 101 upperAddr_(
mesh.edgeNeighbour()),
102 patchAddr_(
mesh.boundary().edgeFaces()),
103 patchSchedule_(
mesh.globalData().patchSchedule())
116 return patchAddr_.size();
134 return patchAddr_[patchi];
140 return patchSchedule_;
virtual const lduSchedule & patchSchedule() const noexcept
Return patch field evaluation schedule.
virtual label nPatches() const noexcept
Return number of interfaces.
Finite area mesh (used for 2-D non-Euclidian finite area method) defined using a patch of faces on a ...
void operator=(const faMeshLduAddressing &)=delete
No copy assignment.
UList< label > labelUList
A UList of labels.
A List obtained as a section of another List.
virtual const labelUList & lowerAddr() const noexcept
Return lower addressing (i.e. lower label = upper triangle)
virtual ~faMeshLduAddressing()=default
Destructor.
virtual const labelUList & upperAddr() const noexcept
Return upper addressing (i.e. upper label)
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
lduAddressing(const lduAddressing &)=delete
No copy construct.
The class contains the addressing required by the lduMatrix: upper, lower and losort.
lduAddressing wrapper for faMesh
faMeshLduAddressing(const faMeshLduAddressing &)=delete
No copy construct.
virtual const labelUList & patchAddr(const label patchi) const
Return patch addressing.