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
|
// Copyright (c) 2009-2014 INRIA Sophia-Antipolis (France).
// 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$
// $Id$
//
// Author(s) : Samuel Hornus
#ifndef CGAL_TRIANGULATION_SIMPLEX_H
#define CGAL_TRIANGULATION_SIMPLEX_H
#include <CGAL/Triangulation_ds_full_cell.h>
#include <CGAL/internal/Triangulation/utilities.h>
#include <CGAL/Iterator_project.h>
#include <CGAL/Default.h>
namespace CGAL {
struct No_full_cell_data {};
template< class TriangulationTraits, typename Data_ = No_full_cell_data, class TDSFullCell = Default >
class Triangulation_full_cell : public Default::Get<TDSFullCell, Triangulation_ds_full_cell<> >::type
{
// The default type for TDSFullCell is Triangulation_ds_full_cell<> :
typedef typename Default::Get<TDSFullCell, Triangulation_ds_full_cell<> >::type
Base;
typedef Triangulation_full_cell<TriangulationTraits, Data_, TDSFullCell> Self;
public:
typedef Data_ Data;
typedef typename Base::Vertex_handle Vertex_handle;
typedef typename Base::Vertex_const_handle Vertex_const_handle;
typedef typename Base::Vertex_handle_const_iterator Vertex_handle_const_iterator;
typedef typename Base::Full_cell_const_handle Full_cell_const_handle;
typedef typename TriangulationTraits::Point_d Point;
typedef typename TriangulationTraits::Point_d Point_d;
private: // DATA MEMBERS
Data data_;
public:
using Base::vertices_begin;
using Base::vertices_end;
template< class TDS2 >
struct Rebind_TDS
{
typedef typename Base::template Rebind_TDS<TDS2>::Other TDSFullCell2;
typedef Triangulation_full_cell<TriangulationTraits, Data_, TDSFullCell2> Other;
};
Triangulation_full_cell(const int d)
: Base(d), data_() {}
Triangulation_full_cell(const Self & s)
: Base(s), data_(s.data_) {}
const Data & data() const
{
return data_;
}
Data & data()
{
return data_;
}
struct Point_from_vertex_handle
{
typedef Vertex_handle argument_type;
typedef Point result_type;
result_type & operator()(argument_type & x) const
{
return x->point();
}
const result_type & operator()(const argument_type & x) const
{
return x->point();
}
};
protected:
typedef CGAL::Iterator_project<
Vertex_handle_const_iterator,
internal::Triangulation::Point_from_vertex_handle<Vertex_handle, Point>
> Point_const_iterator;
Point_const_iterator points_begin() const
{ return Point_const_iterator(Base::vertices_begin()); }
Point_const_iterator points_end() const
{ return Point_const_iterator(Base::vertices_end()); }
};
// FUNCTIONS THAT ARE NOT MEMBER FUNCTIONS:
inline
std::istream &
operator>>(std::istream & is, No_full_cell_data &)
{
return is;
}
inline
std::ostream &
operator<<(std::ostream & os, const No_full_cell_data &)
{
return os;
}
template < typename TDS, typename Data, typename SSP >
std::ostream &
operator<<(std::ostream & O, const Triangulation_full_cell<TDS, Data, SSP> & s)
{
/*if( is_ascii(O) )
{
// os << '\n';
}
else {}*/
O << s.data();
return O;
}
template < typename TDS, typename Data, typename SSP >
std::istream &
operator>>(std::istream & I, Triangulation_full_cell<TDS, Data, SSP> & s)
{
/*if( is_ascii(I) )
{}
else {}*/
I >> s.data();
return I;
}
} //namespace CGAL
#endif // CGAL_TRIANGULATION_SIMPLEX_H
|
