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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
// Copyright (c) 2018 GeometryFactory Sarl (France).
// All rights reserved.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/Stream_support/include/CGAL/Stream_support/internal/Geometry_container.h $
// $Id: include/CGAL/Stream_support/internal/Geometry_container.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Maxime Gimeno
#ifndef GEOMETRY_CONTAINER_H
#define GEOMETRY_CONTAINER_H
#include <boost/geometry/io/wkt/write.hpp>
#include <boost/geometry/io/wkt/read.hpp>
#include <memory>
struct Dummy_deleter{
template<class T>
void operator()(T*){
}
};
namespace CGAL{
namespace internal{
/* \brief The Geometry_container struct is a wrapper
that provides an easy way to use the read and write functions
of `Polygon_IO`.
\tparam Range is a model of `RandomAccessRange`
\tparam TAG is the tag corresponding to the wkt structure you want
to be read or written with this `CGAL::Geometry_container`
*/
template <typename Range, typename TAG>
struct Geometry_container{
typedef std::pair<Range, TAG> type;
typedef typename Range::difference_type difference_type;
typedef typename Range::iterator iterator;
typedef typename Range::const_iterator const_iterator;
typedef typename Range::reverse_iterator reverse_iterator;
typedef typename Range::const_reverse_iterator const_reverse_iterator;
typedef typename Range::size_type size_type;
typedef typename Range::value_type value_type;
std::shared_ptr<Range> range;
//
// Default constructor.
// Creates a new internal Range.
// De-allocate memory after usage.
Geometry_container() : range(std::make_shared<Range>()) {}
/*
Store a pointer to the given range.
Memory NOT de-allocated after usage.
*/
Geometry_container(Range& range) : range(&range, Dummy_deleter()) {}
iterator begin()
{ return range->begin(); }
iterator end()
{ return range->end(); }
reverse_iterator rbegin()
{ return range->rbegin(); }
reverse_iterator rend()
{ return range->rend(); }
const_iterator begin()const
{ return range->begin(); }
const_iterator end()const
{ return range->end(); }
const_reverse_iterator rbegin()const
{ return range->rbegin(); }
const_reverse_iterator rend()const
{ return range->rend(); }
void clear(){ range->clear(); }
template<typename size_t>
void resize(size_t n){ range->resize(n); }
template<typename T>
void push_back(const T& t){ range->push_back(t); }
size_type size() { return range->size(); }
value_type operator[](size_type i)
{ return range[i]; }
};//end Geometry_container
} //end internal
}//end CGAL
namespace boost{
template< class T, typename TAG >
struct range_iterator<CGAL::internal::Geometry_container<T, TAG> >
{ typedef typename T::iterator type; };
template< class T, typename TAG >
struct range_iterator<const CGAL::internal::Geometry_container<T, TAG> >
{ typedef typename T::const_iterator type; };
template< class T, typename TAG >
struct range_mutable_iterator<CGAL::internal::Geometry_container<T, TAG> >
{ typedef typename range_mutable_iterator<T>::type type; };
}//end boost
#endif // GEOMETRY_CONTAINER_H
|
