57template<
class Type,
class NVDweight>
100 if (edgeFlux_[
edge] > 0)
109 d *=
mesh.edgeInterpolation::lPN().internalField()[
edge];
119 gradc[neighbour[
edge]],
129 if (bWeights[patchI].
coupled())
133 const scalarField& pEdgeFlux = edgeFlux_.boundaryField()[patchI];
151 mesh.areaCentres().boundaryField()[patchI].patchInternalField()
156 mesh.areaCentres().boundaryField()[patchI]
157 .patchNeighbourField()
162 mesh.faceAreaNormals().boundaryField()[patchI]
163 .patchInternalField()
168 mesh.faceAreaNormals().boundaryField()[patchI]
169 .patchNeighbourField()
174 mesh.edgeInterpolation::lPN().boundaryField()[patchI]
179 vector d(CN[edgeI] - CP[edgeI]);
181 if (pEdgeFlux[edgeI] > 0)
207 return tWeightingFactors;
Internal::FieldType & primitiveFieldRef(const bool updateAccessTime=true)
Return a reference to the internal field.
Boundary & boundaryFieldRef(const bool updateAccessTime=true)
Return a reference to the boundary field.
const Boundary & boundaryField() const
Return const-reference to the boundary field.
Vector< Cmpt > & normalise(const scalar tol=ROOTVSMALL)
Inplace normalise the vector by its magnitude.
Vector< Cmpt > & removeCollinear(const Vector< Cmpt > &unitVec)
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
virtual const scalarListList & weights() const
Return interpolation weights.
Finite area mesh (used for 2-D non-Euclidian finite area method) defined using a patch of faces on a ...
A class for managing temporary objects.
bool coupled(solutionDict.getOrDefault("coupledEnergyField", false))
Calculate the gradient of the given field.
GeometricField< tensor, faPatchField, areaMesh > areaTensorField
GeometricField< vector, faPatchField, areaMesh > areaVectorField
dimensioned< typename typeOfMag< Type >::type > magSqr(const dimensioned< Type > &dt)
tmp< areaScalarField > limiter(const areaScalarField &phi)
#define forAll(list, i)
Loop across all elements in list.