summaryrefslogtreecommitdiff
path: root/include/gudhi_patches/CGAL/iterator_from_indices.h
blob: 110bb4be0eceedb2effbca61f8567b0abccfa228 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// 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_ITERATOR_FROM_INDICES_H
#define CGAL_ITERATOR_FROM_INDICES_H
#include <CGAL/config.h>
#include <boost/iterator/iterator_facade.hpp>
namespace CGAL {
template <class Ref_>
struct Default_coordinate_access {
	typedef Ref_ result_type;
	template<class T> Ref_ operator()(T const& t, std::ptrdiff_t i)const{
		return t[i];
	}
};

//TODO: default type for Value_: typename same_cv<Container_,typename remove_cv<Container_>::type::value_type>::type
template <class Container_, class Value_, class Ref_=
#ifdef CGAL_CXX11
	decltype(std::declval<Container_>()[0])
#else
	Value_&
#endif
	, class Coord_access = Default_coordinate_access<Ref_>
	>
class Iterator_from_indices
: public boost::iterator_facade<Iterator_from_indices<Container_,Value_,Ref_,Coord_access>,
	Value_, std::bidirectional_iterator_tag, Ref_>
{
	friend class boost::iterator_core_access;
	//FIXME: use int to save space
	//TODO: use a tuple to save space when Coord_access is empty
	typedef std::ptrdiff_t index_t;
	Container_* cont;
	index_t index;
	Coord_access ca;
	void increment(){ ++index; }
	void decrement(){ --index; }
	void advance(std::ptrdiff_t n){ index+=n; }
	ptrdiff_t distance_to(Iterator_from_indices const& other)const{
		return other.index-index;
	}
	bool equal(Iterator_from_indices const& other)const{
		return index==other.index;
	}
	Ref_ dereference()const{
		//FIXME: use the functor properly
		//Uh, and what did I mean by that?
		return ca(*cont,index);
	}
	public:
	Iterator_from_indices(Container_& cont_,std::size_t n)
		: cont(&cont_), index(n) {}
	template<class T>
	Iterator_from_indices(Container_& cont_,std::size_t n,T const&t)
		: cont(&cont_), index(n), ca(t) {}
};
}
#endif // CGAL_ITERATOR_FROM_INDICES_H