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
|
// Copyright (c) 2000
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Cartesian_kernel/include/CGAL/Cartesian/Data_accessor_2.h $
// $Id: Data_accessor_2.h 67093 2012-01-13 11:22:39Z lrineau $
//
//
// Author(s) : Herve Bronnimann
#ifndef CGAL_CARTESIAN_DATA_ACCESSOR_2_H
#define CGAL_CARTESIAN_DATA_ACCESSOR_2_H
namespace CGAL {
// 2D Cartesian point data accessor
template < class R_ >
class Data_accessorC2
{
public:
// Min_ellipse_2 wants FT public...
typedef typename R_::FT FT;
typedef typename R_::Point_2 Point;
typedef R_ R;
FT get_x( const Point &p) const { return( p.x()); }
FT get_y( const Point &p) const { return( p.y()); }
void get( const Point &p, FT &x, FT &y) const { x=get_x(p); y=get_y(p); }
void set( Point& p, const FT &x, const FT &y) const { p=Point(x,y); }
};
} //namespace CGAL
#endif // CGAL_CARTESIAN_DATA_ACCESSOR_2_H
|
