From c524232f734de875d69e2f190f01a6c976024368 Mon Sep 17 00:00:00 2001
From: Gard Spreemann <gspreemann@gmail.com>
Date: Thu, 14 Jun 2018 20:39:01 +0200
Subject: GUDHI 2.2.0 as released by upstream in a tarball.

---
 .../CGAL/transforming_pair_iterator.h              | 127 ---------------------
 1 file changed, 127 deletions(-)
 delete mode 100644 include/gudhi_patches/CGAL/transforming_pair_iterator.h

(limited to 'include/gudhi_patches/CGAL/transforming_pair_iterator.h')

diff --git a/include/gudhi_patches/CGAL/transforming_pair_iterator.h b/include/gudhi_patches/CGAL/transforming_pair_iterator.h
deleted file mode 100644
index 48dac132..00000000
--- a/include/gudhi_patches/CGAL/transforming_pair_iterator.h
+++ /dev/null
@@ -1,127 +0,0 @@
-// Copyright (c) 2014
-// INRIA Saclay-Ile de France (France)
-//
-// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
-// modify it under the terms of the GNU Lesser General Public License as
-// published by the Free Software Foundation; either version 3 of the License,
-// or (at your option) any later version.
-//
-// Licensees holding a valid commercial license may use this file in
-// accordance with the commercial license agreement provided with the software.
-//
-// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
-// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-//
-// $URL$
-// $Id$
-//
-// Author(s)     : Marc Glisse
-
-#ifndef CGAL_TRANSFORMING_PAIR_ITERATOR_H
-#define CGAL_TRANSFORMING_PAIR_ITERATOR_H
-// Should be a combination of transform_iterator and zip_iterator,
-// but boost's iterator_category games are a pain.
-
-#include <CGAL/transforming_iterator.h>
-#include <CGAL/assertions.h>
-#include <boost/type_traits/is_convertible.hpp>
-
-
-
-
-namespace CGAL {
-namespace internal {
-template <class Cat1, class Cat2, bool=boost::is_convertible<Cat1,Cat2>::value>
-struct Min_category {
-	CGAL_static_assertion((boost::is_convertible<Cat2,Cat1>::value));
-	typedef Cat1 type;
-};
-
-template <class Cat1, class Cat2>
-struct Min_category<Cat1,Cat2,true> {
-	typedef Cat2 type;
-};
-
-
-template <typename Derived, typename F, typename It1, typename It2, typename Ref, typename Val>
-class transforming_pair_iterator_helper
-{
-	typedef typename Min_category<
-		typename std::iterator_traits<It1>::iterator_category,
-		typename std::iterator_traits<It1>::iterator_category>
-			::type iterator_category;
-
-	typedef typename Default::Get<Ref,
-#ifdef CGAL_CXX11
-		decltype(std::declval<F>()(std::declval<typename std::iterator_traits<It1>::reference>(),std::declval<typename std::iterator_traits<It2>::reference>()))
-#else
-		typename boost::result_of<F(typename std::iterator_traits<It1>::value_type,typename std::iterator_traits<It2>::value_type)>::type
-	// should be reference instead of value_type
-#endif
-			>::type reference;
-
-	typedef typename Default::Get<Val,typename boost::remove_cv<typename boost::remove_reference<reference>::type>::type>::type value_type;
-
-	public:
-	typedef boost::iterator_facade<
-		Derived,
-		value_type,
-		iterator_category,
-		reference
-	// expect ptrdiff_t is good enough for difference
-			> type;
-};
-}
-
-template <typename F, typename It1, typename It2, typename Ref=Default, typename Val=Default>
-class transforming_pair_iterator
-: public internal::transforming_pair_iterator_helper<transforming_pair_iterator<F,It1,It2,Ref,Val>,F,It1,It2,Ref,Val>::type,
-private internal::Functor_as_base<F>
-{
-	It1 iter1; It2 iter2;
-	friend class boost::iterator_core_access;
-	typedef typename internal::transforming_pair_iterator_helper<transforming_pair_iterator,F,It1,It2,Ref,Val>::type Base;
-	typedef internal::Functor_as_base<F> Functor_base;
-	typename Base::reference dereference()const{
-		return functor()(*iter1,*iter2);
-	}
-	bool equal(transforming_pair_iterator const&i)const{
-		bool b=(iter1==i.iter1);
-		CGAL_assertion(b==(iter2==i.iter2));
-		//FIXME: or do we want only one driving iterator
-		return b;
-	}
-	void increment(){ ++iter1; ++iter2; }
-	void decrement(){ --iter1; --iter2; }
-	void advance(std::ptrdiff_t n){
-		std::advance(iter1,n);
-		std::advance(iter2,n);
-	}
-	std::ptrdiff_t distance_to(transforming_pair_iterator const&i)const{
-		std::ptrdiff_t dist=std::distance(iter1,i.iter1);
-		CGAL_assertion(dist==std::distance(iter2,i.iter2));
-		return dist;
-	}
-	public:
-	using Functor_base::functor;
-	transforming_pair_iterator(){}
-	explicit transforming_pair_iterator(It1 i1,It2 i2,F const& f=F())
-		:Functor_base(f),iter1(i1),iter2(i2){}
-	template<class F2,class J1,class J2,class R2,class V2>
-	transforming_pair_iterator(
-		transforming_pair_iterator<F2,J1,J2,R2,V2> const&i,
-		typename boost::enable_if_convertible<J1, It1>::type* = 0,
-		typename boost::enable_if_convertible<J2, It2>::type* = 0,
-		typename boost::enable_if_convertible<F2, F>::type* = 0)
-		: Functor_base(i.functor()),iter1(i.iter1),iter2(i.iter2) {}
-
-};
-
-template <typename F, typename It1, typename It2> inline
-transforming_pair_iterator<F,It1,It2> make_transforming_pair_iterator(It1 i1, It2 i2, F const&f=F()) {
-	return transforming_pair_iterator<F,It1,It2>(i1,i2,f);
-}
-
-}
-
-#endif // CGAL_TRANSFORMING_PAIR_ITERATOR_H
-- 
cgit v1.2.3