Go to the documentation of this file.
31 # ifdef DEBUGPartitioner
50 patchPatches_(
surface.patches().size()),
52 edgeGroupEdgeGroups_(),
56 calculatePatchAddressing();
98 std::pair<label, label> pp
104 std::map<std::pair<label, label>,
labelHashSet>::const_iterator it =
105 patchesEdgeGroups_.
find(pp);
107 if( it != patchesEdgeGroups_.end() )
112 edgeGroups.
append(it.key());
118 const label edgeGroup1,
119 const label edgeGroup2,
125 std::pair<label, label> ep
131 std::map<std::pair<label, label>,
labelHashSet>::const_iterator it =
132 edgeGroupsCorners_.
find(ep);
134 if( it != edgeGroupsCorners_.end() )
const List< labelHashSet > & edgeGroupEdgeGroups() const
Edge group - edge groups addressing.
void cornersSharedByEdgeGroups(const label edgePartition1, const label edgePartition2, DynList< label > &corners) const
return corners shared shared by the given edge groups
labelList edgeGroups_
edge partitions
labelList corners_
corner nodes
List< labelHashSet > patchPatches_
information which partitions share an edge with a given partition
Template functions to aid in the implementation of demand driven data.
void edgeGroupsSharedByPatches(const label partition1, const label partition2, DynList< label > &edgePartitions) const
Return groups of feature edges shared by the given patches.
triSurfacePartitioner(const triSurfacePartitioner &)
Disallow default bitwise copy construct.
forAllConstIter(PtrDictionary< phaseModel >, mixture.phases(), phase)
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
List< DynList< label > > cornerPatches_
const List< labelHashSet > & patchPatches() const
return patch-patches addressing
iterator find(const Key &)
Find and return an iterator set at the hashedEntry.
dimensioned< Type > max(const dimensioned< Type > &, const dimensioned< Type > &)
A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bound...
const labelList & corners() const
return corner nodes
List< labelHashSet > edgeGroupEdgeGroups_
const labelList & edgeGroups() const
dimensioned< Type > min(const dimensioned< Type > &, const dimensioned< Type > &)
void clear()
Clear the list, i.e. set next free to zero.
const List< DynList< label > > & cornerPatches() const
return corner patches
void append(const T &e)
Append an element at the end of the list.