blob: 381b97e1aa28755bd31e4424949e0aa6c0f0f7c2 (
plain)
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
|
// 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_DS_VERTEX_H
#define CGAL_TRIANGULATION_DS_VERTEX_H
#include <CGAL/Compact_container.h>
#include <CGAL/internal/Triangulation/Dummy_TDS.h>
namespace CGAL {
/* The template parameter TDS must be a model of the concept
* 'TriangulationDataStructure' that stores vertices of type
* 'Triangulation_ds_vertex<TDS>'
*/
template< class TDS = void >
class Triangulation_ds_vertex
{
typedef Triangulation_ds_vertex<TDS> Self;
public:
typedef TDS Triangulation_data_structure;
typedef typename TDS::Full_cell_handle Full_cell_handle; /* Concept */
template <typename TDS2>
struct Rebind_TDS /* Concept */
{
typedef Triangulation_ds_vertex<TDS2> Other;
};
protected: // DATA MEMBERS
Full_cell_handle full_cell_; // A handle to an incident full_cell
public:
// Constructs a vertex with incident full_cell 's'
Triangulation_ds_vertex(Full_cell_handle s) : full_cell_(s) /* Concept */
{
CGAL_assertion( Full_cell_handle() != s );
}
// Constructs a vertex with no incident full_cell
Triangulation_ds_vertex() : full_cell_() {} /* Concept */
~Triangulation_ds_vertex() {}
/// Set 's' as an incident full_cell
void set_full_cell(Full_cell_handle s) /* Concept */
{
full_cell_ = s;
}
/// Returns a full_cell incident to the vertex
Full_cell_handle full_cell() const /* Concept */
{
return full_cell_;
}
bool is_valid(bool verbose = false, int /* level */ = 0) const /* Concept */
{
if( Full_cell_handle() == full_cell() )
{
if( verbose )
CGAL_warning_msg(false, "vertex has no incident full cell.");
return false;
}
bool found(false);
// These two typename below are OK because TDS fullfils the
// TriangulationDataStructure concept.
typename TDS::Full_cell::Vertex_handle_iterator vit(full_cell()->vertices_begin());
typedef typename TDS::Vertex_handle Vertex_handle;
while( vit != full_cell()->vertices_end() )
{
if( Vertex_handle() == *vit )
break; // The full cell has no more vertices
if( this == &(**vit) )
{
found = true;
break;
}
++vit;
}
if( ! found )
{
if( verbose )
CGAL_warning_msg(false, "vertex's adjacent full cell does not contain that vertex.");
return false;
}
return true;
}
public: // FOR MEMORY MANAGEMENT
void* for_compact_container() const { return full_cell_.for_compact_container(); }
void* & for_compact_container() { return full_cell_.for_compact_container(); }
}; // end of Triangulation_ds_vertex
// FUNCTIONS THAT ARE NOT MEMBER FUNCTIONS:
template < class TDS >
std::istream &
operator>>(std::istream & is, Triangulation_ds_vertex<TDS> &) /* Concept */
{
/*if( is_ascii(is) )
{}
else {}*/
return is;
}
template< class TDS >
std::ostream &
operator<<(std::ostream & os, const Triangulation_ds_vertex<TDS> &) /* Concept */
{
/*if( is_ascii(os) )
{
os << '\n';
}
else {}*/
return os;
}
// Special case: specialization when template parameter is void.
template<>
class Triangulation_ds_vertex<void>
{
public:
typedef internal::Triangulation::Dummy_TDS Triangulation_data_structure;
typedef Triangulation_data_structure::Full_cell_handle Full_cell_handle; /* Concept */
template <typename TDS2>
struct Rebind_TDS /* Concept */
{
typedef Triangulation_ds_vertex<TDS2> Other;
};
};
} //namespace CGAL
#endif // CGAL_TRIANGULATION_DS_VERTEX_H
|
