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

constification

This commit is contained in:
Sylvain Pion 2007-03-08 10:24:17 +00:00
parent d82965e1eb
commit ad259f383c
5 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/test.h
View File

@ -7,7 +7,7 @@
CGAL_BEGIN_NAMESPACE CGAL_BEGIN_NAMESPACE
template<class InputStream> template<class InputStream>
bool test_x(InputStream& is, char* ifname, bool test_remove = true) bool test_x(InputStream& is, const char* ifname, bool test_remove = true)
{ {
SDG2 sdg; SDG2 sdg;
return test_base(is, sdg, ifname, "sdg.tmp", test_remove); return test_base(is, sdg, ifname, "sdg.tmp", test_remove);
@ -15,7 +15,7 @@ bool test_x(InputStream& is, char* ifname, bool test_remove = true)
template<class InputStream> template<class InputStream>
bool test_no_x(InputStream& is, char* ifname, bool test_remove = true) bool test_no_x(InputStream& is, const char* ifname, bool test_remove = true)
{ {
SDG2_wi sdg; SDG2_wi sdg;
return test_base(is, sdg, ifname, "sdg_wi.tmp", test_remove); return test_base(is, sdg, ifname, "sdg_wi.tmp", test_remove);
@ -24,7 +24,7 @@ bool test_no_x(InputStream& is, char* ifname, bool test_remove = true)
//===================================================================== //=====================================================================
template<class InputStream> template<class InputStream>
bool test_hierarchy_x(InputStream& is, char* ifname, bool test_remove = true) bool test_hierarchy_x(InputStream& is, const char* ifname, bool test_remove = true)
{ {
SDG2 sdg; SDG2 sdg;
return test_base(is, sdg, ifname, "sdgh.tmp", test_remove); return test_base(is, sdg, ifname, "sdgh.tmp", test_remove);
@ -32,7 +32,7 @@ bool test_hierarchy_x(InputStream& is, char* ifname, bool test_remove = true)
template<class InputStream> template<class InputStream>
bool test_hierarchy_no_x(InputStream& is, char* ifname, bool test_remove = true) bool test_hierarchy_no_x(InputStream& is, const char* ifname, bool test_remove = true)
{ {
SDG2_wi sdg; SDG2_wi sdg;
return test_base(is, sdg, ifname, "sdgh_wi.tmp", test_remove); return test_base(is, sdg, ifname, "sdgh_wi.tmp", test_remove);
@ -43,7 +43,7 @@ bool test_hierarchy_no_x(InputStream& is, char* ifname, bool test_remove = true)
template<class SDG, class InputStream> template<class SDG, class InputStream>
bool test_base(InputStream& is, const SDG& sdg, char* ifname, char* ofname, bool test_base(InputStream& is, const SDG& sdg, const char* ifname, const char* ofname,
bool test_remove) bool test_remove)
{ {
print_separator(); print_separator();

2
Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/test_info.h
View File

@ -8,7 +8,7 @@
CGAL_BEGIN_NAMESPACE CGAL_BEGIN_NAMESPACE
template<class SDG> template<class SDG>
bool test_info(SDG& sdg, char* fname) bool test_info(SDG& sdg, const char* fname)
{ {
CGAL::Random r(static_cast<int>(0)); CGAL::Random r(static_cast<int>(0));

2
Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/test_info_hierarchy.h
View File

@ -9,7 +9,7 @@
CGAL_BEGIN_NAMESPACE CGAL_BEGIN_NAMESPACE
template<class SDG> template<class SDG>
bool test_info_hierarchy(SDG& sdg, char* fname) bool test_info_hierarchy(SDG& sdg, const char* fname)
{ {
typedef typename SDG::Finite_vertices_iterator FVIT; typedef typename SDG::Finite_vertices_iterator FVIT;

6
Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/include/test_types.h
View File

@ -14,7 +14,7 @@
//======================================================================== //========================================================================
template<class NT> template<class NT>
char* get_fname(const NT&, char* ifname) { char* get_fname(const NT&, const char* ifname) {
char* fname = new char[50]; char* fname = new char[50];
strcpy(fname, "data/"); strcpy(fname, "data/");
strcat(fname, ifname); strcat(fname, ifname);
@ -26,7 +26,7 @@ char* get_fname(const NT&, char* ifname) {
#include <CGAL/Gmpq.h> #include <CGAL/Gmpq.h>
template<> template<>
char* get_fname(const CGAL::Gmpq&, char* ifname) { char* get_fname(const CGAL::Gmpq&, const char* ifname) {
char* fname = new char[50]; char* fname = new char[50];
strcpy(fname, "data/"); strcpy(fname, "data/");
strcat(fname, ifname); strcat(fname, ifname);
@ -73,7 +73,7 @@ struct Level_finder< Segment_Delaunay_graph_2<Gt,SDGDS,LTag> >
//======================================================================== //========================================================================
template<class SDG, class InputStream> template<class SDG, class InputStream>
bool test_sdg(InputStream& is, const SDG&, char* ifname, char* ofname, bool test_sdg(InputStream& is, const SDG&, const char* ifname, const char* ofname,
bool test_remove) bool test_remove)
{ {
char* ifname_full = get_fname(typename SDG2::Geom_traits::FT(), ifname); char* ifname_full = get_fname(typename SDG2::Geom_traits::FT(), ifname);

2
Segment_Delaunay_graph_2/test/Segment_Delaunay_graph_2/test_sdg_traits_2.cpp
View File

@ -193,7 +193,7 @@ struct Get_sites
}; };
template<class Gt> template<class Gt>
bool test_traits(char* title) bool test_traits(const char* title)
{ {
typedef typename Gt::Site_2 Site_2; typedef typename Gt::Site_2 Site_2;
typedef typename Gt::Vertex_conflict_2 Vertex_conflict_2; typedef typename Gt::Vertex_conflict_2 Vertex_conflict_2;