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

Add using statements for ansi-compliance

This commit is contained in:
Andreas Fabri 2010-05-18 08:12:56 +00:00
parent 9db08e1461
commit 4acea23434
8 changed files with 44 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2.h
View File

@ -359,7 +359,8 @@ public:
using Delaunay_graph::cw;
using Delaunay_graph::ccw;
using Delaunay_graph::delete_vertex;
using Delaunay_graph::delete_face;
public:
// TRAVERSAL OF THE DUAL GRAPH
//----------------------------

5
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Arrangement_type_C2.h
View File

@ -65,6 +65,11 @@ private:
typedef Are_same_points_C2<K> Are_same_points_2;
using Base::compute_supporting_line;
using Base::oriented_side_of_line;
using Base::compute_perpendicular;
using Base::opposite_line;
private:
Are_same_points_2 same_points;

11
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Finite_edge_interior_conflict_C2.h
View File

@ -60,6 +60,17 @@ public:
typedef typename Base::Homogeneous_point_2 Homogeneous_point_2;
using Base::opposite_line;
using Base::compute_supporting_line;
using Base::oriented_side_of_line;
using Base::compare_squared_distances_to_line;
using Base::compare_squared_distances_to_lines;
using Base::compute_perpendicular;
using Base::projection_on_line;
using Base::compute_squared_distance;
private:
typedef Are_same_points_C2<K> Are_same_points_2;
typedef Are_same_segments_C2<K> Are_same_segments_2;

4
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_C2.h
View File

@ -50,6 +50,10 @@ private:
typedef typename Base::FT FT;
typedef typename Base::RT RT;
using Base::compute_supporting_line;
using Base::compute_perpendicular;
public:
typedef typename Base::Oriented_side Oriented_side;
typedef Oriented_side result_type;

5
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Oriented_side_of_bisector_C2.h
View File

@ -60,6 +60,11 @@ public:
typedef typename Base::Point_2 Point_2;
typedef typename Base::Segment_2 Segment_2;
using Base::compute_supporting_line;
using Base::compute_perpendicular;
using Base::opposite_line;
using Base::oriented_side_of_line;
using Base::compute_squared_distance;
private:
bool is_endpoint(const Site_2& p, const Site_2& s) const
{

5
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_ring_C2.h
View File

@ -65,6 +65,11 @@ public:
typedef typename Base::Oriented_side Oriented_side;
typedef typename Base::Sign Sign;
using Base::compute_supporting_line;
using Base::oriented_side_of_line;
using Base::opposite_line;
using Base::to_ft;
private:
typedef Are_same_points_C2<K> Are_same_points_2;
typedef Are_same_segments_C2<K> Are_same_segments_2;

1
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_sqrt_field_new_C2.h
View File

@ -43,6 +43,7 @@ public:
using Base::compute_supporting_line;
using Base::oriented_side_of_line;
using Base::opposite_line;
using Base::compute_projection;
typedef enum {PPP = 0, PPS, PSS, SSS} vertex_t;
struct PPP_Type {};

11
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_hierarchy_2.h
View File

@ -106,7 +106,18 @@ protected:
typedef typename Base::Handle_map Handle_map;
typedef typename Base::Point_handle_pair Point_handle_pair;
using Base::merge_info;
using Base::same_segments;
using Base::is_degenerate_segment;
using Base::convert_info;
using Base::second_endpoint_of_segment;
using Base::split_storage_site;
using Base::first_endpoint_of_segment;
using Base::incircle;
public:
using Base::is_infinite;
typedef typename Base::Point_container Point_container;
typedef typename Base::size_type size_type;