summaryrefslogtreecommitdiff
path: root/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h')
-rw-r--r--src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h138
1 files changed, 50 insertions, 88 deletions
diff --git a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h
index b1f57b08..76438c91 100644
--- a/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h
+++ b/src/Coxeter_triangulation/include/gudhi/Permutahedral_representation.h
@@ -19,7 +19,7 @@ namespace Gudhi {
namespace coxeter_triangulation {
-/**
+/**
* \class Permutahedral_representation
* \brief A class that stores the permutahedral representation of a simplex
* in a Coxeter triangulation or a Freudenthal-Kuhn triangulation.
@@ -32,93 +32,72 @@ namespace coxeter_triangulation {
*
* \tparam Vertex_ needs to be a random-access range.
* \tparam Ordered_set_partition_ needs to be a a random-access range that consists of
- * random-access ranges.
+ * random-access ranges.
*/
-template <class Vertex_,
- class Ordered_set_partition_>
+template <class Vertex_, class Ordered_set_partition_>
class Permutahedral_representation {
-
typedef Permutahedral_representation<Vertex_, Ordered_set_partition_> Self;
-public:
+ public:
/** \brief Type of the vertex. */
typedef Vertex_ Vertex;
-
+
/** \brief Type of the ordered partition. */
typedef Ordered_set_partition_ OrderedSetPartition;
-
/** \brief Permutahedral_representation constructor from a vertex and an ordered set partition.
*
* @param[in] vertex Vertex.
* @param[in] partition Ordered set partition.
- *
+ *
* \details If the size of vertex is d, the ranges in partition must consist
* of the integers 0,...,d without repetition or collision between the ranges.
*/
Permutahedral_representation(const Vertex& vertex, const OrderedSetPartition& partition)
- : vertex_(vertex), partition_(partition) {}
+ : vertex_(vertex), partition_(partition) {}
/** \brief Constructor for an empty permutahedral representation that does not correspond
* to any simplex.
*/
Permutahedral_representation() {}
-
+
/** \brief Dimension of the simplex. */
- std::size_t dimension() const {
- return partition_.size() - 1;
- }
+ std::size_t dimension() const { return partition_.size() - 1; }
/** \brief Lexicographically-minimal vertex. */
- Vertex& vertex() {
- return vertex_;
- }
+ Vertex& vertex() { return vertex_; }
/** \brief Lexicographically-minimal vertex. */
- const Vertex& vertex() const {
- return vertex_;
- }
+ const Vertex& vertex() const { return vertex_; }
/** \brief Ordered set partition. */
- OrderedSetPartition& partition() {
- return partition_;
- }
+ OrderedSetPartition& partition() { return partition_; }
/** \brief Identifying vertex. */
- const OrderedSetPartition& partition() const {
- return partition_;
- }
+ const OrderedSetPartition& partition() const { return partition_; }
/** \brief Equality operator.
* Returns true if an only if both vertex and the ordered set partition coincide.
*/
bool operator==(const Permutahedral_representation& other) const {
- if (dimension() != other.dimension())
- return false;
- if (vertex_ != other.vertex_)
- return false;
+ if (dimension() != other.dimension()) return false;
+ if (vertex_ != other.vertex_) return false;
for (std::size_t k = 0; k < partition_.size(); ++k)
- if (partition_[k] != other.partition_[k])
- return false;
+ if (partition_[k] != other.partition_[k]) return false;
return true;
}
/** \brief Inequality operator.
* Returns true if an only if either vertex or the ordered set partition are different.
*/
- bool operator!=(const Permutahedral_representation& other) const {
- return !(*this == other);
- }
+ bool operator!=(const Permutahedral_representation& other) const { return !(*this == other); }
typedef Gudhi::coxeter_triangulation::Vertex_iterator<Self> Vertex_iterator;
typedef boost::iterator_range<Vertex_iterator> Vertex_range;
/** \brief Returns a range of vertices of the simplex.
* The type of vertices is Vertex.
*/
- Vertex_range vertex_range() const {
- return Vertex_range(Vertex_iterator(*this),
- Vertex_iterator());
- }
+ Vertex_range vertex_range() const { return Vertex_range(Vertex_iterator(*this), Vertex_iterator()); }
typedef Gudhi::coxeter_triangulation::Face_iterator<Self> Face_iterator;
typedef boost::iterator_range<Face_iterator> Face_range;
@@ -126,34 +105,29 @@ public:
* @param[in] value_dim The dimension of the faces. Must be between 0 and the dimension of the simplex.
*/
Face_range face_range(std::size_t value_dim) const {
- return Face_range(Face_iterator(*this, value_dim),
- Face_iterator());
+ return Face_range(Face_iterator(*this, value_dim), Face_iterator());
}
/** \brief Returns a range of permutahedral representations of facets of the simplex.
* The dimension of the simplex must be strictly positive.
*/
- Face_range facet_range() const {
- return Face_range(Face_iterator(*this, dimension()-1),
- Face_iterator());
- }
-
+ Face_range facet_range() const { return Face_range(Face_iterator(*this, dimension() - 1), Face_iterator()); }
+
typedef Gudhi::coxeter_triangulation::Coface_iterator<Self> Coface_iterator;
typedef boost::iterator_range<Coface_iterator> Coface_range;
/** \brief Returns a range of permutahedral representations of cofaces of the simplex.
- * @param[in] value_dim The dimension of the cofaces. Must be between the dimension of the simplex and the ambient dimension (the size of the vertex).
+ * @param[in] value_dim The dimension of the cofaces. Must be between the dimension of the simplex and the ambient
+ * dimension (the size of the vertex).
*/
Coface_range coface_range(std::size_t value_dim) const {
- return Coface_range(Coface_iterator(*this, value_dim),
- Coface_iterator());
+ return Coface_range(Coface_iterator(*this, value_dim), Coface_iterator());
}
/** \brief Returns a range of permutahedral representations of cofacets of the simplex.
* The dimension of the simplex must be strictly different from the ambient dimension (the size of the vertex).
*/
Coface_range cofacet_range() const {
- return Coface_range(Coface_iterator(*this, dimension()+1),
- Coface_iterator());
+ return Coface_range(Coface_iterator(*this, dimension() + 1), Coface_iterator());
}
/** \brief Returns true, if the simplex is a face of other simplex.
@@ -162,38 +136,31 @@ public:
*/
bool is_face_of(const Permutahedral_representation& other) const {
using Part = typename OrderedSetPartition::value_type;
-
- if (other.dimension() < dimension())
- return false;
+
+ if (other.dimension() < dimension()) return false;
if (other.vertex_.size() != vertex_.size())
std::cerr << "Error: Permutahedral_representation::is_face_of: incompatible ambient dimensions.\n";
-
+
Vertex v_self = vertex_, v_other = other.vertex_;
auto self_partition_it = partition_.begin();
auto other_partition_it = other.partition_.begin();
while (self_partition_it != partition_.end()) {
while (other_partition_it != other.partition_.end() && v_self != v_other) {
const Part& other_part = *other_partition_it++;
- if (other_partition_it == other.partition_.end())
- return false;
- for (const auto& k: other_part)
- v_other[k]++;
+ if (other_partition_it == other.partition_.end()) return false;
+ for (const auto& k : other_part) v_other[k]++;
}
- if (other_partition_it == other.partition_.end())
- return false;
+ if (other_partition_it == other.partition_.end()) return false;
const Part& self_part = *self_partition_it++;
- if (self_partition_it == partition_.end())
- return true;
- for (const auto& k: self_part)
- v_self[k]++;
+ if (self_partition_it == partition_.end()) return true;
+ for (const auto& k : self_part) v_self[k]++;
}
return true;
}
-private:
+ private:
Vertex vertex_;
OrderedSetPartition partition_;
-
};
/** \brief Print a permutahedral representation to a stream.
@@ -202,10 +169,8 @@ private:
* @param[in] os The output stream.
* @param[in] simplex A simplex represented by its permutahedral representation.
*/
-template <class Vertex,
- class OrderedSetPartition>
-std::ostream& operator<<(std::ostream& os,
- const Permutahedral_representation<Vertex, OrderedSetPartition>& simplex) {
+template <class Vertex, class OrderedSetPartition>
+std::ostream& operator<<(std::ostream& os, const Permutahedral_representation<Vertex, OrderedSetPartition>& simplex) {
// vertex part
os << "(";
if (simplex.vertex().empty()) {
@@ -214,24 +179,21 @@ std::ostream& operator<<(std::ostream& os,
}
auto v_it = simplex.vertex().begin();
os << *v_it++;
- for (; v_it != simplex.vertex().end(); ++v_it)
- os << ", " << *v_it;
+ for (; v_it != simplex.vertex().end(); ++v_it) os << ", " << *v_it;
os << ")";
-
+
// ordered partition part
using Part = typename OrderedSetPartition::value_type;
- auto print_part =
- [&os](const Part& p) {
- os << "{";
- if (p.empty()) {
- os << "}";
- }
- auto p_it = p.begin();
- os << *p_it++;
- for (; p_it != p.end(); ++p_it)
- os << ", " << *p_it;
+ auto print_part = [&os](const Part& p) {
+ os << "{";
+ if (p.empty()) {
os << "}";
- };
+ }
+ auto p_it = p.begin();
+ os << *p_it++;
+ for (; p_it != p.end(); ++p_it) os << ", " << *p_it;
+ os << "}";
+ };
os << " [";
if (simplex.partition().empty()) {
os << "]";
@@ -247,8 +209,8 @@ std::ostream& operator<<(std::ostream& os,
return os;
}
-} // namespace coxeter_triangulation
+} // namespace coxeter_triangulation
-} // namespace Gudhi
+} // namespace Gudhi
-#endif // PERMUTAHEDRAL_REPRESENTATION_H_
+#endif // PERMUTAHEDRAL_REPRESENTATION_H_
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-19 21:38:21 +0000