cgal/Triangulation/include/CGAL/Triangulation_ds_vertex.h

131 lines
3.4 KiB
C++

// Copyright (c) 2009 INRIA Sophia-Antipolis (France),
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// 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 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 */
{
CGAL_precondition( Full_cell_handle() != s );
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 = true, 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;
}
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> & v) /* Concept */
{
/*if( is_ascii(is) )
{}
else {}*/
return is;
}
template< class TDS >
std::ostream &
operator<<(std::ostream & os, const Triangulation_ds_vertex<TDS> & v) /* Concept */
{
/*if( is_ascii(os) )
{
os << '\n';
}
else {}*/
return os;
}
// Special case: specialization when template parameter is void.
template<>
class Triangulation_ds_vertex<void>
{
typedef internal::Triangulation::Dummy_TDS Triangulation_ds;
public:
typedef Triangulation_ds::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