Go to the documentation of this file.
60 template<
class Triangulation>
101 pointPairs(
const Triangulation& triangulation);
Triangulation::Vertex_handle Vertex_handle
bool addPointPair(const labelPair &vA, const labelPair &vB)
A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects.
A HashTable with keys but without contents.
HashSet< Pair< labelPair >, FixedList< labelPair, 2 >::Hash<>> ptPairTable
intWM_LABEL_SIZE_t label
A label is an int32_t or int64_t as specified by the pre-processor macro WM_LABEL_SIZE.
HashSet of unique edges. The edges are stored as a pair of pairs:
const Triangulation & triangulation_
An ordered pair of two objects of type <T> with first() and second() elements.
bool findPointPair(const labelPair &vA, const labelPair &vB) const
void reIndex(const Map< label > &oldToNewIndices)
bool isPointPair(const Vertex_handle &vA, const Vertex_handle &vB) const
Pair< labelPair > orderPointPair(const labelPair &vA, const labelPair &vB) const
bool insertPointPair(const labelPair &vA, const labelPair &vB)
pointPairs(const Triangulation &triangulation)
Construct from triangulation.