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
|
// Copyright (c) 2006 Foundation for Research and Technology-Hellas (Greece).
// 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
// 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/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_storage_traits_2.h $
// $Id: Segment_Delaunay_graph_storage_traits_2.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Menelaos Karavelas <mkaravel@iacm.forth.gr>
#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_STORAGE_TRAITS_2_H
#define CGAL_SEGMENT_DELAUNAY_GRAPH_STORAGE_TRAITS_2_H 1
#include <CGAL/Segment_Delaunay_graph_2/basic.h>
#include <set>
#include <CGAL/Segment_Delaunay_graph_storage_site_2.h>
#include <CGAL/Segment_Delaunay_graph_simple_storage_site_2.h>
#include <CGAL/Segment_Delaunay_graph_2/Construct_storage_site_2.h>
namespace CGAL {
//----------------------------------------------------------------------
//----------------------------------------------------------------------
namespace SegmentDelaunayGraph_2 {
namespace Internal {
template<class Gt, class USE_SIMPLE_STORAGE_SITE_Tag>
struct Which_storage_site;
// use the simple storage site
template<class Gt>
struct Which_storage_site<Gt,Tag_false>
{
typedef Gt Geom_traits;
typedef Tag_false Storage_site_tag;
typedef Segment_Delaunay_graph_simple_storage_site_2<Geom_traits>
Storage_site_2;
};
// use the full storage site
template<class Gt>
struct Which_storage_site<Gt,Tag_true>
{
typedef Gt Geom_traits;
typedef Tag_true Storage_site_tag;
typedef Segment_Delaunay_graph_storage_site_2<Geom_traits>
Storage_site_2;
};
} // namespace Internal
} //namespace SegmentDelaunayGraph_2
//----------------------------------------------------------------------
template<class Gt>
class Segment_Delaunay_graph_storage_traits_2
{
public:
typedef Gt Geom_traits;
typedef typename Geom_traits::Point_2 Point_2;
typedef typename Geom_traits::Site_2 Site_2;
typedef std::set<Point_2> Point_container;
typedef typename Point_container::iterator Point_handle;
typedef typename Point_container::const_iterator const_Point_handle;
private:
typedef Segment_Delaunay_graph_storage_traits_2<Geom_traits> Self;
typedef typename Geom_traits::Intersections_tag ITag;
public:
typedef typename
CGAL_SEGMENT_DELAUNAY_GRAPH_2_NS::Internal::
Which_storage_site<Self,ITag>::Storage_site_2
Storage_site_2;
typedef
CGAL_SEGMENT_DELAUNAY_GRAPH_2_NS::Construct_storage_site_2<Self>
Construct_storage_site_2;
// MK::FIGURE OUT HOW TO PASS A REFERENCE TO GEOM_TRAITS AND HAVE
// DEFAULT CONSTRUCTOR AS WELL IF POSSIBLE
Segment_Delaunay_graph_storage_traits_2
(const Geom_traits& gt = Geom_traits()) : gt_(gt) {}
inline const Geom_traits& geom_traits() const { return gt_; }
inline Construct_storage_site_2
construct_storage_site_2_object() const {
return Construct_storage_site_2();
}
private:
Geom_traits gt_;
};
//----------------------------------------------------------------------
//----------------------------------------------------------------------
} //namespace CGAL
#endif // CGAL_SEGMENT_DELAUNAY_GRAPH_STORAGE_TRAITS_2_H
|
