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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
// Copyright (c) 2014
// INRIA Saclay-Ile de France (France)
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h $
// $Id: include/CGAL/NewKernel_d/Wrapper/Vector_d.h b26b07a1242 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
// Author(s) : Marc Glisse
#ifndef CGAL_WRAPPER_VECTOR_D_H
#define CGAL_WRAPPER_VECTOR_D_H
#include <istream>
#include <ostream>
#include <CGAL/IO/io.h>
#include <CGAL/Origin.h>
#include <CGAL/Kernel/mpl.h>
#include <CGAL/representation_tags.h>
#include <CGAL/assertions.h>
#include <boost/type_traits.hpp>
#include <CGAL/Kernel/Return_base_tag.h>
#include <CGAL/Dimension.h>
namespace CGAL {
namespace Wrap {
template <class R_>
class Vector_d : public Get_type<typename R_::Kernel_base, Vector_tag>::type
{
typedef typename Get_type<R_, RT_tag>::type RT_;
typedef typename Get_type<R_, FT_tag>::type FT_;
typedef typename R_::Kernel_base Kbase;
typedef typename Get_type<R_, Point_tag>::type Point_;
typedef typename Get_functor<Kbase, Construct_ttag<Vector_tag> >::type CVBase;
typedef typename Get_functor<Kbase, Compute_vector_cartesian_coordinate_tag>::type CCBase;
typedef typename Get_functor<Kbase, Construct_ttag<Vector_cartesian_const_iterator_tag> >::type CVI;
typedef typename Get_functor<Kbase, Squared_length_tag>::type SLBase;
typedef Vector_d Self;
static_assert(std::is_same<Self, typename Get_type<R_, Vector_tag>::type>::value);
public:
typedef Tag_true Is_wrapper;
typedef typename R_::Default_ambient_dimension Ambient_dimension;
typedef Dimension_tag<0> Feature_dimension;
//typedef typename R_::Vector_cartesian_const_iterator Cartesian_const_iterator;
typedef typename Get_type<Kbase, Vector_tag>::type Rep;
const Rep& rep() const
{
return *this;
}
Rep& rep()
{
return *this;
}
typedef R_ R;
#if defined(BOOST_MSVC) && (BOOST_MSVC == 1900)
# pragma warning(push)
# pragma warning(disable: 4309)
#endif
template<class...U,class=std::enable_if_t<!std::is_same<std::tuple<typename std::decay<U>::type...>,std::tuple<Vector_d> >::value>> explicit Vector_d(U&&...u)
: Rep(CVBase()(std::forward<U>(u)...)){}
#if defined(BOOST_MSVC) && (BOOST_MSVC == 1900)
# pragma warning(pop)
#endif
// // called from Construct_vector_d
// template<class...U> explicit Vector_d(Eval_functor&&,U&&...u)
// : Rep(Eval_functor(), std::forward<U>(u)...){}
template<class F,class...U> explicit Vector_d(Eval_functor&&,F&&f,U&&...u)
: Rep(std::forward<F>(f)(std::forward<U>(u)...)){}
#if 0
// the new standard may make this necessary
Vector_d(Vector_d const&)=default;
Vector_d(Vector_d &);//=default;
Vector_d(Vector_d &&)=default;
#endif
// try not to use these
Vector_d(Rep const& v) : Rep(v) {}
Vector_d(Rep& v) : Rep(static_cast<Rep const&>(v)) {}
Vector_d(Rep&& v) : Rep(std::move(v)) {}
// this one should be implicit
Vector_d(Null_vector const& v)
: Rep(CVBase()(v)) {}
Vector_d(Null_vector& v)
: Rep(CVBase()(v)) {}
Vector_d(Null_vector&& v)
: Rep(CVBase()(std::move(v))) {}
decltype(auto) cartesian(int i)const{
return CCBase()(rep(),i);
}
decltype(auto) operator[](int i)const{
return CCBase()(rep(),i);
}
decltype(auto) cartesian_begin()const{
return CVI()(rep(),Begin_tag());
}
decltype(auto) cartesian_end()const{
return CVI()(rep(),End_tag());
}
Vector_d operator-() const
{
return typename Get_functor<R, Opposite_vector_tag>::type()(*this);
}
int dimension() const {
typedef typename Get_functor<Kbase, Vector_dimension_tag>::type VDBase;
return VDBase()(rep());
}
decltype(auto) squared_length()const{
return SLBase()(rep());
}
friend std::ostream& operator <<(std::ostream& os, const Vector_d& v)
{
auto b = v.cartesian_begin();
auto e = v.cartesian_end();
if(IO::is_ascii(os))
{
os << v.dimension();
for(; b != e; ++b){
os << " " << *b;
}
}
else
{
write(os, v.dimension());
for(; b != e; ++b){
write(os, *b);
}
}
return os;
}
friend std::istream & operator>>(std::istream &is, Vector_d & v)
{
int dim;
if( IO::is_ascii(is) )
is >> dim;
else
{
read(is, dim);
}
if(!is) return is;
std::vector<FT_> coords(dim);
if(IO::is_ascii(is))
{
for(int i=0;i<dim;++i)
is >> IO::iformat(coords[i]);
}
else
{
for(int i=0;i<dim;++i)
read(is, coords[i]);
}
if(is)
v = Vector_d(coords.begin(), coords.end());
return is;
}
friend Vector_d operator+(const Vector_d& v,const Vector_d& w)
{
return typename Get_functor<R, Sum_of_vectors_tag>::type()(v,w);
}
friend Vector_d operator-(const Vector_d& v,const Vector_d& w)
{
return typename Get_functor<R, Difference_of_vectors_tag>::type()(v,w);
}
};
#if 0
template <class R_> Vector_d<R_>::Vector_d(Vector_d &)=default;
#endif
} //namespace Wrap
} //namespace CGAL
#endif // CGAL_WRAPPER_VECTOR_D_H
|
