Go to the documentation of this file.
40 forAll(edgeLabels, edgeLabelI)
42 label edgeI = edgeLabels[edgeLabelI];
44 if (
mesh.edges()[edgeI] ==
edge(v0, v1))
51 <<
"Cannot find an edge among " << edgeLabels <<
endl
52 <<
"that uses vertices " << v0
68 label a1 = (a + 1) % size;
81 <<
"Problem : a:" << a <<
" b:" <<
b <<
" size:" << size
100 if ((edgeI < 0) || (edgeI >=
mesh.nEdges()))
103 <<
"Illegal edge label:" << edgeI
104 <<
" when projecting cut edge from cell " << cellI
105 <<
" to face " << faceI
125 return lowest(
f.size(), fpA, fpB);
159 const edge& e0 =
mesh.edges()[edge0I];
164 if ((fpA != -1) && (fpB != -1))
166 return lowest(
f.size(), fpA, fpB);
177 const edge& e1 =
mesh.edges()[edge1I];
182 if ((fpA != -1) && (fpB != -1))
184 return lowest(
f.size(), fpA, fpB);
188 <<
"Found connected faces " <<
mesh.faces()[f0I] <<
" and "
189 <<
mesh.faces()[f1I] <<
" sharing edge " << edgeI <<
endl
190 <<
"But none seems to be connected to face " << faceI
208 if (os.format() == IOstream::ASCII)
216 reinterpret_cast<const char*
>(&wDist.
index_),
217 sizeof(directionInfo)
222 os.check(
"Ostream& operator<<(Ostream&, const directionInfo&)");
230 if (is.
format() == IOstream::ASCII)
238 reinterpret_cast<char*
>(&wDist.
index_),
239 sizeof(directionInfo)
244 is.
check(
"Istream& operator>>(Istream&, directionInfo&)");
streamFormat format() const
Return current stream format.
#define forAll(list, i)
Loop across all elements in list.
label findIndex(const ListType &, typename ListType::const_reference, const label start=0)
Find first occurence of given element and return index,.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
Ostream & endl(Ostream &os)
Add newline and flush stream.
static label lowest(const label size, const label a, const label b)
Return 'lowest' of a,b in face of size.
label end() const
Return end vertex label.
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
An Istream is an abstract base class for all input systems (streams, files, token lists etc)....
virtual Ostream & write(const token &)=0
Write next token to stream.
static label edgeToFaceIndex(const primitiveMesh &mesh, const label cellI, const label faceI, const label edgeI)
Given edge on hex cell find corresponding edge on face. Is either.
static label findEdge(const primitiveMesh &mesh, const labelList &edgeLabels, const label v1, const label v0)
Find edge among edgeLabels that uses v0 and v1.
Holds direction in which to split cell (in fact a local coordinate axes). Information is a label and ...
virtual bool check(const char *operation) const
Check IOstream status for given operation.
errorManip< error > abort(error &err)
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
label start() const
Return start vertex label.
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
const dimensionedScalar e
Elementary charge.
Istream & operator>>(Istream &, edgeMesh &)
A face is a list of labels corresponding to mesh vertices.
An Ostream is an abstract base class for all output systems (streams, files, token lists,...
virtual Istream & read(token &)=0
Return next token from stream.
Cell-face mesh analysis engine.