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
|
// Copyright (c) 1997-2001
// 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)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Optimisation_basic/include/CGAL/Optimisation/Access_coordinates_begin_d.h $
// $Id: include/CGAL/Optimisation/Access_coordinates_begin_d.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Sven Schoenherr <sven@inf.ethz.ch>
#ifndef CGAL_OPTIMISATION_ACCESS_COORDINATES_BEGIN_D_H
#define CGAL_OPTIMISATION_ACCESS_COORDINATES_BEGIN_D_H
namespace CGAL {
class Cartesian_tag;
class Homogeneous_tag;
// Class declaration
// =================
template < class R_ >
class Access_coordinates_begin_d;
// Class interface
// ===============
template < class R_ >
class Access_coordinates_begin_d {
public:
// self
typedef R_ R;
typedef Access_coordinates_begin_d<R>
Self;
// types
typedef typename R::Point_d Point;
typedef typename Point::Homogeneous_const_iterator Coordinate_iterator;
// unary function class types
typedef Coordinate_iterator result_type;
typedef Point argument_type;
// creation
Access_coordinates_begin_d( ) { }
// operations
private:
Coordinate_iterator
access( const Point& p, const Cartesian_tag&) const
{ return p.cartesian_begin(); }
Coordinate_iterator
access( const Point& p, const Homogeneous_tag&) const
{ return p.homogeneous_begin(); }
public:
Coordinate_iterator
operator() ( const Point& p) const {
return p.homogeneous_begin();
}
};
} //namespace CGAL
#endif // CGAL_OPTIMISATION_ACCESS_COORDINATES_BEGIN_D_H
// ===== EOF ==================================================================
|
