* installing to library ‘/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages’
* installing *source* package ‘bnclassify’ ...
** package ‘bnclassify’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
using C++ compiler: ‘g++-13 (Debian 13.2.0-23) 13.2.0’
make[1]: Entering directory '/tmp/Rtmpmdnizr/R.INSTALLddb2cd79dde0/bnclassify/src'
g++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/scoped_ptr.hpp:13,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:22,
from bh.cpp:4:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) BOOST_SP_NOEXCEPT : px( p.release() )
| ^~~~~~~~
In file included from /usr/include/c++/13/memory:78,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered/detail/opt_storage.hpp:11,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered/detail/archive_constructed.hpp:12,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered/detail/serialize_container.hpp:14,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered/detail/serialize_fca_container.hpp:12,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered/unordered_set.hpp:17,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/unordered_set.hpp:17,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:20:
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_assert.hpp:23,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/arg.hpp:25,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/placeholders.hpp:24,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/iterator/iterator_categories.hpp:16,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:25,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:24:
/home/hornik/tmp/R.check/r-release-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<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/hornik/tmp/R.check/r-release-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<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/hornik/tmp/R.check/r-release-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_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:18,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:598,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/adjacency_list.hpp:27:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/detail/shared_count.hpp:361:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
361 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:251:65: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
251 | template< class T, class R > struct sp_enable_if_auto_ptr< std::auto_ptr< T >, R >
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:508:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
508 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:521:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
521 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:604:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
604 | shared_ptr & operator=( std::auto_ptr<Y> & r )
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:613:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
613 | shared_ptr & operator=( std::auto_ptr<Y> && r )
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:615:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
615 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
| ^~~~~~~~
/usr/include/c++/13/bits/unique_ptr.h:65:28: note: declared here
65 | template<typename> class auto_ptr;
| ^~~~~~~~
bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, boost::keep_all, remove_names<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char>&, boost::vertex_name_t> > >; F = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; Rcpp::List = Rcpp::Vector<19>]’:
bh.cpp:198:17: required from here
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::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >, remove_edge_names<boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >*, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char>&, boost::vertex_name_t>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >, boost::keep_all>; F = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; Rcpp::List = Rcpp::Vector<19>]’:
bh.cpp:216:17: required from here
bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable]
bh.cpp: In instantiation of ‘Rcpp::List graph2R(T&, F&) [with T = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; F = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; Rcpp::List = Rcpp::Vector<19>]’:
bh.cpp:272:17: required from here
bh.cpp:70:12: warning: variable ‘index’ set but not used [-Wunused-but-set-variable]
In file included from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/assert.hpp:35,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:19:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:31,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:20:
/home/hornik/tmp/R.check/r-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/int.hpp:20,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/lambda_fwd.hpp:23,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/aux_/na_spec.hpp:18,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/mpl/if.hpp:19,
from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_traits.hpp:17:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >::~OutputIteratorConcept()’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ComparableConcept<double>]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept<double>::~ComparableConcept()’
251 | BOOST_concept(Comparable,(TT))
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::IntegerConcept<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept<long unsigned int>::~IntegerConcept()’
70 | BOOST_concept(Integer, (T))
| ^~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = double]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:15,
from bh.cpp:5:
/home/hornik/tmp/R.check/r-release-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<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
39 | void constraints()
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<boost::default_color_type>::~ColorValueConcept()’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >)>’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
39 | void constraints()
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::components_recorder<int*>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > > >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; Key = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::ColorValueConcept<boost::default_color_type> >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/hornik/tmp/R.check/r-release-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-release-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-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double>, boost::edge_weight_t>]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
bh.cpp:256:32: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; DFSVisitor = boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; DFSVisitor = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > >]’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-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<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; P = topo_sort_visitor<std::back_insert_iterator<std::vector<int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::back_insert_iterator<std::vector<int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-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<P, T, R>&) [with VertexListGraph = adjacency_list<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >; P = int; T = buffer_param_t; R = no_property]’
/home/hornik/tmp/R.check/r-release-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<vecS, vecS, directedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_index_t, int, property<edge_weight_t, double> > >; OutputIterator = std::back_insert_iterator<std::vector<int> >]’
bh.cpp:280:19: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_index_t, int, boost::property<boost::edge_weight_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >’
/home/hornik/tmp/R.check/r-release-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-release-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<Graph>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_name_t, std::__cxx11::basic_string<char> > >, boost::property<boost::edge_weight_t, double> >; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_name_t, std::__cxx11::basic_string<char> > >, property<edge_weight_t, double> >; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
bh.cpp:146:23: required from here
/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/Packages/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -I"/home/hornik/tmp/R.check/r-release-gcc/Work/build/include" -DNDEBUG -I../inst/include -I'/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/Rcpp/include' -I'/home/hornik/tmp/R.check/r-release-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++-13 -std=gnu++17 -shared -L/home/hornik/tmp/R.check/r-release-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-release-gcc/Work/build/lib -lR
make[1]: Leaving directory '/tmp/Rtmpmdnizr/R.INSTALLddb2cd79dde0/bnclassify/src'
make[1]: Entering directory '/tmp/Rtmpmdnizr/R.INSTALLddb2cd79dde0/bnclassify/src'
make[1]: Leaving directory '/tmp/Rtmpmdnizr/R.INSTALLddb2cd79dde0/bnclassify/src'
installing to /home/hornik/tmp/R.check/r-release-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)