Go to the documentation of this file.
66 if( it == facetSubsets_.end() )
69 it().addElement(triI);
79 if( it == facetSubsets_.end() )
82 it().removeElement(triI);
100 if( it().contains(triI) )
101 facetSubsets.
append(it.key());
118 template<
class ListType>
122 ListType& facetsLabels
125 facetsLabels.clear();
128 if( it == facetSubsets_.end() )
131 it().containedElements(facetsLabels);
134 template<
class ListType>
143 it().updateSubset(newFacetsLabels);
LongList< labelledTri > triangles_
list of triangles
An STL-conforming iterator.
geometricSurfacePatchList patches_
list of boundary patches and their properties
void appendTriangle(const labelledTri &tria)
append a triangle to the end of the list
An STL-conforming const_iterator.
A HashTable to objects of type <T> with a label key.
forAllConstIter(PtrDictionary< phaseModel >, mixture.phases(), phase)
void addFacetToSubset(const label, const 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.
void removeFacetFromSubset(const label, const label)
const geometricSurfacePatchList & patches() const
access to patches
const labelledTri & operator[](const label) const
access to a triangle
void facetSubsetIndices(DynList< label > &) const
label size() const
return the number of triangles
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
Map< meshSubset > facetSubsets_
map of point subsets
Triangle with additional region number.
void updateFacetsSubsets(const ListType &)
const LongList< labelledTri > & facets() const
access to facets
void facetInSubsets(const label, DynList< label > &) const
void facetsInSubset(const label, ListType &) const
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.