From 127c62dc4ceb084b3fe8f5b8b91929793e486f17 Mon Sep 17 00:00:00 2001
From: vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Tue, 7 Nov 2017 20:05:53 +0000
Subject: 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
---
 .../example/Random_bitmap_cubical_complex.cpp         | 19 +++++++++----------
 1 file changed, 9 insertions(+), 10 deletions(-)

(limited to 'src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp')

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;
 }
-
-- 
cgit v1.2.3