33 template<
class Triangulation>
50 template<
class Triangulation>
61 else if (
find(orderPointPair(vA, vB)) ==
end())
70 template<
class Triangulation>
82 return insert(orderPointPair(vA, vB));
88 template<
class Triangulation>
92 triangulation_(triangulation)
98 template<
class Triangulation>
105 template<
class Triangulation>
112 return insertPointPair(vA, vB);
116 template<
class Triangulation>
120 const DynamicList<labelPair>& slaves
125 addPointPair(master, slave);
132 template<
class Triangulation>
144 return addPointPair(a,
b);
148 template<
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);
167 template<
class Triangulation>
174 return findPointPair(vA, vB);
178 template<
class Triangulation>
181 pointPairs<Triangulation> newTable(triangulation_);
194 const auto iter2 = oldToNewIndices.cfind(start.first());
200 start.first() = iter2();
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);