* installing to library ‘/home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages’ * installing *source* package ‘GiRaF’ ... ** package ‘GiRaF’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-14 (Debian 14.2.0-8) 14.2.0’ using C++11 make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpvDFPhJ/R.INSTALL37b1142525806c/GiRaF/src' g++-14 -std=gnu++11 -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/RcppArmadillo/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 lattice.cpp -o lattice.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 ../inst/include/GiRaF.hpp:17, from lattice.cpp:1: /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 ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/armadillo:38, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:58, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo.h:29, from ../inst/include/GiRaF.hpp:10: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:17, 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:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr<Y> & r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr<Y> && r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ g++-14 -std=gnu++11 -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/RcppArmadillo/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 rcpp_module.cpp -o rcpp_module.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 ../inst/include/GiRaF.hpp:17, from rcpp_module.cpp:1: /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 ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/armadillo:38, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:58, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo.h:29, from ../inst/include/GiRaF.hpp:10: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:17, 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:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr<Y> & r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr<Y> && r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ g++-14 -std=gnu++11 -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/RcppArmadillo/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 recursion.cpp -o recursion.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 ../inst/include/GiRaF.hpp:17, from recursion.cpp:1: /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 ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/armadillo:38, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:58, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo.h:29, from ../inst/include/GiRaF.hpp:10: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:17, 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:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr<Y> & r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr<Y> && r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ g++-14 -std=gnu++11 -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/RcppArmadillo/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 sampler.cpp -o sampler.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 ../inst/include/GiRaF.hpp:17, from sampler.cpp:1: /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 ) noexcept : px( p.release() ) | ^~~~~~~~ In file included from /usr/include/c++/14/memory:78, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/armadillo:38, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo/interface/RcppArmadilloForward.h:58, from /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/RcppArmadillo/include/RcppArmadillo.h:29, from ../inst/include/GiRaF.hpp:10: /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:17, 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:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn() | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 423 | shared_ptr & operator=( std::auto_ptr<Y> & r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 430 | shared_ptr & operator=( std::auto_ptr<Y> && r ) | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | 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:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations] 432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this ); | ^~~~~~~~ /usr/include/c++/14/bits/unique_ptr.h:59:28: note: declared here 59 | template<typename> class auto_ptr; | ^~~~~~~~ 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::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’: /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’: /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >::~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::BFSVisitorConcept<Visitor_cc, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 ../inst/include/GiRaF.hpp:19: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_cc; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 37 | 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::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<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::BFSVisitorConcept<Visitor_color, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_color; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:345:27: required from here 345 | breadth_first_search(g_SW, *it_s, visitor(vis_color)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_color; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 37 | 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::BFSVisitorConcept<Visitor_cc_cond, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc_cond; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:400:27: required from here 400 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_cc_cond; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 37 | 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::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’ 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:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’: /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’ 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:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 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::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<Visitor_cc> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_cc>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_cc>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_cc>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_cc> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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<Visitor_cc> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_cc>]’ 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<Visitor_cc>]’: /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::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_cc; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::BFSVisitorConcept<Visitor_cc, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::BFSVisitorConcept<Visitor_cc, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::BFSVisitorConcept<Visitor_cc, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_cc>::~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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<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::read_write_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::read_write_property_map_tag, boost::read_write_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::read_write_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::read_write_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::read_write_property_map_tag, boost::read_write_property_map_tag> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::read_write_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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::CopyConstructible<Visitor_color> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_color>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_color>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_color>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_color> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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<Visitor_color> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_color; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:345:27: required from here 345 | breadth_first_search(g_SW, *it_s, visitor(vis_color)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_color>]’ 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<Visitor_color>]’: /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::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_color; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::BFSVisitorConcept<Visitor_color, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::BFSVisitorConcept<Visitor_color, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::BFSVisitorConcept<Visitor_color, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_color; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:345:27: required from here 345 | breadth_first_search(g_SW, *it_s, visitor(vis_color)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_color>::~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::CopyConstructible<Visitor_cc_cond> >]’: /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_cc_cond>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_cc_cond>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_cc_cond>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_cc_cond> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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<Visitor_cc_cond> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc_cond; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:400:27: required from here 400 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_cc_cond>]’ 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<Visitor_cc_cond>]’: /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::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = Visitor_cc_cond; Graph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::BFSVisitorConcept<Visitor_cc_cond, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::BFSVisitorConcept<Visitor_cc_cond, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::BFSVisitorConcept<Visitor_cc_cond, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >’ 45 | typedef boost::integral_constant<bool, value> 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc_cond; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:400:27: required from here 400 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<Visitor_cc_cond>::~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::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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> >)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:90: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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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> >)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:91: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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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> >)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:92: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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<Visitor_cc>]’: /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<Visitor_cc> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_cc>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_cc>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_cc>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_cc> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = Visitor_cc]’ 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/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::read_write_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::read_write_property_map_tag, boost::readable_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::readable_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::readable_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::readable_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::read_write_property_map_tag, boost::readable_property_map_tag> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::read_write_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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:206:7: [ 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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/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::read_write_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::read_write_property_map_tag, boost::writable_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::writable_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::writable_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::writable_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::read_write_property_map_tag, boost::writable_property_map_tag> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::read_write_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 = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; Key = long unsigned int]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >, long unsigned int>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/property_map/property_map.hpp:207:7: [ 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_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::read_write_property_map_tag, boost::read_write_property_map_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::read_write_property_map_tag, boost::read_write_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::read_write_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::read_write_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::CopyConstructible<Visitor_color>]’: /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<Visitor_color> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_color>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_color>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_color>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_color> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_color; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_color; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_color; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:345:27: required from here 345 | breadth_first_search(g_SW, *it_s, visitor(vis_color)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = Visitor_color]’ 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::CopyConstructible<Visitor_cc_cond>]’: /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<Visitor_cc_cond> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<Visitor_cc_cond>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<Visitor_cc_cond>’ 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /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<Visitor_cc_cond>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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<Visitor_cc_cond> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc_cond; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc_cond; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc_cond; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:400:27: required from here 400 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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 = Visitor_cc_cond]’ 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/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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’ 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:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’ 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:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> > >]’ 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:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/graph_concepts.hpp:75:1: [ 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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’ 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:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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> >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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> >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::read_write_property_map_tag, boost::readable_property_map_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::read_write_property_map_tag, boost::readable_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::readable_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::readable_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::readable_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_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::read_write_property_map_tag, boost::writable_property_map_tag> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::read_write_property_map_tag, boost::writable_property_map_tag>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::read_write_property_map_tag, boost::writable_property_map_tag>’ 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~ /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::read_write_property_map_tag, boost::writable_property_map_tag>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::read_write_property_map_tag, boost::writable_property_map_tag> >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::read_write_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::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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 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:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >]’ 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /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::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; SourceIterator = long unsigned int*]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 502 | BOOST_concept(InputIterator,(TT)) | ^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >::value’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > > >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_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::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 = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 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:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 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:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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<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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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>)>’ 72 | struct requirement_<void(*)(Model)> | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 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:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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::iterators::filter_iterator<boost::detail::out_edge_predicate<SW_filter, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter> >, boost::detail::out_edge_iter<std::_List_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_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’ 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:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>]’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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::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> >]’ 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /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>’ 92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \ | ^ /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>]’ 32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0); | ^ /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’ 44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) ); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~ /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> >’ 45 | typedef boost::integral_constant<bool, value> type; | ^~~~ /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/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >]’ 136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = Visitor_cc; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 147 | breadth_first_search(g, sources, sources + 1, Q, vis, color); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, long unsigned int> >; BFSVisitor = Visitor_cc; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’ 262 | breadth_first_search(g, s, | ~~~~~~~~~~~~~~~~~~~~^~~~~~ 263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q)) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 264 | .get(), | ~~~~~~~ 265 | vis, color); | ~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = boost::filtered_graph<boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_color_t, unsigned int, boost::property<boost::vertex_potential_t, arma::Col<double>, boost::property<boost::vertex_degree_t, unsigned int, boost::property<boost::vertex_update_t, double, boost::property<boost::vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_weight2_t, unsigned int, boost::property<boost::edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 309 | bfs_helper(g, s, | ~~~~~~~~~~^~~~~~ 310 | make_two_bit_color_map(num_vertices(g), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 311 | choose_const_pmap( | ~~~~~~~~~~~~~~~~~~ 312 | get_param(params, vertex_index), g, vertex_index)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 313 | choose_param(get_param(params, graph_visitor), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 314 | make_bfs_visitor(null_vis)), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 315 | params, | ~~~~~~~ 316 | boost::mpl::bool_< | ~~~~~~~~~~~~~~~~~~ 317 | boost::is_base_and_derived< distributed_graph_tag, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 318 | typename graph_traits< | ~~~~~~~~~~~~~~~~~~~~~~ 319 | VertexListGraph >::traversal_category >::value >()); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = filtered_graph<adjacency_list<listS, vecS, undirectedS, property<vertex_color_t, unsigned int, property<vertex_potential_t, arma::Col<double>, property<vertex_degree_t, unsigned int, property<vertex_update_t, double, property<vertex_underlying_t, std::vector<int, std::allocator<int> > > > > > >, property<edge_weight_t, double, property<edge_weight2_t, unsigned int, property<edge_update_t, double> > > >, SW_filter>; P = Visitor_cc; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’ 339 | detail::bfs_dispatch< C >::apply( | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^ 340 | ng, s, params, get_param(params, vertex_color)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ sampler.cpp:339:27: required from here 339 | breadth_first_search(g_SW, *it_s, visitor(vis_cc)); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /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) { | ^~~~~~~~~~~~~~~~~~~ g++-14 -std=gnu++11 -shared -L/home/hornik/tmp/R.check/r-release-gcc/Work/build/lib -Wl,-O1 -o GiRaF.so lattice.o rcpp_module.o recursion.o sampler.o -L/home/hornik/tmp/R.check/r-release-gcc/Work/build/lib -lR make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpvDFPhJ/R.INSTALL37b1142525806c/GiRaF/src' make[1]: Entering directory '/home/hornik/tmp/scratch/RtmpvDFPhJ/R.INSTALL37b1142525806c/GiRaF/src' make[1]: Leaving directory '/home/hornik/tmp/scratch/RtmpvDFPhJ/R.INSTALL37b1142525806c/GiRaF/src' installing to /home/hornik/tmp/R.check/r-release-gcc/Work/build/Packages/00LOCK-GiRaF/00new/GiRaF/libs ** R ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices ** 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 (GiRaF)