38#ifndef fvMeshLduAddressing_H
39#define fvMeshLduAddressing_H
53class fvMeshLduAddressing
75 fvMeshLduAddressing(
const fvMeshLduAddressing&) =
delete;
78 void operator=(
const fvMeshLduAddressing&) =
delete;
86 explicit fvMeshLduAddressing(
const fvMesh&
mesh)
97 upperAddr_(
mesh.faceNeighbour()),
98 patchAddr_(
mesh.boundary().faceCells()),
99 patchSchedule_(
mesh.globalData().patchSchedule())
124 return patchAddr_[patchi];
130 return patchSchedule_;
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
Smooth ATC in cells next to a set of patches supplied by type.
fvMeshLduAddressing(const fvMesh &mesh)
Construct from components.
const labelUList & patchAddr(const label patchi) const
Return patch addressing.
~fvMeshLduAddressing()=default
Destructor.
const lduSchedule & patchSchedule() const noexcept
Return patch field evaluation schedule.
const labelUList & upperAddr() const noexcept
Return upper addressing (i.e. upper label).
const labelUList & lowerAddr() const noexcept
Return lower addressing (i.e. lower label = upper triangle).
Mesh data needed to do the Finite Volume discretisation.
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.