/usr/include/CGAL/Cartesian_converter.h is in libcgal-dev 4.7-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 | // Copyright (c) 2001-2004
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// 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) : Sylvain Pion
// Menelaos Karavelas <mkaravel@cse.nd.edu>
#ifndef CGAL_CARTESIAN_CONVERTER_H
#define CGAL_CARTESIAN_CONVERTER_H
// This file contains the definition of a kernel converter, based on Cartesian
// representation. It should work between *Cartesian<A> and *Cartesian<B>,
// provided you give a NT converter from A to B.
// There's a Homogeneous counterpart.
#include <CGAL/basic.h>
#include <CGAL/NT_converter.h>
#include <CGAL/Enum_converter.h>
#include <CGAL/Bbox_2.h>
#include <CGAL/Bbox_3.h>
#include <CGAL/Origin.h>
#include <CGAL/Kernel/Type_mapper.h>
#include <vector>
#include <boost/mpl/lambda.hpp>
#include <boost/mpl/transform.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/mpl/not.hpp>
#include <boost/mpl/logical.hpp>
#include <boost/mpl/remove.hpp>
namespace CGAL {
// Guess which compiler needs this work around ?
// ... VC++, again!
namespace internal {
template < typename K1, typename K2 >
struct Default_converter {
typedef typename K1::FT FT1;
typedef typename K2::FT FT2;
typedef ::CGAL::NT_converter<FT1, FT2> Type;
};
// Out will be a variant, source kernel and target kernel
template<typename Converter, typename Output>
struct Converting_visitor : boost::static_visitor<> {
Converting_visitor(const Converter& conv, Output& out) : conv(&conv), out(&out) {}
const Converter* conv;
Output* out;
template<typename T>
void operator()(const T& t) { *out = conv->operator()(t); }
template<typename T>
void operator()(const std::vector<T>& t) {
typedef typename
Type_mapper< T, typename Converter::Source_kernel,
typename Converter::Target_kernel >::type
value_type;
std::vector< value_type > tmp;
tmp.reserve(t.size());
for(typename std::vector< T >::const_iterator it = t.begin();
it != t.end(); ++it) {
tmp.push_back(conv->operator()(*it));
}
*out = tmp;
}
};
} // namespace internal
template < class K1, class K2,
// class Converter = NT_converter<typename K1::FT, typename K2::FT> >
class Converter = typename internal::Default_converter<K1, K2>::Type >
class Cartesian_converter : public Enum_converter
{
typedef Enum_converter Base;
typedef Cartesian_converter Self;
public:
typedef K1 Source_kernel;
typedef K2 Target_kernel;
typedef Converter Number_type_converter;
using Base::operator();
Origin
operator()(const Origin& o) const
{
return o;
}
Null_vector
operator()(const Null_vector& n) const
{
return n;
}
Bbox_2
operator()(const Bbox_2& b) const
{
return b;
}
Bbox_3
operator()(const Bbox_3& b) const
{
return b;
}
typename K2::FT
operator()(const typename K1::FT &a) const
{
return c(a);
}
// drop the boost::detail::variant::void_ generated by the macros
// from the sequence, transform with the type mapper and throw the
// new list into a variant
// visit to get the type, and copy construct inside the return type
template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
typename
Type_mapper< boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
K1, K2 >::type
operator()(const boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
typedef typename
Type_mapper< boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
K1, K2 >::type result_type;
result_type res;
if(!o) {
// empty converts to empty
return res;
}
internal::Converting_visitor<Self, result_type>
conv_visitor = internal::Converting_visitor<Self, result_type>(*this, res);
boost::apply_visitor(conv_visitor, *o);
return res;
}
template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
typename
Type_mapper< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) >,
K1, K2 >::type
operator()(const boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > & o) const {
typedef typename
Type_mapper< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) >,
K1, K2 >::type result_type;
result_type res;
internal::Converting_visitor<Self, result_type>
conv_visitor = internal::Converting_visitor<Self, result_type>(*this, res);
boost::apply_visitor(conv_visitor, o);
return res;
}
typename K2::Object_2
operator()(const typename K1::Object_2 &obj) const
{
#define CGAL_Kernel_obj(X) \
if (const typename K1::X * ptr = object_cast<typename K1::X>(&obj)) \
return make_object(operator()(*ptr));
#include <CGAL/Kernel/interface_macros.h>
#define CGAL_Kernel_obj(X) \
if (const std::vector<typename K1::X> * ptr = object_cast<std::vector<typename K1::X> >(&obj)) { \
std::vector<typename K2::X> res; \
res.reserve((*ptr).size()); \
for(unsigned int i=0; i < (*ptr).size(); i++){ \
res.push_back(operator()((*ptr)[i])); \
} \
return make_object(res); \
}
CGAL_Kernel_obj(Point_2)
CGAL_Kernel_obj(Point_3)
#undef CGAL_Kernel_obj
CGAL_error_msg("Cartesian_converter is unable to determine what is wrapped in the Object");
return Object();
}
std::vector<Object>
operator()(const std::vector<Object>& v) const
{
std::vector<Object> res;
res.reserve(v.size());
for(unsigned int i = 0; i < v.size(); i++) {
res.push_back(operator()(v[i]));
}
return res;
}
typename K2::Point_2
operator()(const typename K1::Point_2 &a) const
{
typedef typename K2::Point_2 Point_2;
return Point_2(c(a.x()), c(a.y()));
}
typename K2::Vector_2
operator()(const typename K1::Vector_2 &a) const
{
typedef typename K2::Vector_2 Vector_2;
return Vector_2(c(a.x()), c(a.y()));
}
typename K2::Direction_2
operator()(const typename K1::Direction_2 &a) const
{
typedef typename K2::Direction_2 Direction_2;
return Direction_2(c(a.dx()), c(a.dy()));
}
typename K2::Segment_2
operator()(const typename K1::Segment_2 &a) const
{
typedef typename K2::Segment_2 Segment_2;
return Segment_2(operator()(a.source()), operator()(a.target()));
}
typename K2::Line_2
operator()(const typename K1::Line_2 &a) const
{
typedef typename K2::Line_2 Line_2;
return Line_2(c(a.a()), c(a.b()), c(a.c()));
}
typename K2::Ray_2
operator()(const typename K1::Ray_2 &a) const
{
typedef typename K2::Ray_2 Ray_2;
return Ray_2(operator()(a.source()), operator()(a.second_point()));
}
typename K2::Circle_2
operator()(const typename K1::Circle_2 &a) const
{
typedef typename K2::Circle_2 Circle_2;
return Circle_2(operator()(a.center()),
c(a.squared_radius()),
K1().orientation_2_object()(a));
}
typename K2::Triangle_2
operator()(const typename K1::Triangle_2 &a) const
{
typedef typename K2::Triangle_2 Triangle_2;
return Triangle_2(operator()(a.vertex(0)),
operator()(a.vertex(1)),
operator()(a.vertex(2)));
}
typename K2::Iso_rectangle_2
operator()(const typename K1::Iso_rectangle_2 &a) const
{
typedef typename K2::Iso_rectangle_2 Iso_rectangle_2;
return Iso_rectangle_2(operator()((a.min)()), operator()((a.max)()), 0);
}
typename K2::Point_3
operator()(const typename K1::Point_3 &a) const
{
typedef typename K2::Point_3 Point_3;
return Point_3(c(a.x()), c(a.y()), c(a.z()));
}
typename K2::Vector_3
operator()(const typename K1::Vector_3 &a) const
{
typedef typename K2::Vector_3 Vector_3;
return Vector_3(c(a.x()), c(a.y()), c(a.z()));
}
typename K2::Direction_3
operator()(const typename K1::Direction_3 &a) const
{
typedef typename K2::Direction_3 Direction_3;
return Direction_3(c(a.dx()), c(a.dy()), c(a.dz()));
}
typename K2::Segment_3
operator()(const typename K1::Segment_3 &a) const
{
typedef typename K2::Segment_3 Segment_3;
return Segment_3(operator()(a.source()), operator()(a.target()));
}
typename K2::Line_3
operator()(const typename K1::Line_3 &a) const
{
typedef typename K2::Line_3 Line_3;
return Line_3(operator()(a.point()), operator()(a.to_vector()));
}
typename K2::Ray_3
operator()(const typename K1::Ray_3 &a) const
{
typedef typename K2::Ray_3 Ray_3;
return Ray_3(operator()(a.source()), operator()(a.second_point()));
}
typename K2::Sphere_3
operator()(const typename K1::Sphere_3 &a) const
{
typedef typename K2::Sphere_3 Sphere_3;
return Sphere_3(operator()(a.center()),
c(a.squared_radius()),
K1().orientation_3_object()(a));
}
typename K2::Circle_3
operator()(const typename K1::Circle_3 &a) const
{
typedef typename K2::Circle_3 Circle_3;
return Circle_3(operator()(a.diametral_sphere()),
operator()(a.supporting_plane()),1);
}
typename K2::Triangle_3
operator()(const typename K1::Triangle_3 &a) const
{
typedef typename K2::Triangle_3 Triangle_3;
return Triangle_3(operator()(a.vertex(0)),
operator()(a.vertex(1)),
operator()(a.vertex(2)));
}
typename K2::Tetrahedron_3
operator()(const typename K1::Tetrahedron_3 &a) const
{
typedef typename K2::Tetrahedron_3 Tetrahedron_3;
return Tetrahedron_3(operator()(a.vertex(0)),
operator()(a.vertex(1)),
operator()(a.vertex(2)),
operator()(a.vertex(3)));
}
typename K2::Plane_3
operator()(const typename K1::Plane_3 &a) const
{
typedef typename K2::Plane_3 Plane_3;
return Plane_3(c(a.a()), c(a.b()), c(a.c()), c(a.d()));
}
typename K2::Iso_cuboid_3
operator()(const typename K1::Iso_cuboid_3 &a) const
{
typedef typename K2::Iso_cuboid_3 Iso_cuboid_3;
return Iso_cuboid_3(operator()((a.min)()), operator()((a.max)()), 0);
}
std::pair<typename K2::Point_2, typename K2::Point_2>
operator() (const std::pair<typename K1::Point_2, typename K1::Point_2>& pp) const
{
return std::make_pair(operator()(pp.first), operator()(pp.second));
}
private:
Converter c;
K2 k;
};
// Specialization when converting to the same kernel,
// to avoid making copies.
template < class K, class C >
class Cartesian_converter <K, K, C>
{
public:
typedef K Source_kernel;
typedef K Target_kernel;
typedef C Number_type_converter;
template < typename T >
const T& operator()(const T&t) const { return t; }
};
} //namespace CGAL
#endif // CGAL_CARTESIAN_CONVERTER_H
|