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

Remove unused parameter names of functions involving warnings while compiling

This commit is contained in:
Sébastien Loriot 2007-02-08 07:47:54 +00:00
parent c5ed06e582
commit 54d6b1f926
3 changed files with 17 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -104,7 +104,7 @@ private:
bool
is_interior_in_conflict_both_pp(const Site_2& sp, const Site_2& sq,
const Site_2& r, const Site_2& s,
const Site_2& t, Method_tag tag) const
const Site_2& t, Method_tag ) const
{
CGAL_precondition( sp.is_point() && sq.is_point() );
@ -165,8 +165,8 @@ private:
bool
is_interior_in_conflict_both_ss(const Site_2& p, const Site_2& q,
const Site_2& r, const Site_2& s,
const Site_2& t, Method_tag) const
const Site_2& , const Site_2& ,
const Site_2& , Method_tag) const
{
CGAL_precondition( p.is_segment() && q.is_segment() );
return true;
@ -197,7 +197,7 @@ private:
bool
is_interior_in_conflict_both_ps_p(const Site_2& p, const Site_2& q,
const Site_2& r, const Site_2& s,
const Site_2& t, Method_tag tag) const
const Site_2& t, Method_tag ) const
{
CGAL_precondition( t.is_point() );
@ -235,7 +235,7 @@ private:
bool
is_interior_in_conflict_both_ps_s(const Site_2& sp, const Site_2& sq,
const Site_2& r, const Site_2& s,
const Site_2& st, Method_tag tag) const
const Site_2& st, Method_tag ) const
{
CGAL_precondition( st.is_segment() );
Point_2 p = sp.point();
@ -457,8 +457,8 @@ private:
bool
is_interior_in_conflict_none_pp(const Site_2& p, const Site_2& q,
const Site_2& r, const Site_2& s,
const Site_2& t, Method_tag tag) const
const Site_2& , const Site_2& ,
const Site_2& t, Method_tag ) const
{
CGAL_precondition( p.is_point() && q.is_point() && t.is_point() );
return false;
@ -469,7 +469,7 @@ private:
bool
is_interior_in_conflict_none_ps(const Site_2& sp, const Site_2& sq,
const Site_2& r, const Site_2& s,
const Site_2& st, Method_tag tag) const
const Site_2& st, Method_tag ) const
{
CGAL_precondition( sp.is_point() && sq.is_segment() && st.is_point() );
@ -522,7 +522,7 @@ private:
bool
is_interior_in_conflict_none_ss(const Site_2& p, const Site_2& q,
const Site_2& r, const Site_2& s,
const Site_2& t, Method_tag tag) const
const Site_2& t, Method_tag ) const
{
CGAL_precondition( p.is_segment() && q.is_segment() && t.is_point() );
@ -651,7 +651,7 @@ public:
}
bool operator()(const Site_2& p, const Site_2& q, const Site_2& r,
bool operator()(const Site_2& p, const Site_2& q, const Site_2& ,
const Site_2& t, Sign sgn) const
{
if ( t.is_point() ) {
@ -675,7 +675,7 @@ public:
}
bool operator()(const Site_2& p, const Site_2& q, const Site_2& t,
Sign sgn) const
Sign ) const
{
if ( p.is_segment() || q.is_segment()) {
return false;

6
Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
View File

@ -68,7 +68,7 @@ operator=(const Self& other)
template<class Gt, class ST, class DS, class LTag>
typename Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::Vertex_handle
Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::
insert_first(const Storage_site_2& ss, const Point_2& p)
insert_first(const Storage_site_2& ss, const Point_2& )
{
CGAL_precondition( number_of_vertices() == 0 );
@ -220,7 +220,7 @@ insert_third(const Site_2& t, const Storage_site_2& ss)
template<class Gt, class ST, class DS, class LTag>
typename Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::Vertex_handle
Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::
insert_third(const Storage_site_2& ss, Vertex_handle v0, Vertex_handle v1)
insert_third(const Storage_site_2& ss, Vertex_handle , Vertex_handle )
{
CGAL_precondition( number_of_vertices() == 2 );
@ -607,7 +607,7 @@ insert_exact_point_on_segment(const Storage_site_2& ss, const Site_2& t,
template<class Gt, class ST, class DS, class LTag>
typename Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::Vertex_triple
Segment_Delaunay_graph_2<Gt,ST,DS,LTag>::
insert_point_on_segment(const Storage_site_2& ss, const Site_2& t,
insert_point_on_segment(const Storage_site_2& ss, const Site_2& ,
Vertex_handle v, const Tag_true&)
{
// splits the segment site v->site() in two and inserts the point of

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

@ -820,7 +820,7 @@ private:
//--------------------------------------------------------------------------
Sign incircle_p_no_easy(const Site_2& st, PPS_Type type) const
Sign incircle_p_no_easy(const Site_2& st, PPS_Type ) const
{
CGAL_precondition( st.is_point() );
@ -841,7 +841,7 @@ private:
//--------------------------------------------------------------------------
Sign incircle_p_no_easy(const Site_2& st, PSS_Type type) const
Sign incircle_p_no_easy(const Site_2& st, PSS_Type ) const
{
CGAL_precondition( st.is_point() );
Point_2 t = st.point();
@ -871,7 +871,7 @@ private:
//--------------------------------------------------------------------------
Sign incircle_p_no_easy(const Site_2& st, SSS_Type type) const
Sign incircle_p_no_easy(const Site_2& st, SSS_Type ) const
{
CGAL_precondition( st.is_point() );