clang format files

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/periodic_cubical_complex_fix@2846 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: e4f9294f08f25331eac20bb90a321792e96cca2d

3 files changed, 33 insertions, 34 deletions

diff --git a/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex.cpp b/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex.cpp
index 6c02eff1..9d1bc08c 100644
--- a/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex.cpp
+++ b/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex.cpp
@@ -20,7 +20,6 @@
  *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 
-
 #include <gudhi/reader_utils.h>
 #include <gudhi/Bitmap_cubical_complex.h>
 #include <gudhi/Persistent_cohomology.h>
@@ -32,16 +31,18 @@
 #include <cstddef>
 
 int main(int argc, char** argv) {
-  std::cout << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical " <<
-      "complexes provided in text files in Perseus style (the only numbered in the first line is a dimension D of a" <<
-      "bitmap. In the lines I between 2 and D+1 there are numbers of top dimensional cells in the direction I. Let " <<
-      "N denote product of the numbers in the lines between 2 and D. In the lines D+2 to D+2+N there are " <<
-      "filtrations of top dimensional cells. We assume that the cells are in the lexicographical order. See " <<
-      "CubicalOneSphere.txt or CubicalTwoSphere.txt for example.\n" << std::endl;
+  std::cout
+      << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical "
+      << "complexes provided in text files in Perseus style (the only numbered in the first line is a dimension D of a"
+      << "bitmap. In the lines I between 2 and D+1 there are numbers of top dimensional cells in the direction I. Let "
+      << "N denote product of the numbers in the lines between 2 and D. In the lines D+2 to D+2+N there are "
+      << "filtrations of top dimensional cells. We assume that the cells are in the lexicographical order. See "
+      << "CubicalOneSphere.txt or CubicalTwoSphere.txt for example.\n"
+      << std::endl;
 
   if (argc != 2) {
-    std::cerr << "Wrong number of parameters. Please provide the name of a file with a Perseus style bitmap at " <<
-        "the input. The program will now terminate.\n";
+    std::cerr << "Wrong number of parameters. Please provide the name of a file with a Perseus style bitmap at "
+              << "the input. The program will now terminate.\n";
     return 1;
   }
 
@@ -66,7 +67,7 @@ int main(int argc, char** argv) {
   std::size_t last_in_path = output_file_name.find_last_of("/\\");
 
   if (last_in_path != std::string::npos) {
-    output_file_name = output_file_name.substr(last_in_path+1);
+    output_file_name = output_file_name.substr(last_in_path + 1);
   }
 
   std::ofstream out(output_file_name.c_str());
@@ -77,4 +78,3 @@ int main(int argc, char** argv) {
 
   return 0;
 }
-
diff --git a/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex_periodic_boundary_conditions.cpp b/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex_periodic_boundary_conditions.cpp
index 32935205..c812cb3a 100644
--- a/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex_periodic_boundary_conditions.cpp
+++ b/src/Bitmap_cubical_complex/example/Bitmap_cubical_complex_periodic_boundary_conditions.cpp
@@ -20,7 +20,6 @@
  *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 
-
 #include <gudhi/reader_utils.h>
 #include <gudhi/Bitmap_cubical_complex.h>
 #include <gudhi/Bitmap_cubical_complex_periodic_boundary_conditions_base.h>
@@ -33,22 +32,24 @@
 #include <string>
 
 int main(int argc, char** argv) {
-  std::cout << "This program computes persistent homology, by using " <<
-      "Bitmap_cubical_complex_periodic_boundary_conditions class, of cubical complexes provided in text files in " <<
-      "Perseus style (the only numbered in the first line is a dimension D of a bitmap. In the lines I between 2 " <<
-      "and D+1 there are numbers of top dimensional cells in the direction I. Let N denote product of the numbers " <<
-      "in the lines between 2 and D. In the lines D+2 to D+2+N there are filtrations of top dimensional cells. We " <<
-      "assume that the cells are in the lexicographical order. See CubicalOneSphere.txt or CubicalTwoSphere.txt for" <<
-      " example.\n" << std::endl;
+  std::cout
+      << "This program computes persistent homology, by using "
+      << "Bitmap_cubical_complex_periodic_boundary_conditions class, of cubical complexes provided in text files in "
+      << "Perseus style (the only numbered in the first line is a dimension D of a bitmap. In the lines I between 2 "
+      << "and D+1 there are numbers of top dimensional cells in the direction I. Let N denote product of the numbers "
+      << "in the lines between 2 and D. In the lines D+2 to D+2+N there are filtrations of top dimensional cells. We "
+      << "assume that the cells are in the lexicographical order. See CubicalOneSphere.txt or CubicalTwoSphere.txt for"
+      << " example.\n"
+      << std::endl;
 
   if (argc != 2) {
-    std::cerr << "Wrong number of parameters. Please provide the name of a file with a Perseus style bitmap at " <<
-        "the input. The program will now terminate.\n";
+    std::cerr << "Wrong number of parameters. Please provide the name of a file with a Perseus style bitmap at "
+              << "the input. The program will now terminate.\n";
     return 1;
   }
 
   typedef Gudhi::cubical_complex::Bitmap_cubical_complex_periodic_boundary_conditions_base<double> Bitmap_base;
-  typedef Gudhi::cubical_complex::Bitmap_cubical_complex< Bitmap_base > Bitmap_cubical_complex;
+  typedef Gudhi::cubical_complex::Bitmap_cubical_complex<Bitmap_base> Bitmap_cubical_complex;
 
   Bitmap_cubical_complex b(argv[1]);
 
@@ -68,7 +69,7 @@ int main(int argc, char** argv) {
   std::size_t last_in_path = output_file_name.find_last_of("/\\");
 
   if (last_in_path != std::string::npos) {
-    output_file_name = output_file_name.substr(last_in_path+1);
+    output_file_name = output_file_name.substr(last_in_path + 1);
   }
 
   std::ofstream out(output_file_name.c_str());
@@ -79,4 +80,3 @@ int main(int argc, char** argv) {
 
   return 0;
 }
-
diff --git a/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp b/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
index 16ad65a0..f70558f2 100644
--- a/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
+++ b/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
@@ -20,7 +20,6 @@
  *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
  */
 
-
 // for persistence algorithm
 #include <gudhi/reader_utils.h>
 #include <gudhi/Bitmap_cubical_complex.h>
@@ -34,10 +33,11 @@
 int main(int argc, char** argv) {
   srand(time(0));
 
-  std::cout << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical " <<
-      "complexes. The first parameter of the program is the dimension D of the bitmap. The next D parameters are " <<
-      "number of top dimensional cubes in each dimension of the bitmap. The program will create random cubical " <<
-      "complex of that sizes and compute persistent homology of it." << std::endl;
+  std::cout
+      << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical "
+      << "complexes. The first parameter of the program is the dimension D of the bitmap. The next D parameters are "
+      << "number of top dimensional cubes in each dimension of the bitmap. The program will create random cubical "
+      << "complex of that sizes and compute persistent homology of it." << std::endl;
 
   int p = 2;
   double min_persistence = 0;
@@ -47,16 +47,16 @@ int main(int argc, char** argv) {
     return 1;
   }
 
-  size_t dimensionOfBitmap = (size_t) atoi(argv[1]);
-  std::vector< unsigned > sizes;
+  size_t dimensionOfBitmap = (size_t)atoi(argv[1]);
+  std::vector<unsigned> sizes;
   size_t multipliers = 1;
   for (size_t dim = 0; dim != dimensionOfBitmap; ++dim) {
-    unsigned sizeInThisDimension = (unsigned) atoi(argv[2 + dim]);
+    unsigned sizeInThisDimension = (unsigned)atoi(argv[2 + dim]);
     sizes.push_back(sizeInThisDimension);
     multipliers *= sizeInThisDimension;
   }
 
-  std::vector< double > data;
+  std::vector<double> data;
   for (size_t i = 0; i != multipliers; ++i) {
     data.push_back(rand() / static_cast<double>(RAND_MAX));
   }
@@ -80,4 +80,3 @@ int main(int argc, char** argv) {
 
   return 0;
 }
-