Go to the documentation of this file.
61 if( it == featureEdgeSubsets_.end() )
74 if( it == featureEdgeSubsets_.end() )
77 it().removeElement(eI);
95 if( it().contains(eI) )
96 edgeSubsets.
append(it.key());
116 template<
class ListType>
126 if( it == featureEdgeSubsets_.end() )
129 it().containedElements(edgeLabels);
132 template<
class ListType>
135 const ListType& newEdgeLabels
141 it!=featureEdgeSubsets_.end();
144 it().updateSubset(newEdgeLabels);
void append(const T &e)
Append an element at the end of the list.
An STL-conforming iterator.
void edgesInSubset(const label, ListType &) const
An STL-conforming const_iterator.
An edge is a list of two point labels. The functionality it provides supports the discretisation on a...
A HashTable to objects of type <T> with a label key.
label size() const
Size of the active part of the list.
void addEdgeToSubset(const label, const label)
const edgeLongList & featureEdges() const
access to feature edges
forAllConstIter(PtrDictionary< phaseModel >, mixture.phases(), phase)
void removeEdgeFromSubset(const label, const label)
label nFeatureEdges() const
return the number of feature edges
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 appendFeatureEdge(const edge &e)
append an edge to the end of the list
const double e
Elementary charge.
void updateEdgeSubsets(const ListType &)
void edgeSubsetIndices(DynList< label > &) const
void edgeInSubsets(const label, DynList< label > &) const
edgeLongList featureEdges_
list of feature edges
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.