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);
label find(const ListType &input, const UnaryPredicate &pred, const label start=0)
Same as ListOps::find_if.
srcOptions insert("case", fileName(rootDirSource/caseDirSource))
void reIndex(const Map< label > &oldToNewIndices)
static int myProcNo(const label communicator=worldComm)
Rank of this process in the communicator (starting from masterNo()). Can be negative if the process i...
bool addPointPair(const labelPair &vA, const labelPair &vB)
const dimensionedScalar e
Elementary charge.
An ordered pair of two objects of type <T> with first() and second() elements.
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
Pair< labelPair > labelPairPair
Pair of labelPair.
void reverse(UList< T > &list, const label n)
Reverse the first n elements of the list.
Pair< label > labelPair
A pair of labels.
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
bool isPointPair(const Vertex_handle &vA, const Vertex_handle &vB) const
pointPairs(const Triangulation &triangulation)
Construct from triangulation.
HashSet of unique edges. The edges are stored as a pair of pairs:
forAllConstIters(mixture.phases(), phase)