Go to the documentation of this file.
51 ++nInPatch[
surf_[triI].region()];
59 pDict.
add(
"nFacets", nInPatch[patchI]);
76 sDict.
add(
"nPoints", inSubset.
size());
93 sDict.
add(
"nFacets", inSubset.
size());
110 sDict.
add(
"nEdges", inSubset.
size());
void pointsInSubset(const label, ListType &) const
word pointSubsetName(const label) const
#define forAll(list, i)
Loop across all elements in list.
const pointField & points() const
access to points
void edgesInSubset(const label, ListType &) const
The geometricSurfacePatch is like patchIdentifier but for surfaces. Holds type, name and index.
label size() const
Size of the active part of the list.
const edgeLongList & featureEdges() const
access to feature edges
const word & geometricType() const
Return the type of the patch.
const geometricSurfacePatchList & patches() const
access to patches
A list of keyword definitions, which are a keyword followed by any number of values (e....
void pointSubsetIndices(DynList< label > &) const
void edgeSubsetIndices(DynList< label > &) const
void facetSubsetIndices(DynList< label > &) const
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
const LongList< labelledTri > & facets() const
access to facets
word facetSubsetName(const label) const
void facetsInSubset(const label, ListType &) const
void size(const label)
Override size to be inconsistent with allocated storage.
word edgeSubsetName(const label) const
void clear()
Clear the dictionary.
const word & name() const
Return name.
void clear()
Clear the list, i.e. set next free to zero.
bool add(entry *, bool mergeEntry=false)
Add a new entry.