41 nbrPatchIDs_(nbrPatchIDs),
62 label nbrPatchi = iter.key();
73 label nbrPatchi = iter.key();
85 const edge meshE =
edge(nbrMp[e[0]], nbrMp[e[1]]);
86 nbrEdges.
insert(meshE, nbrPatchi);
122 const edge meshE =
edge(mp[e[0]], mp[e[1]]);
124 if (edgeFnd != nbrEdges.
end())
126 initialEdges.
append(edgeI);
159 forAll(allFaceInfo, facei)
161 if (allFaceInfo[facei].valid(calc.data()))
#define forAll(list, i)
Loop across all elements in list.
static iteratorEnd end()
iteratorEnd set to beyond the end of any HashTable
Type & operator[](const label)
Return element of UList.
#define forAllConstIter(Container, container, iter)
Iterate across all elements in the container object of type.
Info<< "Predicted p max-min : "<< max(p).value()<< " "<< min(p).value()<< endl;rho==max(rho0+psi *p, rhoMin);# 1 "/home/ubuntu/OpenFOAM-10/applications/solvers/multiphase/cavitatingFoam/alphavPsi.H" 1{ alphav=max(min((rho - rholSat)/(rhovSat - rholSat), scalar(1)), scalar(0));alphal=1.0 - alphav;Info<< "max-min alphav: "<< max(alphav).value()<< " "<< min(alphav).value()<< endl;psiModel-> correct()
Wave propagation of information along patch. Every iteration information goes through one layer of fa...
const polyBoundaryMesh & boundaryMesh() const
Return boundaryMesh reference.
dimensionedScalar sqrt(const dimensionedScalar &ds)
label nInternalEdges() const
Number of internal edges.
const Field< PointType > & localPoints() const
Return pointField of points in patch.
const labelList & meshPoints() const
Return labelList of mesh points in patch. They are constructed.
bool insert(const edge &, const T &newElmt)
Insert a new hashedEntry.
iterator find(const edge &)
Find and return an iterator set at the hashedEntry.
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects...
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
virtual ~patchPatchDist()
Destructor.
DynamicList< T, SizeInc, SizeMult, SizeDiv > & append(const T &)
Append an element at the end of the list.
const polyMesh & mesh() const
Return the mesh reference.
const dimensionedScalar mp
Proton mass.
const edgeList & edges() const
Return list of edges, address into LOCAL point list.
label nEdges() const
Return number of edges in patch.
Map from edge (expressed as its endpoints) to value.
PrimitivePatch< SubList< face >, const pointField & > primitivePatch
Addressing for a faceList slice.
patchPatchDist(const polyPatch &pp, const labelHashSet &nbrPatchIDs)
Construct from patch and neighbour patches.
void setSize(const label)
Reset size of List.
virtual void correct()
Correct for mesh geom/topo changes.
T returnReduce(const T &Value, const BinaryOp &bop, const int tag=Pstream::msgType(), const label comm=UPstream::worldComm)
const doubleScalar e
Elementary charge.
A patch is a list of labels that address the faces in the global face list.