mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-14 00:42:09 +00:00
[Geometry] Fixed unused parameters warnings in 15 files
[SVN r76586]
This commit is contained in:
@@ -38,7 +38,7 @@ namespace detail { namespace append
|
||||
template <typename Geometry, typename Point>
|
||||
struct append_no_action
|
||||
{
|
||||
static inline void apply(Geometry& geometry, Point const& point,
|
||||
static inline void apply(Geometry& , Point const& ,
|
||||
int = 0, int = 0)
|
||||
{
|
||||
}
|
||||
|
||||
@@ -83,7 +83,7 @@ template <typename BoxIn, typename T, typename BoxOut>
|
||||
struct buffer<box_tag, box_tag, BoxIn, T, BoxOut>
|
||||
{
|
||||
static inline void apply(BoxIn const& box_in, T const& distance,
|
||||
T const& chord_length, BoxIn& box_out)
|
||||
T const& , BoxIn& box_out)
|
||||
{
|
||||
detail::buffer::buffer_box(box_in, distance, box_out);
|
||||
}
|
||||
|
||||
@@ -80,7 +80,7 @@ struct correct_box_loop
|
||||
template <typename Box, std::size_t DimensionCount>
|
||||
struct correct_box_loop<Box, DimensionCount, DimensionCount>
|
||||
{
|
||||
static inline void apply(Box& box)
|
||||
static inline void apply(Box& )
|
||||
{}
|
||||
|
||||
};
|
||||
|
||||
@@ -73,7 +73,7 @@ struct covered_by<box_tag, box_tag, Box1, Box2, Strategy>
|
||||
template <typename Point, typename Ring, typename Strategy>
|
||||
struct covered_by<point_tag, ring_tag, Point, Ring, Strategy>
|
||||
{
|
||||
static inline bool apply(Point const& point, Ring const& ring, Strategy const& strategy)
|
||||
static inline bool apply(Point const& point, Ring const& ring, Strategy const& )
|
||||
{
|
||||
return detail::within::point_in_ring
|
||||
<
|
||||
|
||||
@@ -33,7 +33,7 @@ namespace following
|
||||
{
|
||||
|
||||
template <typename Turn, typename Operation>
|
||||
static inline bool is_entering(Turn const& turn, Operation const& op)
|
||||
static inline bool is_entering(Turn const& /* TODO remove this parameter */, Operation const& op)
|
||||
{
|
||||
// (Blocked means: blocked for polygon/polygon intersection, because
|
||||
// they are reversed. But for polygon/line it is similar to continue)
|
||||
@@ -126,10 +126,10 @@ struct action_selector<overlay_intersection>
|
||||
typename Operation
|
||||
>
|
||||
static inline void enter(LineStringOut& current_piece,
|
||||
LineString const& linestring,
|
||||
LineString const& ,
|
||||
segment_identifier& segment_id,
|
||||
int index, Point const& point,
|
||||
Operation const& operation, OutputIterator& out)
|
||||
int , Point const& point,
|
||||
Operation const& operation, OutputIterator& )
|
||||
{
|
||||
// On enter, append the intersection point and remember starting point
|
||||
detail::overlay::append_no_duplicates(current_piece, point);
|
||||
@@ -148,7 +148,7 @@ struct action_selector<overlay_intersection>
|
||||
LineString const& linestring,
|
||||
segment_identifier& segment_id,
|
||||
int index, Point const& point,
|
||||
Operation const& operation, OutputIterator& out)
|
||||
Operation const& , OutputIterator& out)
|
||||
{
|
||||
// On leave, copy all segments from starting point, append the intersection point
|
||||
// and add the output piece
|
||||
@@ -273,7 +273,7 @@ public :
|
||||
|
||||
template<typename Turns, typename OutputIterator>
|
||||
static inline OutputIterator apply(LineString const& linestring, Polygon const& polygon,
|
||||
detail::overlay::operation_type operation,
|
||||
detail::overlay::operation_type , // TODO: this parameter might be redundant
|
||||
Turns& turns, OutputIterator out)
|
||||
{
|
||||
typedef typename boost::range_iterator<Turns>::type turn_iterator;
|
||||
|
||||
@@ -50,7 +50,7 @@ struct intersection_segment_segment_point
|
||||
{
|
||||
static inline OutputIterator apply(Segment1 const& segment1,
|
||||
Segment2 const& segment2, OutputIterator out,
|
||||
Strategy const& strategy)
|
||||
Strategy const& )
|
||||
{
|
||||
typedef typename point_type<PointOut>::type point_type;
|
||||
|
||||
@@ -146,7 +146,7 @@ struct intersection_of_linestring_with_areal
|
||||
|
||||
static inline OutputIterator apply(LineString const& linestring, Areal const& areal,
|
||||
OutputIterator out,
|
||||
Strategy const& strategy)
|
||||
Strategy const& )
|
||||
{
|
||||
if (boost::size(linestring) == 0)
|
||||
{
|
||||
@@ -351,7 +351,7 @@ struct intersection_insert
|
||||
>
|
||||
{
|
||||
static inline OutputIterator apply(Linestring const& linestring,
|
||||
Box const& box, OutputIterator out, Strategy const& strategy)
|
||||
Box const& box, OutputIterator out, Strategy const& )
|
||||
{
|
||||
typedef typename point_type<GeometryOut>::type point_type;
|
||||
strategy::intersection::liang_barsky<Box, point_type> lb_strategy;
|
||||
@@ -436,7 +436,7 @@ struct intersection_insert
|
||||
>
|
||||
{
|
||||
static inline OutputIterator apply(Segment const& segment,
|
||||
Box const& box, OutputIterator out, Strategy const& strategy)
|
||||
Box const& box, OutputIterator out, Strategy const& )
|
||||
{
|
||||
geometry::segment_view<Segment> range(segment);
|
||||
|
||||
@@ -469,7 +469,7 @@ struct intersection_insert
|
||||
>
|
||||
{
|
||||
static inline OutputIterator apply(Geometry1 const& geometry1,
|
||||
Geometry2 const& geometry2, OutputIterator out, Strategy const& strategy)
|
||||
Geometry2 const& geometry2, OutputIterator out, Strategy const& )
|
||||
{
|
||||
|
||||
typedef detail::overlay::turn_info<PointOut> turn_info;
|
||||
|
||||
@@ -64,7 +64,7 @@ template<typename Point, typename Segment, typename Strategy>
|
||||
struct point_to_segment
|
||||
{
|
||||
static inline typename return_type<Strategy>::type apply(Point const& point,
|
||||
Segment const& segment, Strategy const& strategy)
|
||||
Segment const& segment, Strategy const& )
|
||||
{
|
||||
typename strategy::distance::services::default_strategy
|
||||
<
|
||||
|
||||
@@ -55,8 +55,10 @@ template <typename Point, typename Functor, bool IsConst>
|
||||
struct fe_point_per_segment
|
||||
{
|
||||
static inline Functor apply(
|
||||
typename add_const_if_c<IsConst, Point>::type& point, Functor f)
|
||||
typename add_const_if_c<IsConst, Point>::type& , Functor f)
|
||||
{
|
||||
// TODO: if non-const, we should extract the points from the segment
|
||||
// and call the functor on those two points
|
||||
return f;
|
||||
}
|
||||
};
|
||||
|
||||
@@ -67,7 +67,7 @@ struct simplify_copy
|
||||
{
|
||||
template <typename Distance>
|
||||
static inline void apply(Range const& range, Range& out,
|
||||
Distance const& max_distance, Strategy const& strategy)
|
||||
Distance const& , Strategy const& )
|
||||
{
|
||||
std::copy
|
||||
(
|
||||
@@ -179,7 +179,7 @@ struct simplify<point_tag, Point, Strategy>
|
||||
{
|
||||
template <typename Distance>
|
||||
static inline void apply(Point const& point, Point& out,
|
||||
Distance const& max_distance, Strategy const& strategy)
|
||||
Distance const& , Strategy const& )
|
||||
{
|
||||
geometry::convert(point, out);
|
||||
}
|
||||
|
||||
@@ -181,7 +181,7 @@ template
|
||||
struct clip_multi_linestring
|
||||
{
|
||||
static inline OutputIterator apply(MultiLinestring const& multi_linestring,
|
||||
Box const& box, OutputIterator out, Strategy const& strategy)
|
||||
Box const& box, OutputIterator out, Strategy const& )
|
||||
{
|
||||
typedef typename point_type<LinestringOut>::type point_type;
|
||||
strategy::intersection::liang_barsky<Box, point_type> lb_strategy;
|
||||
|
||||
@@ -60,8 +60,7 @@ namespace detail
|
||||
{}
|
||||
|
||||
// Necessary for proper compilation
|
||||
inline douglas_peucker_point<Point> operator=(
|
||||
douglas_peucker_point<Point> const& other)
|
||||
inline douglas_peucker_point<Point> operator=(douglas_peucker_point<Point> const& )
|
||||
{
|
||||
return douglas_peucker_point<Point>(*this);
|
||||
}
|
||||
|
||||
@@ -219,7 +219,7 @@ struct get_comparable<pythagoras<Point1, Point2, CalculationType> >
|
||||
{
|
||||
typedef comparable::pythagoras<Point1, Point2, CalculationType> comparable_type;
|
||||
public :
|
||||
static inline comparable_type apply(pythagoras<Point1, Point2, CalculationType> const& input)
|
||||
static inline comparable_type apply(pythagoras<Point1, Point2, CalculationType> const& )
|
||||
{
|
||||
return comparable_type();
|
||||
}
|
||||
@@ -303,7 +303,7 @@ struct get_comparable<comparable::pythagoras<Point1, Point2, CalculationType> >
|
||||
{
|
||||
typedef comparable::pythagoras<Point1, Point2, CalculationType> comparable_type;
|
||||
public :
|
||||
static inline comparable_type apply(comparable::pythagoras<Point1, Point2, CalculationType> const& input)
|
||||
static inline comparable_type apply(comparable::pythagoras<Point1, Point2, CalculationType> const& )
|
||||
{
|
||||
return comparable_type();
|
||||
}
|
||||
|
||||
@@ -66,7 +66,7 @@ template
|
||||
struct transform_coordinates<Src, Dst, N, N, F>
|
||||
{
|
||||
template <typename T>
|
||||
static inline void transform(Src const& source, Dst& dest, T value)
|
||||
static inline void transform(Src const& , Dst& , T )
|
||||
{
|
||||
}
|
||||
};
|
||||
|
||||
@@ -218,7 +218,7 @@ public :
|
||||
// constructor takes an optional third argument doing nothing.
|
||||
inline translate_transformer(coordinate_type const& translate_x,
|
||||
coordinate_type const& translate_y,
|
||||
coordinate_type const& dummy = 0)
|
||||
coordinate_type const& = 0)
|
||||
: ublas_transformer<P1, P2, 2, 2>(
|
||||
1, 0, translate_x,
|
||||
0, 1, translate_y,
|
||||
@@ -275,7 +275,7 @@ class scale_transformer<P1, P2, 2, 2> : public ublas_transformer<P1, P2, 2, 2>
|
||||
public :
|
||||
inline scale_transformer(coordinate_type const& scale_x,
|
||||
coordinate_type const& scale_y,
|
||||
coordinate_type const& dummy = 0)
|
||||
coordinate_type const& = 0)
|
||||
: ublas_transformer<P1, P2, 2, 2>(
|
||||
scale_x, 0, 0,
|
||||
0, scale_y, 0,
|
||||
|
||||
@@ -54,7 +54,7 @@ struct coordinates_scanner<Point, DimensionCount, DimensionCount, IsConst>
|
||||
<
|
||||
IsConst,
|
||||
Point
|
||||
>::type& point, Op operation)
|
||||
>::type& , Op operation)
|
||||
{
|
||||
return operation;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user