56template<
class Triangulation>
64 typedef typename Triangulation::Vertex_handle Vertex_handle;
69 const Triangulation& triangulation_;
80 inline bool insertPointPair
86 inline bool findPointPair
98 pointPairs(
const Triangulation& triangulation);
111 const Vertex_handle& vA,
112 const Vertex_handle& vB
constexpr HashSet() noexcept=default
A HashTable to objects of type <T> with a label key.
A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscri...
bool addPointPair(const labelPair &vA, const labelPair &vB)
pointPairs(const Triangulation &triangulation)
Construct from triangulation.
bool isPointPair(const Vertex_handle &vA, const Vertex_handle &vB) const
bool addPointPair(const labelPair &master, const UList< labelPair > &slaves)
bool isPointPair(const labelPair &vA, const labelPair &vB) const
void reIndex(const Map< label > &oldToNewIndices)
bool addPointPair(const label vA, const label vB)
A HashTable to objects of type <T> with a labelPair key. The hashing is based on labelPair (FixedList...
Pair< label > labelPair
A pair of labels.
Pair< labelPair > labelPairPair
Pair of labelPair.