songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix gcc warnings (unused typedefs)

This commit is contained in:
Clement Jamin 2014-11-20 13:06:59 +01:00
parent 01c39fc414
commit d6a3e6aebc
6 changed files with 1 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Triangulation/examples/Triangulation/barycentric_subdivision.cpp
View File

@ -15,7 +15,6 @@ template< typename TDS >
void barycentric_subdivide(TDS & tds, typename TDS::Full_cell_handle fc)
{ /* This function builds the barycentric subdivision of a single
full cell |fc| from a triangulation data structure |tds|. */
typedef typename TDS::Full_cell_handle Full_cell_handle;
typedef typename TDS::Vertex_handle Vertex_handle;
typedef typename TDS::Face Face;
const int dim = tds.current_dimension();
@ -56,7 +55,6 @@ void find_face_from_vertices( const TDS & tds,
{ /* The main goal of this function is to find a full cell that
contains a given set of vertices |face_vertices|. Then, it
builds a corresponding |face|. */
typedef typename TDS::Face Face;
typedef typename TDS::Vertex_handle Vertex_handle;
typedef typename TDS::Full_cell_handle Full_cell_handle;
typedef typename TDS::Full_cell::Vertex_handle_iterator Vertex_h_iterator;

1
Triangulation/include/CGAL/Delaunay_triangulation.h
View File

@ -777,7 +777,6 @@ Delaunay_triangulation<DCTraits, TDS>
::insert_in_conflicting_cell(const Point & p, const Full_cell_handle s)
{
typedef std::vector<Full_cell_handle> Full_cell_h_vector;
typedef typename Full_cell_h_vector::iterator SHV_iterator;
static Full_cell_h_vector cs; // for storing conflicting full_cells.
cs.clear();
// cs.reserve(64);

5
Triangulation/include/CGAL/Triangulation.h
View File

@ -1228,9 +1228,6 @@ operator>>(std::istream & is, Triangulation<TT, TDS> & tr)
{
typedef Triangulation<TT, TDS> T;
typedef typename T::Vertex_handle Vertex_handle;
typedef typename T::Vertex_iterator Vertex_iterator;
typedef typename T::Full_cell_handle Full_cell_handle;
typedef typename T::Full_cell_iterator Full_cell_iterator;
// read current dimension and number of vertices
size_t n;
@ -1284,8 +1281,6 @@ operator<<(std::ostream & os, const Triangulation<TT, TDS> & tr)
typedef Triangulation<TT, TDS> T;
typedef typename T::Vertex_const_handle Vertex_handle;
typedef typename T::Vertex_const_iterator Vertex_iterator;
typedef typename T::Full_cell_const_handle Full_cell_handle;
typedef typename T::Full_cell_const_iterator Full_cell_iterator;
// outputs dimensions and number of vertices
size_t n = tr.number_of_vertices();

5
Triangulation/test/Triangulation/test_delaunay.cpp
View File

@ -16,14 +16,9 @@ void test(const int d, const string & type, const int N)
// we must write 'typename' below, because we are in a template-function,
// so the parser has no way to know that DC contains sub-types, before
// instanciating the function.
typedef typename DC::Vertex Vertex;
typedef typename DC::Vertex_handle Vertex_handle;
typedef typename DC::Full_cell Full_cell;
typedef typename DC::Full_cell_handle Full_cell_handle;
typedef typename DC::Facet Facet;
typedef typename DC::Face Face;
typedef typename DC::Point Point;
typedef typename DC::Geom_traits::RT RT;
typedef typename DC::Finite_full_cell_const_iterator Finite_full_cell_const_iterator;
typedef typename DC::Finite_vertex_iterator Finite_vertex_iterator;

6
Triangulation/test/Triangulation/test_torture.cpp
View File

@ -19,14 +19,8 @@ void test(const int D, const int d, const int N, bool no_transform)
// we must write 'typename' below, because we are in a template-function,
// so the parser has no way to know that DC contains sub-types, before
// instanciating the function.
typedef typename DC::Vertex Vertex;
typedef typename DC::Vertex_handle Vertex_handle;
typedef typename DC::Full_cell Full_cell;
typedef typename DC::Full_cell_handle Full_cell_handle;
typedef typename DC::Facet Facet;
typedef typename DC::Point Point;
typedef typename DC::Geom_traits::RT RT;
typedef typename DC::Finite_full_cell_const_iterator Finite_full_cell_const_iterator;
DC dc(D);

4
Triangulation/test/Triangulation/test_triangulation.cpp
View File

@ -14,11 +14,7 @@ void test(const int d, const string & type, int N)
// we must write 'typename' below, because we are in a template-function,
// so the parser has no way to know that T contains sub-types, before
// instanciating the function.
typedef typename T::Vertex Vertex;
typedef typename T::Vertex_handle Vertex_handle;
typedef typename T::Full_cell Full_cell;
typedef typename T::Full_cell_handle Full_cell_handle;
typedef typename T::Facet Facet;
typedef typename T::Point Point;
typedef typename T::Geom_traits::RT RT;
typedef typename T::Finite_full_cell_const_iterator Finite_full_cell_const_iterator;