From 0729a55a67503c068e4843c63930d6b29e76f7ac Mon Sep 17 00:00:00 2001
From: pdlotko <pdlotko@636b058d-ea47-450e-bf9e-a15bfbe3eedb>
Date: Fri, 3 Nov 2017 05:10:17 +0000
Subject: a few more changes

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

Former-commit-id: d12b2413620003883e82b3022f8d933aa05e2856
---
 src/common/include/gudhi/file_writer.h | 157 +++++++++++++++++++++++++++++++++
 1 file changed, 157 insertions(+)
 create mode 100644 src/common/include/gudhi/file_writer.h

(limited to 'src/common/include/gudhi')

diff --git a/src/common/include/gudhi/file_writer.h b/src/common/include/gudhi/file_writer.h
new file mode 100644
index 00000000..1b59ae46
--- /dev/null
+++ b/src/common/include/gudhi/file_writer.h
@@ -0,0 +1,157 @@
+/*    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) 2017  Swansea University, UK
+ *
+ *    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/>.
+ */
+
+#ifndef FILE_WRITER_
+#define FILE_WRITER_
+
+#include <iostream>
+#include <string>
+#include <limits>
+
+namespace Gudhi {
+
+
+/**
+* This is a class to store persistence intervals. Its main purpose is to 
+* exchange data in between different packages and provide unified way
+* of writing a collection of persistence intervals to file. 
+**/
+template <typename Filtration_type , typename Coefficient_field>
+class Persistence_interval_common
+{
+public:	
+	Persistence_interval_common( Filtration_type birth , Filtration_type death ):
+	birth_(birth),death_(death),dimension_(std::numeric_limits<unsigned>::max),
+	Arith_element_(std::numeric_limits<Coefficient_field>::max() ){} 
+	
+	Persistence_interval_common( Filtration_type birth , Filtration_type death,
+	unsigned dim ):
+	birth_(birth),death_(death),dimension_(dim),
+	Arith_element_(std::numeric_limits<Coefficient_field>::max()){}
+	
+	Persistence_interval_common( Filtration_type birth , Filtration_type death,
+	unsigned dim , Coefficient_field field ):
+	birth_(birth),death_(death),dimension_(dim),
+	Arith_element_(field){}
+	
+	
+	inline bool operator == ( const Persistence_interval_common &i2)
+	{
+		return ( 
+		        (this->birth_ == i2.birth_) && (this->death_ == i2.death_) && 
+		        (this->dimension_ == i2.dimension_) && (this->Arith_element_ == i2.Arith_element_)
+		       );
+	}
+	
+	inline bool operator != ( const Persistence_interval_common &i2)
+	{
+		return (!((*this)==i2));
+	}
+	
+	
+	/**
+	 * Note that this operator do not take Arith_element into account when doing comparisions.
+	**/ 
+	inline bool operator < ( const Persistence_interval_common &i2)
+	{				
+		if ( this->birth_ < i2.birth_ )
+		{
+			return true;
+		}
+		else
+		{
+			if ( this->birth_ > i2.birth_ )
+			{
+				return false;
+			}
+			else
+			{
+				//in this case this->birth_ == i2.birth_
+				if ( this->death_ > i2.death_ )
+				{
+					return true;
+				}
+				else
+				{
+					if ( this->death_ < i2.death_ )
+					{
+						return false;
+					}
+					else
+					{
+						//in this case this->death_ == i2.death_
+						if ( this->dimension_ < i2.dimension_ )
+						{
+							return true;
+						}
+						else
+						{
+							//in this case this->dimension >= i2.dimension
+							return false;
+						}
+					}
+				}
+			}
+		}
+	}
+	
+	friend std::ostream& operator<<(std::ostream& out, const Persistence_interval_common& it)
+	{
+		if ( it.Arith_element_ != std::numeric_limits<Coefficient_field>::max() ) 
+		{
+			out << it.Arith_element_ << "  ";	
+		}		
+		if ( it.dimension_ != std::numeric_limits<unsigned>::max() )
+		{
+			out << it.dimension_ << " ";
+		}				
+		out << it.birth_ << " " << it.death_ << " ";				
+		return out;
+	}
+	
+private:
+	Filtration_type birth_;
+	Filtration_type death_;
+	unsigned dimension_;
+	Coefficient_field Arith_element_;
+};//Persistence_interval_common
+
+
+/**
+ * This function write a vector<Persistence_interval_common> to a stream
+**/ 
+template <typename Filtration_type , typename Coefficient_field>
+void write_persistence_intervals_to_stream( 
+const std::vector< Persistence_interval_common<Filtration_type,Coefficient_field> >& intervals,
+                                          std::ostream& out = std::cout )
+{
+	for ( auto interval : intervals )
+	{
+		out << interval << std::endl;
+	}
+}//write_persistence_intervals_to_stream
+
+
+
+}
+
+#endif //FILE_WRITER_
-- 
cgit v1.2.3