56template<
class Triangulation>
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
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 that is similar to std::unordered_set.
A HashTable to objects of type <T> with a label key.
An ordered pair of two objects of type <T> with first() and second() elements.
CellSizeDelaunay::Vertex_handle Vertex_handle
HashSet of unique edges. The edges are stored as a pair of pairs:
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 isPointPair(const labelPair &vA, const labelPair &vB) const
void reIndex(const Map< label > &oldToNewIndices)
bool addPointPair(const label vA, const label vB)
bool addPointPair(const labelPair &master, const DynamicList< labelPair > &slaves)
A HashTable to objects of type <T> with a labelPair key. The hashing is based on labelPair (FixedList...