60 template<
class Triangulation>
67 typedef typename Triangulation::Vertex_handle Vertex_handle;
72 const Triangulation& triangulation_;
77 inline Pair<labelPair> orderPointPair
83 inline bool insertPointPair
89 inline bool findPointPair
101 pointPairs(
const Triangulation& triangulation);
114 const Vertex_handle& vA,
115 const Vertex_handle& vB
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 reIndex(const Map< label > &oldToNewIndices)
bool addPointPair(const labelPair &vA, const labelPair &vB)
An ordered pair of two objects of type <T> with first() and second() elements.
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects...
bool isPointPair(const Vertex_handle &vA, const Vertex_handle &vB) const
HashSet< Pair< labelPair >, FixedList< labelPair, 2 >::Hash<>> ptPairTable
pointPairs(const Triangulation &triangulation)
Construct from triangulation.
HashSet of unique edges. The edges are stored as a pair of pairs: