/usr/include/CGAL/function_objects.h is in libcgal-dev 4.2-5ubuntu1.
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 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 | // Copyright (c) 2003,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) : Michael Hoffmann <hoffmann@inf.ethz.ch>
// Lutz Kettner <kettner@mpi-sb.mpg.de>
// Sylvain Pion
#ifndef CGAL_FUNCTION_OBJECTS_H
#define CGAL_FUNCTION_OBJECTS_H 1
#include <functional>
#include <CGAL/enum.h>
namespace CGAL {
template < class Value>
struct Identity {
typedef Value argument_type;
typedef Value result_type;
Value& operator()( Value& x) const { return x; }
const Value& operator()( const Value& x) const { return x; }
};
template < class Value>
struct Dereference {
typedef Value* argument_type;
typedef Value result_type;
Value& operator()( Value* x) const { return *x;}
const Value& operator()( const Value* x) const { return *x;}
};
template < class Value>
struct Get_address {
typedef Value argument_type;
typedef Value* result_type;
Value* operator()( Value& x) const { return &x;}
const Value* operator()( const Value& x) const { return &x;}
};
template < class Arg, class Result>
struct Cast_function_object {
typedef Arg argument_type;
typedef Result result_type;
Result& operator()( Arg& x) const { return (Result&)(x); }
const Result& operator()( const Arg& x) const {
return (const Result&)(x);
}
};
template < class Node>
struct Project_vertex {
typedef Node argument_type;
typedef typename Node::Vertex Vertex;
typedef Vertex result_type;
Vertex& operator()( Node& x) const { return x.vertex(); }
const Vertex& operator()( const Node& x) const { return x.vertex(); }
};
template < class Node>
struct Project_facet {
typedef Node argument_type;
typedef typename Node::Facet Facet;
typedef Facet result_type;
Facet& operator()( Node& x) const { return x.facet(); }
const Facet& operator()( const Node& x) const { return x.facet(); }
};
template < class Node>
struct Project_point {
typedef Node argument_type;
typedef typename Node::Point Point;
typedef Point result_type;
Point& operator()( Node& x) const { return x.point(); }
const Point& operator()( const Node& x) const { return x.point(); }
};
template < class Node>
struct Project_normal {
typedef Node argument_type;
typedef typename Node::Normal Normal;
typedef Normal result_type;
Normal& operator()( Node& x) const { return x.normal(); }
const Normal& operator()( const Node& x) const { return x.normal(); }
};
template < class Node>
struct Project_plane {
typedef Node argument_type;
typedef typename Node::Plane Plane;
typedef Plane result_type;
Plane& operator()( Node& x) const { return x.plane(); }
const Plane& operator()( const Node& x) const { return x.plane(); }
};
// The following four adaptors are used to create the circulators
// for polyhedral surfaces.
template < class Node>
struct Project_next {
typedef Node* argument_type;
typedef Node* result_type;
Node* operator()( Node* x) const { return x->next(); }
const Node* operator()( const Node* x) const { return x->next(); }
};
template < class Node>
struct Project_prev {
typedef Node* argument_type;
typedef Node* result_type;
Node* operator()( Node* x) const { return x->prev(); }
const Node* operator()( const Node* x) const { return x->prev(); }
};
template < class Node>
struct Project_next_opposite {
typedef Node* argument_type;
typedef Node* result_type;
Node* operator()( Node* x) const {
return x->next()->opposite();
}
const Node* operator()( const Node* x) const {
return x->next()->opposite();
}
};
template < class Node>
struct Project_opposite_prev {
typedef Node* argument_type;
typedef Node* result_type;
Node* operator()( Node* x) const {
return x->opposite()->prev();
}
const Node* operator()( const Node* x) const {
return x->opposite()->prev();
}
};
template < class Arg, class Result >
class Creator_1 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Result result_type;
Result operator()(Arg a) const { return Result(a);}
};
template < class Arg1, class Arg2, class Result >
class Creator_2 {
public:
typedef Arg1 argument1_type;
typedef Arg2 argument2_type;
typedef Result result_type;
Result operator()(Arg1 a1, Arg2 a2) const { return Result(a1,a2);}
};
template < class Arg1, class Arg2, class Arg3, class Result >
class Creator_3 {
public:
typedef Arg1 argument1_type;
typedef Arg2 argument2_type;
typedef Arg3 argument3_type;
typedef Result result_type;
Result operator()(Arg1 a1, Arg2 a2, Arg3 a3) const {
return Result(a1,a2,a3);
}
};
template < class Arg1, class Arg2, class Arg3, class Arg4, class Result >
class Creator_4 {
public:
typedef Arg1 argument1_type;
typedef Arg2 argument2_type;
typedef Arg3 argument3_type;
typedef Arg4 argument4_type;
typedef Result result_type;
Result operator()(Arg1 a1, Arg2 a2, Arg3 a3, Arg4 a4) const {
return Result(a1,a2,a3,a4);
}
};
template < class Arg1, class Arg2, class Arg3, class Arg4, class Arg5,
class Result >
class Creator_5 {
public:
typedef Arg1 argument1_type;
typedef Arg2 argument2_type;
typedef Arg3 argument3_type;
typedef Arg4 argument4_type;
typedef Arg5 argument5_type;
typedef Result result_type;
Result operator()(Arg1 a1, Arg2 a2, Arg3 a3, Arg4 a4, Arg5 a5) const {
return Result(a1,a2,a3,a4,a5);
}
};
template < class Arg, class Result >
class Creator_uniform_2 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2) const { return Result(a1,a2);}
};
template < class Arg, class Result >
class Creator_uniform_3 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3) const {
return Result(a1,a2,a3);
}
};
template < class Arg, class Result >
class Creator_uniform_4 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4) const {
return Result(a1,a2,a3,a4);
}
};
template < class Arg, class Result >
class Creator_uniform_5 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Arg argument5_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4, Arg a5) const {
return Result(a1,a2,a3,a4,a5);
}
};
template < class Arg, class Result >
class Creator_uniform_6 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Arg argument5_type;
typedef Arg argument6_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4, Arg a5, Arg a6
) const {
return Result(a1,a2,a3,a4,a5,a6);
}
};
template < class Arg, class Result >
class Creator_uniform_7 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Arg argument5_type;
typedef Arg argument6_type;
typedef Arg argument7_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4, Arg a5, Arg a6,
Arg a7) const {
return Result(a1,a2,a3,a4,a5,a6,a7);
}
};
template < class Arg, class Result >
class Creator_uniform_8 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Arg argument5_type;
typedef Arg argument6_type;
typedef Arg argument7_type;
typedef Arg argument8_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4, Arg a5, Arg a6,
Arg a7, Arg a8) const {
return Result(a1,a2,a3,a4,a5,a6,a7,a8);
}
};
template < class Arg, class Result >
class Creator_uniform_9 {
public:
typedef Arg argument_type;
typedef Arg argument1_type;
typedef Arg argument2_type;
typedef Arg argument3_type;
typedef Arg argument4_type;
typedef Arg argument5_type;
typedef Arg argument6_type;
typedef Arg argument7_type;
typedef Arg argument8_type;
typedef Arg argument9_type;
typedef Result result_type;
Result operator()(Arg a1, Arg a2, Arg a3, Arg a4, Arg a5, Arg a6,
Arg a7, Arg a8, Arg a9) const {
return Result(a1,a2,a3,a4,a5,a6,a7,a8,a9);
}
};
template < class Arg, class Result >
class Creator_uniform_d {
int d;
private:
Creator_uniform_d(){}
public:
typedef Arg argument1_type;
typedef Result result_type;
Creator_uniform_d(int dim)
: d(dim)
{}
Result operator()(Arg a1, Arg a2) const { return Result(d, a1,a2);}
};
template < class Op1, class Op2 >
class Unary_compose_1
: public std::unary_function< typename Op2::argument_type,
typename Op1::result_type >
{
protected:
Op1 op1;
Op2 op2;
public:
typedef typename Op2::argument_type argument_type;
typedef typename Op1::result_type result_type;
Unary_compose_1(const Op1& x, const Op2& y) : op1(x), op2(y) {}
result_type
operator()(const argument_type& x) const
{ return op1(op2(x)); }
};
template < class Op1, class Op2 >
inline Unary_compose_1< Op1, Op2 >
compose1_1(const Op1& op1, const Op2& op2)
{ return Unary_compose_1< Op1, Op2 >(op1, op2); }
template < class Op1, class Op2, class Op3 >
class Binary_compose_1
: public std::unary_function< typename Op2::argument_type,
typename Op1::result_type >
{
protected:
Op1 op1;
Op2 op2;
Op3 op3;
public:
typedef typename Op2::argument_type argument_type;
typedef typename Op1::result_type result_type;
Binary_compose_1(const Op1& x, const Op2& y, const Op3& z)
: op1(x), op2(y), op3(z) {}
result_type
operator()(const argument_type& x) const
{ return op1(op2(x), op3(x)); }
};
template < class Op1, class Op2, class Op3 >
inline Binary_compose_1< Op1, Op2, Op3 >
compose2_1(const Op1& op1, const Op2& op2, const Op3& op3)
{ return Binary_compose_1< Op1, Op2, Op3 >(op1, op2, op3); }
template < class Op1, class Op2 >
class Unary_compose_2
: public std::binary_function< typename Op2::first_argument_type,
typename Op2::second_argument_type,
typename Op1::result_type >
{
protected:
Op1 op1;
Op2 op2;
public:
typedef typename Op2::first_argument_type first_argument_type;
typedef typename Op2::second_argument_type second_argument_type;
typedef typename Op1::result_type result_type;
Unary_compose_2(const Op1& x, const Op2& y) : op1(x), op2(y) {}
result_type
operator()(const first_argument_type& x,
const second_argument_type& y) const
{ return op1(op2(x, y)); }
};
template < class Op1, class Op2 >
inline Unary_compose_2< Op1, Op2 >
compose1_2(const Op1& op1, const Op2& op2)
{ return Unary_compose_2< Op1, Op2 >(op1, op2); }
template < class Op1, class Op2, class Op3 >
class Binary_compose_2
: public std::binary_function< typename Op2::argument_type,
typename Op3::argument_type,
typename Op1::result_type >
{
protected:
Op1 op1;
Op2 op2;
Op3 op3;
public:
typedef typename Op2::argument_type first_argument_type;
typedef typename Op3::argument_type second_argument_type;
typedef typename Op1::result_type result_type;
Binary_compose_2(const Op1& x, const Op2& y, const Op3& z)
: op1(x), op2(y), op3(z) {}
result_type
operator()(const first_argument_type& x,
const second_argument_type& y) const
{ return op1(op2(x), op3(y)); }
};
template < class Op1, class Op2, class Op3 >
inline Binary_compose_2< Op1, Op2, Op3 >
compose2_2(const Op1& op1, const Op2& op2, const Op3& op3)
{ return Binary_compose_2< Op1, Op2, Op3 >(op1, op2, op3); }
template < class Op >
class Compare_to_less
: public Op
{
public:
typedef Op Type;
typedef bool result_type;
Compare_to_less(const Op& op) : Op(op) {}
template < typename A1 >
bool
operator()(const A1 &a1) const
{ return Op::operator()(a1) == SMALLER; }
template < typename A1, typename A2 >
bool
operator()(const A1 &a1, const A2 &a2) const
{ return Op::operator()(a1, a2) == SMALLER; }
template < typename A1, typename A2, typename A3 >
bool
operator()(const A1 &a1, const A2 &a2, const A3 &a3) const
{ return Op::operator()(a1, a2, a3) == SMALLER; }
template < typename A1, typename A2, typename A3, typename A4 >
bool
operator()(const A1 &a1, const A2 &a2, const A3 &a3, const A4 &a4) const
{ return Op::operator()(a1, a2, a3, a4) == SMALLER; }
// More can be added.
};
template < class Op >
inline Compare_to_less<Op>
compare_to_less(const Op& op)
{ return Compare_to_less<Op>(op); }
/*!\brief
* Functor class to determine lexicographical order of pairs
*/
template < class T1, class T2,
class Less1 = std::less<T1>, class Less2 = std::less<T2> >
struct Pair_lexicographical_less_than {
typedef bool result_type;
typedef std::pair<T1,T2> first_argument_type;
typedef std::pair<T1,T2> second_argument_type;
/*!\brief
* returns \c true iff \c x is lexicograhically smaller than \c y
* using \c Less1 and \c Less2 functors.
*/
bool operator () (const std::pair<T1,T2>& x, const std::pair<T1,T2>& y) const {
Less1 lt1;
Less2 lt2;
if (lt1(x.first, y.first)) {
return true;
} else if (lt1(y.first, x.first)) {
return false;
} else /* neither is less than the other */ {
return lt2(x.second, y.second);
}
}
};
} //namespace CGAL
#endif // CGAL_FUNCTION_OBJECTS_H
|