mirror of https://github.com/CGAL/cgal
96 lines
2.8 KiB
C++
96 lines
2.8 KiB
C++
// Copyright (c) 1997 INRIA Sophia-Antipolis (France).
|
|
// All rights reserved.
|
|
//
|
|
// 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.
|
|
//
|
|
// $Source$
|
|
// $Revision$ $Date$
|
|
// $Name$
|
|
//
|
|
// Author(s) : Mariette Yvinec
|
|
|
|
|
|
#ifndef CGAL_TRIANGULATION_VERTEX_BASE_2_H
|
|
#define CGAL_TRIANGULATION_VERTEX_BASE_2_H
|
|
|
|
#include <CGAL/basic.h>
|
|
#include <CGAL/Triangulation_short_names_2.h>
|
|
#include <CGAL/Triangulation_ds_vertex_base_2.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template < typename GT,
|
|
typename Vb = Triangulation_ds_vertex_base_2<> >
|
|
class Triangulation_vertex_base_2
|
|
: public Vb
|
|
|
|
{
|
|
typedef typename Vb::Triangulation_data_structure Tds;
|
|
public:
|
|
typedef GT Geom_traits;
|
|
typedef typename GT::Point_2 Point;
|
|
typedef Tds Triangulation_data_structure;
|
|
typedef typename Tds::Face_handle Face_handle;
|
|
typedef typename Tds::Vertex_handle Vertex_handle;
|
|
|
|
template < typename TDS2 >
|
|
struct Rebind_TDS {
|
|
typedef typename Vb::template Rebind_TDS<TDS2>::Other Vb2;
|
|
typedef Triangulation_vertex_base_2<GT, Vb2> Other;
|
|
};
|
|
|
|
private:
|
|
Point _p;
|
|
|
|
public:
|
|
Triangulation_vertex_base_2 () : Vb() {}
|
|
Triangulation_vertex_base_2(const Point & p) : Vb(), _p(p) {}
|
|
Triangulation_vertex_base_2(const Point & p, Face_handle f)
|
|
: Vb(f), _p(p) {}
|
|
Triangulation_vertex_base_2(Face_handle f) : Vb(f) {}
|
|
|
|
void set_point(const Point & p) { _p = p; }
|
|
const Point& point() const { return _p; }
|
|
|
|
// the non const version of point() is undocument
|
|
// but needed to make the point iterator works
|
|
// using Lutz projection scheme
|
|
Point& point() { return _p; }
|
|
|
|
//the following trivial is_valid to allow
|
|
// the user of derived face base classes
|
|
// to add their own purpose checking
|
|
bool is_valid(bool /* verbose */ = false, int /* level */ = 0) const
|
|
{return true;}
|
|
};
|
|
|
|
template < class GT, class Vb >
|
|
std::istream&
|
|
operator>>(std::istream &is, Triangulation_vertex_base_2<GT, Vb> &v)
|
|
// non combinatorial information. Default = point
|
|
{
|
|
return is >> static_cast<Vb&>(v) >> v.point();
|
|
}
|
|
|
|
template < class GT, class Vb >
|
|
std::ostream&
|
|
operator<<(std::ostream &os, const Triangulation_vertex_base_2<GT, Vb> &v)
|
|
// non combinatorial information. Default = point
|
|
{
|
|
return os << static_cast<const Vb&>(v) << v.point();
|
|
}
|
|
|
|
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif //CGAL_TRIANGULATION_VERTEX_BASE_2_H
|