2 // { dg-additional-options "-Wno-return-type" }
5 template < class DSC, bool Const > struct CC_iterator {
6 typedef CC_iterator iterator;
7 typedef typename DSC::value_type value_type;
8 typedef const value_type* pointer;
10 CC_iterator (const iterator &it) {
13 pointer operator->() const ;
16 template < class T > struct Compact_container {
17 typedef Compact_container <T> Self;
19 typedef internal::CC_iterator<Self, false> iterator;
21 template < typename TDS = void > struct Periodic_3_triangulation_ds_cell_base_3 {
22 typedef typename TDS::Vertex_handle Vertex_handle;
23 const Vertex_handle& vertex(int i) const {
26 struct Triangulation_data_structure_3 {
27 typedef Triangulation_data_structure_3 Tds;
28 typedef Periodic_3_triangulation_ds_cell_base_3<Tds> Cell;
29 typedef Compact_container<Cell> Cell_range;
30 typedef Compact_container<int> Vertex_range;
31 typedef typename Cell_range::iterator Cell_handle;
32 typedef typename Vertex_range::iterator Vertex_handle;
34 typedef Triangulation_data_structure_3 TDS1;
35 template < class > struct Periodic_3_Delaunay_triangulation_3 {
36 typedef TDS1::Vertex_handle Vertex_handle;
37 typedef TDS1::Cell_handle Cell_handle;
38 int compare_distance() const {
40 Vertex_handle nearest_vertex() const;
42 template < class Tds > typename Periodic_3_Delaunay_triangulation_3<Tds>::Vertex_handle Periodic_3_Delaunay_triangulation_3<Tds>::nearest_vertex() const {
44 Vertex_handle nearest = c->vertex(0);
45 nearest = (compare_distance() == -1) ? nearest : c->vertex(0);
48 typedef Periodic_3_Delaunay_triangulation_3<TDS1> PDT1;
49 struct Periodic_3_triangulation_hierarchy_3 : PDT1 {
50 Vertex_handle nearest_vertex() const;
52 Periodic_3_triangulation_hierarchy_3::Vertex_handle Periodic_3_triangulation_hierarchy_3:: nearest_vertex() const {
53 return PDT1::nearest_vertex();