From 7e8af8bbf91329f9d1ff9b33391dec352e099bc0 Mon Sep 17 00:00:00 2001 From: Franz Detro Date: Tue, 4 Sep 2012 14:53:12 +0200 Subject: [PATCH] fix warnings in boost graph --- boost/graph/compressed_sparse_row_graph.hpp | 2 +- boost/graph/detail/indexed_properties.hpp | 4 ++-- boost/graph/detail/set_adaptor.hpp | 2 +- boost/graph/named_function_params.hpp | 10 +++++----- boost/graph/named_graph.hpp | 2 +- boost/graph/reverse_graph.hpp | 8 ++++---- boost/graph/visitors.hpp | 4 ++-- 7 files changed, 16 insertions(+), 16 deletions(-) diff --git a/boost/graph/compressed_sparse_row_graph.hpp b/boost/graph/compressed_sparse_row_graph.hpp index 59e8bb4..42e2419 100644 --- a/boost/graph/compressed_sparse_row_graph.hpp +++ b/boost/graph/compressed_sparse_row_graph.hpp @@ -136,7 +136,7 @@ namespace detail { typedef boost::iterator_facade, T, std::random_access_iterator_tag, const T&> base_type; T saved_value; const T& dereference() const {return saved_value;} - bool equal(default_construct_iterator i) const {return true;} + bool equal(default_construct_iterator /*i*/) const {return true;} void increment() {} void decrement() {} void advance(typename base_type::difference_type) {} diff --git a/boost/graph/detail/indexed_properties.hpp b/boost/graph/detail/indexed_properties.hpp index e1f874b..4494625 100644 --- a/boost/graph/detail/indexed_properties.hpp +++ b/boost/graph/detail/indexed_properties.hpp @@ -253,7 +253,7 @@ class indexed_edge_properties typedef secret const_edge_map_type; secret operator[](secret) { return secret(); } - void write_by_index(std::size_t idx, const no_property& prop) {} + void write_by_index(std::size_t /*idx*/, const no_property& /*prop*/) {} edge_map_type get_edge_bundle(const IndexMap& = IndexMap()) const { return edge_map_type(); @@ -270,7 +270,7 @@ class indexed_edge_properties public: void push_back(const edge_push_back_type&) { } - void move_range(std::size_t src_begin, std::size_t src_end, std::size_t dest_begin) {} + void move_range(std::size_t /*src_begin*/, std::size_t /*src_end*/, std::size_t /*dest_begin*/) {} typedef dummy_no_property_iterator iterator; iterator begin() {return dummy_no_property_iterator();} diff --git a/boost/graph/detail/set_adaptor.hpp b/boost/graph/detail/set_adaptor.hpp index 90a64a2..33acc07 100644 --- a/boost/graph/detail/set_adaptor.hpp +++ b/boost/graph/detail/set_adaptor.hpp @@ -111,7 +111,7 @@ namespace boost { // Shit, can't implement this without knowing the size of the // universe. template - void set_compliment(const std::set& x, + void set_compliment(const std::set& /*x*/, std::set& z) { z.clear(); diff --git a/boost/graph/named_function_params.hpp b/boost/graph/named_function_params.hpp index 32dd580..94314a6 100644 --- a/boost/graph/named_function_params.hpp +++ b/boost/graph/named_function_params.hpp @@ -432,13 +432,13 @@ BOOST_BGL_DECLARE_NAMED_PARAMS template struct override_property_t { typedef ArgType result_type; - result_type operator()(const Graph& g, const typename boost::add_reference::type a) const {return a;} + result_type operator()(const Graph&, const typename boost::add_reference::type a) const {return a;} }; template struct override_property_t { typedef typename boost::property_map::type result_type; - result_type operator()(const Graph& g, const ArgType& a) const {return get(Prop(), g);} + result_type operator()(const Graph& g, const ArgType&) const {return get(Prop(), g);} }; template @@ -455,7 +455,7 @@ BOOST_BGL_DECLARE_NAMED_PARAMS template typename override_property_result::type - override_property(const ArgPack& ap, const boost::parameter::keyword& t, const Graph& g, Prop prop) { + override_property(const ArgPack& ap, const boost::parameter::keyword& t, const Graph& g, Prop) { return override_property_t< typename boost::parameter::value_type::type, Prop, @@ -633,7 +633,7 @@ BOOST_BGL_DECLARE_NAMED_PARAMS typedef Q priority_queue_type; static priority_queue_type - make_queue(const Graph& g, const ArgPack& ap, KeyT defaultKey, const Q& q) { + make_queue(const Graph&, const ArgPack&, KeyT, const Q& q) { return q; } }; @@ -645,7 +645,7 @@ BOOST_BGL_DECLARE_NAMED_PARAMS typedef boost::d_ary_heap_indirect::helper::map_type, Compare> priority_queue_type; static priority_queue_type - make_queue(const Graph& g, const ArgPack& ap, KeyT defaultKey, const Q& q) { + make_queue(const Graph& g, const ArgPack& ap, KeyT defaultKey, const Q&) { return priority_queue_type( map_maker::make_map(g, ap, defaultKey), map_maker::make_map(g, ap, typename boost::property_traits::value_type(-1)) diff --git a/boost/graph/named_graph.hpp b/boost/graph/named_graph.hpp index f49c097..77e1a22 100644 --- a/boost/graph/named_graph.hpp +++ b/boost/graph/named_graph.hpp @@ -105,7 +105,7 @@ public: typedef vertex_name_type argument_type; typedef VertexProperty result_type; - VertexProperty operator()(const vertex_name_type& name) + VertexProperty operator()(const vertex_name_type&) { boost::throw_exception(std::runtime_error("add_vertex: " "unable to create a vertex from its name")); diff --git a/boost/graph/reverse_graph.hpp b/boost/graph/reverse_graph.hpp index 96fc32d..bea975a 100644 --- a/boost/graph/reverse_graph.hpp +++ b/boost/graph/reverse_graph.hpp @@ -460,7 +460,7 @@ template typename enable_if, detail::underlying_edge_desc_map_type::edge_descriptor> >::type get(edge_underlying_t, - G& g) + G&) { return detail::underlying_edge_desc_map_type::edge_descriptor>(); } @@ -468,7 +468,7 @@ get(edge_underlying_t, template typename enable_if, typename graph_traits::edge_descriptor>::type get(edge_underlying_t, - G& g, + G&, const typename graph_traits::edge_descriptor& k) { return k.underlying_descx; @@ -477,7 +477,7 @@ get(edge_underlying_t, template typename enable_if, detail::underlying_edge_desc_map_type::edge_descriptor> >::type get(edge_underlying_t, - const G& g) + const G&) { return detail::underlying_edge_desc_map_type::edge_descriptor>(); } @@ -485,7 +485,7 @@ get(edge_underlying_t, template typename enable_if, typename graph_traits::edge_descriptor>::type get(edge_underlying_t, - const G& g, + const G&, const typename graph_traits::edge_descriptor& k) { return k.underlying_descx; diff --git a/boost/graph/visitors.hpp b/boost/graph/visitors.hpp index f986c96..d10e140 100644 --- a/boost/graph/visitors.hpp +++ b/boost/graph/visitors.hpp @@ -269,7 +269,7 @@ namespace boost { {} template - void operator() (VertexOrEdge v, const Graph& g) + void operator() (VertexOrEdge v, const Graph&) { put (property_map_, v, value_); } @@ -292,7 +292,7 @@ namespace boost { inline property_put put_property (PropertyMap property_map, typename property_traits ::value_type value, - EventTag tag) + EventTag) { return property_put (property_map, value); } -- 1.7.11.1