Merge C++ version of persistence representation

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

Former-commit-id: 6421c7cbe670fad1a8900ccc0ea6ff32297dd5e7

1 files changed, 64 insertions, 0 deletions

diff --git a/src/Persistence_representations/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp b/src/Persistence_representations/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp
new file mode 100644
index 00000000..66fa31ca
--- /dev/null
+++ b/src/Persistence_representations/utilities/persistence_intervals/compute_birth_death_range_in_persistence_diagram.cpp
@@ -0,0 +1,64 @@
+/*    This file is part of the Gudhi Library. The Gudhi library
+ *    (Geometric Understanding in Higher Dimensions) is a generic C++
+ *    library for computational topology.
+ *
+ *    Author(s):       Pawel Dlotko
+ *
+ *    Copyright (C) 2016  INRIA (France)
+ *
+ *    This program is free software: you can redistribute it and/or modify
+ *    it under the terms of the GNU General Public License as published by
+ *    the Free Software Foundation, either version 3 of the License, or
+ *    (at your option) any later version.
+ *
+ *    This program is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *    GNU General Public License for more details.
+ *
+ *    You should have received a copy of the GNU General Public License
+ *    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <gudhi/reader_utils.h>
+#include <gudhi/Persistence_intervals.h>
+
+#include <iostream>
+#include <vector>
+#include <limits>
+#include <utility>
+
+using Persistence_intervals = Gudhi::Persistence_representations::Persistence_intervals;
+
+int main(int argc, char** argv) {
+  std::cout << "This program compute the range of birth and death times of persistence pairs in diagrams provided as "
+               "an input. \n";
+  std::cout << "The first parameter of the program is the dimension of persistence to be used. If your file contains ";
+  std::cout << "the information about dimension of persistence pairs, please provide here the dimension of persistence "
+               "pairs you want to use. If your input files consist only ";
+  std::cout << "of birth-death pairs, please set this first parameter to -1 \n";
+  std::cout << "The remaining parameters of the program are the names of files with persistence diagrams. \n";
+
+  int dim = atoi(argv[1]);
+  unsigned dimension = std::numeric_limits<unsigned>::max();
+  if (dim >= 0) {
+    dimension = (unsigned)dim;
+  }
+  std::vector<const char*> filenames;
+  for (int i = 2; i < argc; ++i) {
+    filenames.push_back(argv[i]);
+  }
+
+  double min_ = std::numeric_limits<double>::max();
+  double max_ = -std::numeric_limits<double>::max();
+
+  for (size_t file_no = 0; file_no != filenames.size(); ++file_no) {
+    std::cout << "Creating diagram based on a file : " << filenames[file_no] << std::endl;
+    Persistence_intervals p(filenames[file_no], dimension);
+    std::pair<double, double> min_max_ = p.get_x_range();
+    if (min_max_.first < min_) min_ = min_max_.first;
+    if (min_max_.second > max_) max_ = min_max_.second;
+  }
+  std::cout << "Birth-death range : min: " << min_ << ", max: " << max_ << std::endl;
+  return 0;
+}