Go to the documentation of this file.
58 for(
label faceI=nIntFaces;faceI<nFaces;++faceI)
60 const face&
f = faces[faceI];
64 const label edgeI = faceEdges(faceI, pI);
66 if( newEdgePoint.found(edgeI) )
continue;
69 const label e =
f.nextLabel(pI);
73 Warning <<
"Boundary vertices " <<
s <<
" and " <<
e
74 <<
" are not mapped to the boundary!" <<
endl;
111 edges[faceEdges(faceI, pI)].centre(
points)
117 newEdgePoint.insert(edgeI,
nPoints_);
129 const face&
f = faces[faceI];
136 if( newEdgePoint.found(faceEdges(faceI, eI)) )
137 newF.
append(newEdgePoint[faceEdges(faceI, eI)]);
140 if( newF.
size() >
f.size() )
152 Info <<
"Finished creating mesh edges" <<
endl;
const polyMeshGenAddressing & addressingData() const
addressing which may be needed
#define forAll(list, i)
Loop across all elements in list.
Template functions to aid in the implementation of demand driven data.
const VRWGraph & faceEdges() const
bool findNearestPointToEdge(point &nearest, scalar &distSq, label &nearestEdge, const FixedList< point, 2 > &edgePoints, const FixedList< label, 2 > &edgePointRegions) const
Ostream & endl(Ostream &os)
Add newline and flush stream.
const pointFieldPMG & points() const
access to points
const faceListPMG & faces() const
access to faces
label nInternalFaces() const
return number of internal faces
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
void clearAddressingData() const
clear addressing data
label sizeOfRow(const label rowI) const
Returns the number of elements in the given row.
const double e
Elementary charge.
const edgeList & edges() const
Return mesh edges.
gmvFile<< "tracers "<< particles.size()<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().x()<< " ";}gmvFile<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().y()<< " ";}gmvFile<< nl;forAllConstIter(Cloud< passiveParticle >, particles, iter){ gmvFile<< iter().position().z()<< " ";}gmvFile<< nl;forAll(lagrangianScalarNames, i){ word name=lagrangianScalarNames[i];IOField< scalar > s(IOobject(name, runTime.timeName(), cloud::prefix, mesh, IOobject::MUST_READ, IOobject::NO_WRITE))
void setSize(const label)
Reset size of List.
label size() const
return the number of used elements
void appendList(const ListType &l)
Append a list as a row at the end of the graph.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
A 1D vector of objects of type <T> with a fixed size <Size>.
A face is a list of labels corresponding to mesh vertices.
void clear()
Clear the list, i.e. set next free to zero.
void append(const T &e)
Append an element at the end of the list.