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