blob: 905d68d5f529ca309f2c75c9c8ccf7fe5d5227e3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
* See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
* Author(s): Siargey Kachanovich
*
* Copyright (C) 2019 Inria
*
* Modification(s):
* - YYYY/MM Author: Description of the modification
*/
#ifndef PERMUTAHEDRAL_REPRESENTATION_SIMPLEX_COMPARATOR_H_
#define PERMUTAHEDRAL_REPRESENTATION_SIMPLEX_COMPARATOR_H_
namespace Gudhi {
namespace coxeter_triangulation {
/** \class Simplex_comparator
* \brief A comparator class for Permutahedral_representation.
* The comparison is in lexicographic order first on
* vertices and then on ordered partitions with sorted parts.
* The lexicographic order forces that any face is larger than
* a coface.
*
* \tparam Permutahdral_representation_ Needs to be
* Permutahedral_representation<Vertex_, Ordered_set_partition_>
*
* \ingroup coxeter_triangulation
*/
template <class Permutahedral_representation_>
struct Simplex_comparator {
/** \brief Comparison between two permutahedral representations.
* Both permutahedral representations need to be valid and
* the vertices of both permutahedral representations need to be of the same size.
*/
bool operator()(const Permutahedral_representation_& lhs, const Permutahedral_representation_& rhs) const {
if (lhs.vertex() < rhs.vertex()) return true;
if (lhs.vertex() > rhs.vertex()) return false;
if (lhs.partition().size() > rhs.partition().size()) return true;
if (lhs.partition().size() < rhs.partition().size()) return false;
if (lhs.partition() < rhs.partition()) return true;
if (lhs.partition() > rhs.partition()) return false;
return false;
}
};
} // namespace coxeter_triangulation
} // namespace Gudhi
#endif
|
