* installing to library ‘/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages’ * installing *source* package ‘bnclassify’ ... ** this is package ‘bnclassify’ version ‘0.4.8’ ** package ‘bnclassify’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-19) 14.2.0’ make[1]: Entering directory '/tmp/Rtmprhp0ay/R.INSTALL321f085f498e93/bnclassify/src' g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c RcppExports.cpp -o RcppExports.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c anb-operate.cpp -o anb-operate.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c basic-misc.cpp -o basic-misc.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c basic-probs.cpp -o basic-probs.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c bh.cpp -o bh.o In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/scoped_ptr.hpp:13, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:22, from bh.cpp:4: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 75 | explicit scoped_ptr( std::auto_ptr p ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered/detail/opt_storage.hpp:11, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered/detail/archive_constructed.hpp:12, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered/detail/serialize_container.hpp:14, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered/unordered_set.hpp:18, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/unordered_set.hpp:17, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:20: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_assert.hpp:23, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/arg.hpp:25, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/placeholders.hpp:24, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/iterator/iterator_categories.hpp:16, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:25, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:24: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses] 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses 194 | failed ************ (Pred::************ | ^~~~~~~~~~~~~~~~~~~ | - 195 | assert_arg( void (*)(Pred), typename assert_arg_pred::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 196 | ); | ~ | - /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses] 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses 199 | failed ************ (boost::mpl::not_::************ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | - 200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 201 | ); | ~ | - In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:17, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/vector_property_map.hpp:14, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:598, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:27: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr & r ): pi_( new sp_counted_impl_p( r.get() ) ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr & r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr && r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr& boost::shared_ptr::operator=(std::auto_ptr<_Up>&&)’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template class auto_ptr; | ^~~~~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::filtered_graph > >, boost::property > >, boost::keep_all, remove_names > >, boost::property > >, boost::adjacency_list > >, boost::property > >*, std::__cxx11::basic_string, std::__cxx11::basic_string&, boost::vertex_name_t> > >; F = boost::adjacency_list > >, boost::property > >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:198:17: required from here 198 | return graph2R(fg, g); | ~~~~~~~^~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::filtered_graph > >, boost::property >, remove_edge_names > >, boost::property >, boost::adjacency_list > >, boost::property >*, std::__cxx11::basic_string, std::__cxx11::basic_string&, boost::vertex_name_t>, boost::adjacency_list > >, boost::property > >, boost::keep_all>; F = boost::adjacency_list > >, boost::property >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:216:17: required from here 216 | return graph2R(fg, g); | ~~~~~~~^~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::adjacency_list > >, boost::property >; F = boost::adjacency_list > >, boost::property >; Rcpp::List = Rcpp::Vector<19>]’: bh.cpp:272:17: required from here 272 | return graph2R(krusk, krusk); | ~~~~~~~^~~~~~~~~~~~~~ bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable] 70 | IndexMap index = get(vertex_index, original_graph); | ^~~~~ In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/assert.hpp:35, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:19: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:31, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:20: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = int*; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/int.hpp:20, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/lambda_fwd.hpp:23, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_spec.hpp:18, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/mpl/if.hpp:19, from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:17: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >::~RandomAccessIteratorConcept()’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept > >, boost::property > >::~VertexListGraphConcept()’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >, boost::property > >’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept > >, boost::property > >::~EdgeListGraphConcept()’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >::~OutputIteratorConcept()’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ComparableConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept::~ComparableConcept()’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::IntegerConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept::~IntegerConcept()’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’ 70 | BOOST_concept(Integer, (T)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::WritablePropertyMapConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::VertexListGraph > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 182 | BOOST_CONCEPT_USAGE(VertexListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::EdgeListGraph > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept > >, boost::property > >’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EdgeListGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = std::back_insert_iterator > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::OutputIterator > >, boost::detail::edge_desc_impl >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator > >, boost::detail::edge_desc_impl >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >’ 526 | BOOST_concept(OutputIterator,(TT)(ValueT)) | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::OutputIteratorConcept > >, boost::detail::edge_desc_impl >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator::~OutputIterator() [with TT = std::back_insert_iterator > >; ValueT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 529 | BOOST_CONCEPT_USAGE(OutputIterator) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::ConvertibleConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::adj_list_edge_property_map, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadablePropertyMapConcept, boost::edge_weight_t>, boost::detail::edge_desc_impl >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept::~ConvertibleConcept()’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Comparable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept’ 251 | BOOST_concept(Comparable,(TT)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ComparableConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable::~Comparable() [with TT = double]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = long unsigned int; Y = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ConvertibleConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >::value’ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::edge_weight_t>, boost::detail::edge_desc_impl > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::edge_weight_t>, boost::detail::edge_desc_impl >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept, boost::adjacency_list > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ In file included from /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:15, from bh.cpp:5: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = boost::adjacency_list > >, boost::property >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::SignedInteger]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger::~SignedInteger()’ 107 | template <> struct SignedInteger {}; | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 540 | BOOST_concept(ForwardIterator,(TT)) | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 568 | BOOST_concept(BidirectionalIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator > > >’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator > > >]’ 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph > >, boost::property > >’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::detail::components_recorder; Graph = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept, boost::adjacency_list > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, boost::adjacency_list > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, boost::adjacency_list > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, boost::adjacency_list > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >, boost::property > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map > >, long unsigned int> >; Key = long unsigned int]’ 205 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::ColorValueConcept]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept::~ColorValueConcept()’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map > >, long unsigned int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~^ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property > >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = long unsigned int]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list > >, boost::property > >]’ 39 | void constraints() | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::detail::components_recorder]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::ReadablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map > >, long unsigned int> >; Key = long unsigned int]’ 147 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint::failed() [with Model = boost::WritablePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::ReadWritePropertyMapConcept > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept::constraints() [with PMap = boost::shared_array_property_map > >, long unsigned int> >; Key = long unsigned int]’ 179 | void constraints() { | ^~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::ColorValue]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept’ 502 | BOOST_concept(ColorValue, (C)) | ^~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::ColorValueConcept]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue::~ColorValue() [with C = boost::default_color_type]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 505 | BOOST_CONCEPT_USAGE(ColorValue) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph::~VertexListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::VertexListGraphConcept > >, boost::property > >]’ 176 | BOOST_concept(VertexListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::range_detail::integer_iterator]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::CopyConstructibleConcept > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept::constraints() [with Visitor = boost::topo_sort_visitor > >; Graph = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DFSVisitorConcept > >, boost::adjacency_list > >, boost::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::adjacency_list > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::adjacency_list > >, boost::property > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept > > >::~CopyConstructibleConcept()’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property > > > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > > >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept > >, boost::property > > >::~IncidenceGraphConcept()’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’ 29 | # define BOOST_PP_CAT_I(a, b) a ## b | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’ 23 | struct BOOST_PP_CAT(name,Concept) \ | ^~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter > >, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::CopyConstructible > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept > > >’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::CopyConstructibleConcept > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible::~CopyConstructible() [with TT = boost::topo_sort_visitor > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::Graph > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph::~Graph() [with G = boost::adjacency_list > >, boost::property > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::IncidenceGraph > >, boost::property > > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property > > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph > >, boost::property > > >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept > >, boost::property > > >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property > > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph::~EdgeListGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::EdgeListGraphConcept > >, boost::property > >]’ 226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = boost::adjacency_list > >, boost::property >; OutputIterator = std::back_insert_iterator > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator > >, boost::vec_adj_list_vertex_id_map > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map, boost::edge_weight_t>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = adjacency_list > >, property >; OutputIterator = std::back_insert_iterator > >]’ 112 | detail::kruskal_mst_impl(g, spanning_tree_edges, | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~ 113 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 114 | rank_map.begin(), get(vertex_index, g), rank_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 115 | make_iterator_property_map( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 116 | pred_map.begin(), get(vertex_index, g), pred_map[0]), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 117 | get(edge_weight, g)); | ~~~~~~~~~~~~~~~~~~~~ bh.cpp:256:32: required from here 256 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::DefaultConstructible >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::EqualityComparable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Assignable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property > >; DFSVisitor = boost::topo_sort_visitor > >; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property > >; DFSVisitor = topo_sort_visitor > >; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list > >, boost::property >; DFSVisitor = components_recorder; ColorMap = boost::shared_array_property_map > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits::vertex_descriptor = long unsigned int]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE( | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::DefaultConstructible >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::DefaultConstructible >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::EqualityComparable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Assignable >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::edge_desc_impl]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_ > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property > >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::IncidenceGraphConcept > >, boost::property > > >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:129:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_, std::input_iterator_tag>)>’ 72 | struct requirement_ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement::failed() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::InputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::MultiPassInputIterator > >, boost::property >*, std::vector > >, boost::property >, std::allocator > >, boost::property > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph::~IncidenceGraph() [with G = boost::adjacency_list > >, boost::property >]’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::InputIterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int> > >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property > >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property > >; ArgPack = boost::parameter::aux::arg_list > > >, boost::parameter::aux::arg_list, boost::parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property > >; P = topo_sort_visitor > >; T = graph_visitor_t; R = bgl_named_params; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list > > >, parameter::aux::arg_list, parameter::aux::empty_arg_list, std::integral_constant >, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params&) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >; P = int; T = buffer_param_t; R = no_property]’ 69 | depth_first_search(g, params.visitor(TopoVisitor(result))); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = adjacency_list > >, property > >; OutputIterator = std::back_insert_iterator >]’ 75 | topological_sort( | ~~~~~~~~~~~~~~~~^ 76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ bh.cpp:280:19: required from here 280 | topological_sort(g, std::back_inserter(sorted)); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator > >*, std::vector > >, std::allocator > > > > >, long unsigned int, boost::detail::edge_desc_impl, long int>]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements::~usage_requirements() [with Model = boost::Convertible, std::input_iterator_tag>]’: /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement::failed() [with Model = boost::concepts::usage_requirements, std::input_iterator_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible, std::input_iterator_tag>’ 92 | &::boost::concepts::requirement_::failed> \ | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints*) [with Model = boost::Convertible, std::input_iterator_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints* = 0); | ^~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied, std::input_iterator_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied, std::input_iterator_tag> >’ 45 | typedef boost::integral_constant type; | ^~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits::vertex_descriptor) [with VertexListGraph = adjacency_list > >, property >; DFSVisitor = detail::components_recorder; ColorMap = shared_array_property_map > >, long unsigned int> >; typename graph_traits::vertex_descriptor = long unsigned int]’ 286 | detail::depth_first_visit_impl( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 287 | g, start_vertex, vis, color, detail::nontruth2()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; Graph = boost::adjacency_list > >, boost::property >]’ 397 | boost::depth_first_search(g, | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~ 398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())], | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 400 | arg_pack[_root_vertex | ~~~~~~~~~~~~~~~~~~~~~ 401 | || boost::detail::get_default_starting_vertex_t< | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 402 | Graph >(g)]); | ~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list > >, boost::property >; ArgPack = boost::parameter::aux::arg_list >, boost::parameter::aux::empty_arg_list, std::integral_constant >; typename boost::result_of(Param0, const ArgPack&)>::type = void]’ 680 | return detail::BOOST_PP_CAT( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~ 682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 683 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params&) [with Param0 = adjacency_list > >, property >; P = detail::components_recorder; T = graph_visitor_t; R = no_property; typename result_of(Param0, const typename detail::convert_bgl_params_to_boost_parameter >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter >::type = parameter::aux::arg_list >, parameter::aux::empty_arg_list, std::integral_constant >]’ 730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~ 731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \ | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 732 | arg_pack); \ | ~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list > >, property >; ComponentMap = int*; typename property_traits::value_type = int; typename enable_if_c::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits::traversal_category = undir_adj_list_traversal_tag]’ 106 | depth_first_search(g, visitor(vis)); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ bh.cpp:146:23: required from here 146 | connected_components(g, &component[0]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal; Y = std::input_iterator_tag]’ 37 | ~model() | ^ /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’ 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c data.cpp -o data.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c graph-internal.cpp -o graph-internal.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c infer-test-wrappers.cpp -o infer-test-wrappers.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c infer.cpp -o infer.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c multidim-array.cpp -o multidim-array.o g++-14 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-devel-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/BH/include' -I/usr/local/include -D_FORTIFY_SOURCE=3 -fpic -g -O2 -Wall -pedantic -mtune=native -c table.cpp -o table.o g++-14 -std=gnu++17 -shared -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -Wl,-O1 -o bnclassify.so RcppExports.o anb-operate.o basic-misc.o basic-probs.o bh.o data.o graph-internal.o infer-test-wrappers.o infer.o multidim-array.o table.o -L/home/hornik/tmp/R.check/r-devel-gcc/Work/build/lib -lR make[1]: Leaving directory '/tmp/Rtmprhp0ay/R.INSTALL321f085f498e93/bnclassify/src' make[1]: Entering directory '/tmp/Rtmprhp0ay/R.INSTALL321f085f498e93/bnclassify/src' make[1]: Leaving directory '/tmp/Rtmprhp0ay/R.INSTALL321f085f498e93/bnclassify/src' installing to /home/hornik/tmp/R.check/r-devel-gcc/Work/build/Packages/00LOCK-bnclassify/00new/bnclassify/libs ** R ** data ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** installing vignettes ** testing if installed package can be loaded from temporary location ** checking absolute paths in shared objects and dynamic libraries ** testing if installed package can be loaded from final location ** testing if installed package keeps a record of temporary installation path * DONE (bnclassify)