clang-format files

1 files changed, 18 insertions, 20 deletions

diff --git a/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation.h b/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation.h
index 19ceb007..2a57666d 100644
--- a/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation.h
+++ b/src/Coxeter_triangulation/include/gudhi/Coxeter_triangulation.h
@@ -26,10 +26,10 @@
 #include <gudhi/Permutahedral_representation.h>
 
 namespace Gudhi {
-  
+
 namespace coxeter_triangulation {
 
-/** 
+/**
  * \class Coxeter_triangulation
  * \brief A class that stores Coxeter triangulation of type \f$\tilde{A}_d\f$.
  * This triangulation has the greatest simplex quality out of all linear transformations
@@ -40,50 +40,48 @@ namespace coxeter_triangulation {
  * \tparam Permutahedral_representation_ Type of a simplex given by a permutahedral representation.
  *  Needs to be a model of SimplexInCoxeterTriangulation.
  */
-template <class Permutahedral_representation_
-          = Permutahedral_representation<std::vector<int>, std::vector<std::vector<std::size_t> > > >
+template <class Permutahedral_representation_ =
+              Permutahedral_representation<std::vector<int>, std::vector<std::vector<std::size_t> > > >
 class Coxeter_triangulation : public Freudenthal_triangulation<Permutahedral_representation_> {
   using Matrix = Eigen::MatrixXd;
 
   Matrix root_matrix(unsigned d) {
-    Matrix cartan(d,d);
+    Matrix cartan(d, d);
     for (unsigned i = 0; i < d; i++) {
-      cartan(i,i) = 1.0;
+      cartan(i, i) = 1.0;
     }
     for (unsigned i = 1; i < d; i++) {
-      cartan(i-1,i) = -0.5;
-      cartan(i,i-1) = -0.5;
+      cartan(i - 1, i) = -0.5;
+      cartan(i, i - 1) = -0.5;
     }
     for (unsigned i = 0; i < d; i++)
       for (unsigned j = 0; j < d; j++)
-        if (j+1 < i || j > i+1) 
-          cartan(i,j) = 0;    
+        if (j + 1 < i || j > i + 1) cartan(i, j) = 0;
     Eigen::SelfAdjointEigenSolver<Matrix> saes(cartan);
     Eigen::VectorXd sqrt_diag(d);
-    for (unsigned i = 0; i < d; ++i)
-      sqrt_diag(i) = std::sqrt(saes.eigenvalues()[i]);
+    for (unsigned i = 0; i < d; ++i) sqrt_diag(i) = std::sqrt(saes.eigenvalues()[i]);
 
-    Matrix lower(d,d);
+    Matrix lower(d, d);
     for (unsigned i = 0; i < d; i++)
       for (unsigned j = 0; j < d; j++)
         if (i < j)
-          lower(i,j) = 0;
+          lower(i, j) = 0;
         else
-          lower(i,j) = 1;    
-    Matrix result = (lower * saes.eigenvectors()*sqrt_diag.asDiagonal()).inverse();
+          lower(i, j) = 1;
+    Matrix result = (lower * saes.eigenvectors() * sqrt_diag.asDiagonal()).inverse();
     return result;
   }
 
  public:
-  /** \brief Constructor of Coxeter triangulation of a given dimension. 
+  /** \brief Constructor of Coxeter triangulation of a given dimension.
    * @param[in] dimension The dimension of the triangulation.
    */
   Coxeter_triangulation(std::size_t dimension)
-    : Freudenthal_triangulation<Permutahedral_representation_>(dimension, root_matrix(dimension)) {}
+      : Freudenthal_triangulation<Permutahedral_representation_>(dimension, root_matrix(dimension)) {}
 };
 
-} // namespace coxeter_triangulation
+}  // namespace coxeter_triangulation
 
-} // namespace Gudhi
+}  // namespace Gudhi
 
 #endif