41#ifndef fvMeshPrimitiveLduAddressing_H
42#define fvMeshPrimitiveLduAddressing_H
128 return patchAddr_[patchi];
134 return patchSchedule_;
A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers...
Variant of fvMeshLduAddressing that contains addressing instead of slices.
virtual ~fvMeshPrimitiveLduAddressing()=default
Destructor.
virtual const labelUList & patchAddr(const label patchi) const
Return patch addressing for given patch.
static label triIndex(const lduAddressing &, const label, const label)
Return off-diagonal index given owner and neighbour label.
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.
static labelList addAddressing(const lduAddressing &addr, const labelListList &nbrCells, label &nExtraFaces, labelList &lower, labelList &upper, labelListList &nbrCellFaces, const globalIndex &, const labelList &globalCellIDs, labelListList &localFaceCells, labelListList &remoteFaceCells)
virtual const labelUList & upperAddr() const noexcept
Return upper addressing (i.e. upper label)
Mesh data needed to do the Finite Volume discretisation.
Calculates a unique integer (label so might not have enough room - 2G max) for processor + local inde...
The class contains the addressing required by the lduMatrix: upper, lower and losort.