33template<
class Triangulation>
50template<
class Triangulation>
61 else if (
find(orderPointPair(vA, vB)) ==
end())
70template<
class Triangulation>
82 return insert(orderPointPair(vA, vB));
88template<
class Triangulation>
92 triangulation_(triangulation)
98template<
class Triangulation>
105template<
class Triangulation>
112 return insertPointPair(vA, vB);
116template<
class Triangulation>
119 const labelPair& master,
120 const DynamicList<labelPair>& slaves
123 for (
const labelPair& slave : slaves)
125 addPointPair(master, slave);
132template<
class Triangulation>
139 const label procNo = Pstream::myProcNo();
144 return addPointPair(a,
b);
148template<
class Triangulation>
151 const Vertex_handle& vA,
152 const Vertex_handle& vB
155 if (vA->boundaryPoint() && vB->boundaryPoint())
157 labelPair a(vA->index(), vA->procIndex());
160 return findPointPair(a,
b);
167template<
class Triangulation>
174 return findPointPair(vA, vB);
178template<
class Triangulation>
181 pointPairs<Triangulation> newTable(triangulation_);
192 if (start.second() == Pstream::myProcNo())
194 const auto iter2 = oldToNewIndices.cfind(start.first());
200 start.first() = iter2();
209 if (
end.second() == Pstream::myProcNo())
211 const auto iter2 = oldToNewIndices.cfind(
end.first());
217 end.first() = iter2();
228 if (
e.first() <
e.second())
232 else if (
e.first() >
e.second())
239 this->transfer(newTable);
An ordered pair of two objects of type <T> with first() and second() elements.
HashSet of unique edges. The edges are stored as a pair of pairs:
bool addPointPair(const labelPair &vA, const labelPair &vB)
bool isPointPair(const Vertex_handle &vA, const Vertex_handle &vB) const
void reIndex(const Map< label > &oldToNewIndices)
label find(const ListType &input, const UnaryPredicate &pred, const label start=0)
Same as ListOps::find_if.
Pair< label > labelPair
A pair of labels.
void reverse(UList< T > &list, const label n)
Reverse the first n elements of the list.
Pair< labelPair > labelPairPair
A pair of labelPairs.
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
srcOptions insert("case", fileName(rootDirSource/caseDirSource))
#define forAllConstIters(container, iter)
Iterate across all elements of the container object with const access.