* installing *source* package ‘svines’ ... ** package ‘svines’ successfully unpacked and MD5 sums checked ** using staged installation ** libs using C++ compiler: ‘g++-13 (GCC) 13.2.0’ make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/svines/src' g++-13 -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I../inst/include -pthread -I'/data/gannet/ripley/R/test-dev/RcppEigen/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/RcppThread/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/wdm/include' -I'/data/gannet/ripley/R/test-dev/rvinecopulib/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c RcppExports.cpp -o RcppExports.o g++-13 -std=gnu++17 -I"/data/gannet/ripley/R/R-devel/include" -DNDEBUG -I../inst/include -pthread -I'/data/gannet/ripley/R/test-dev/RcppEigen/include' -I'/data/gannet/ripley/R/test-dev/Rcpp/include' -I'/data/gannet/ripley/R/test-dev/RcppThread/include' -I'/data/gannet/ripley/R/test-dev/BH/include' -I'/data/gannet/ripley/R/test-dev/wdm/include' -I'/data/gannet/ripley/R/test-dev/rvinecopulib/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wno-ignored-attributes -Wno-parentheses -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -c wrappers_svine.cpp -o wrappers_svine.o In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/traits.hpp:21, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/storage.hpp:27, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/vector.hpp:21, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/ublas_wrapper.hpp:23, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint.hpp:25, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/misc/tools_integration.hpp:20, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/bb6.ipp:8, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/bb6.hpp:46, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/abstract.ipp:10, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/abstract.hpp:114, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/class.ipp:8, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/class.hpp:161, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/class.ipp:7, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/class.hpp:196, from ../inst/include/svines/svine_selector.hpp:3, from ../inst/include/svines/svinecop.hpp:3, from ../inst/include/svines.hpp:3, from wrappers_svine.cpp:15: /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/detail/iterator.hpp:111:21: warning: 'template<class _Category, class _Tp, class _Distance, class _Pointer, class _Reference> struct std::iterator' is deprecated [-Wdeprecated-declarations] 111 | public std::iterator<IC, T> { | ^~~~~~~~ In file included from /usr/local/gcc13/include/c++/13.2.0/bits/stl_algobase.h:65, from /usr/local/gcc13/include/c++/13.2.0/bits/specfun.h:43, from /usr/local/gcc13/include/c++/13.2.0/cmath:3699, from /data/gannet/ripley/R/test-dev/Rcpp/include/Rcpp/platform/compiler.h:100, from /data/gannet/ripley/R/test-dev/Rcpp/include/Rcpp/r/headers.h:62, from /data/gannet/ripley/R/test-dev/Rcpp/include/RcppCommon.h:30, from /data/gannet/ripley/R/test-dev/Rcpp/include/Rcpp.h:27, from wrappers_svine.cpp:14: /usr/local/gcc13/include/c++/13.2.0/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/detail/iterator.hpp:149:21: warning: 'template<class _Category, class _Tp, class _Distance, class _Pointer, class _Reference> struct std::iterator' is deprecated [-Wdeprecated-declarations] 149 | public std::iterator<IC, T> { | ^~~~~~~~ /usr/local/gcc13/include/c++/13.2.0/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/ublas/detail/iterator.hpp:204:21: warning: 'template<class _Category, class _Tp, class _Distance, class _Pointer, class _Reference> struct std::iterator' is deprecated [-Wdeprecated-declarations] 204 | public std::iterator<IC, T> { | ^~~~~~~~ /usr/local/gcc13/include/c++/13.2.0/bits/stl_iterator_base_types.h:127:34: note: declared here 127 | struct _GLIBCXX17_DEPRECATED iterator | ^~~~~~~~ In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:19, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint.hpp:54: /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/detail/adaptive_adams_coefficients.hpp:189:6: warning: extra ';' [-Wpedantic] 189 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:93:6: warning: extra ';' [-Wpedantic] 93 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:99:6: warning: extra ';' [-Wpedantic] 99 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:108:6: warning: extra ';' [-Wpedantic] 108 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:123:6: warning: extra ';' [-Wpedantic] 123 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:151:6: warning: extra ';' [-Wpedantic] 151 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:164:6: warning: extra ';' [-Wpedantic] 164 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:197:6: warning: extra ';' [-Wpedantic] 197 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:210:6: warning: extra ';' [-Wpedantic] 210 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:215:6: warning: extra ';' [-Wpedantic] 215 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/adaptive_adams_bashforth_moulton.hpp:220:6: warning: extra ';' [-Wpedantic] 220 | }; | ^ | - In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:22, from /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint.hpp:55: /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/detail/pid_step_adjuster.hpp:72:6: warning: extra ';' [-Wpedantic] 72 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/detail/pid_step_adjuster.hpp:82:6: warning: extra ';' [-Wpedantic] 82 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/detail/pid_step_adjuster.hpp:100:6: warning: extra ';' [-Wpedantic] 100 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:167:6: warning: extra ';' [-Wpedantic] 167 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:173:6: warning: extra ';' [-Wpedantic] 173 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:219:6: warning: extra ';' [-Wpedantic] 219 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:277:6: warning: extra ';' [-Wpedantic] 277 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:286:6: warning: extra ';' [-Wpedantic] 286 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:297:6: warning: extra ';' [-Wpedantic] 297 | }; | ^ | - /data/gannet/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_adams_bashforth_moulton.hpp:302:6: warning: extra ';' [-Wpedantic] 302 | }; | ^ | - In file included from ../inst/include/svines/svinecop.hpp:123: ../inst/include/svines/implementation/svinecop.ipp: In lambda function: ../inst/include/svines/implementation/svinecop.ipp:354:32: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'Eigen::EigenBase<Eigen::Matrix<double, -1, -1> >::Index' {aka 'long int'} [-Wsign-compare] 354 | for (size_t p = 0; p < pars.size(); p++) { | ~~^~~~~~~~~~~~~ ../inst/include/svines/implementation/svinecop.ipp: In member function 'vinecopulib::TriangularArray<std::vector<Eigen::Matrix<double, -1, -1> > > vinecopulib::SVinecop::hessian(Eigen::MatrixXd, bool, size_t)': ../inst/include/svines/implementation/svinecop.ipp:410:28: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'Eigen::EigenBase<Eigen::Matrix<double, -1, -1> >::Index' {aka 'long int'} [-Wsign-compare] 410 | for (size_t p = 0; p < pars.size(); p++) { | ~~^~~~~~~~~~~~~ ../inst/include/svines/implementation/svinecop.ipp: In member function 'Eigen::MatrixXd vinecopulib::SVinecop::hessian_exp(const Eigen::MatrixXd&, bool, size_t)': ../inst/include/svines/implementation/svinecop.ipp:444:28: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'Eigen::EigenBase<Eigen::Matrix<double, -1, -1> >::Index' {aka 'long int'} [-Wsign-compare] 444 | for (size_t p = 0; p < pair_copulas_[t][e].get_parameters().size(); p++) { | ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35, from /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:19, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/size.hpp:21, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/functions.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/iterator_range_core.hpp:38, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/iterator_range.hpp:13, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign/list_of.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign.hpp:20, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:7, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/family.hpp:126, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/fit_controls.hpp:11, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/fit_controls.hpp:10, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/class.hpp:10: /data/gannet/ripley/R/test-dev/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<vinecopulib::BicopFamily> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from 'struct boost::AssignableConcept<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/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::AssignableConcept<vinecopulib::BicopFamily>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<vinecopulib::BicopFamily> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<vinecopulib::BicopFamily> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::AssignableConcept<vinecopulib::BicopFamily>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/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 /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31: /data/gannet/ripley/R/test-dev/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<vinecopulib::BicopFamily>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<vinecopulib::BicopFamily>]': /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/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 /data/gannet/ripley/R/test-dev/BH/include/boost/range/detail/extract_optional_type.hpp:18, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/mutable_iterator.hpp:21, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/iterator.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/range/begin.hpp:20, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign/list_inserter.hpp:22, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign/std/vector.hpp:18, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign/std.hpp:18, from /data/gannet/ripley/R/test-dev/BH/include/boost/assign.hpp:19: /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<vinecopulib::BicopFamily>::~AssignableConcept()' 143 | BOOST_concept(Assignable,(TT)) | ^~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept' 143 | BOOST_concept(Assignable,(TT)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from 'struct boost::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from 'struct boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/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::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>]': /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>::~BinaryFunctionConcept()' 349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second)) | ^~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept' 349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::__cxx11::basic_string<char> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from 'struct boost::AssignableConcept<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/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::AssignableConcept<std::__cxx11::basic_string<char> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::AssignableConcept<std::__cxx11::basic_string<char> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::AssignableConcept<std::__cxx11::basic_string<char> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::AssignableConcept<std::__cxx11::basic_string<char> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::__cxx11::basic_string<char> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::AssignableConcept<std::__cxx11::basic_string<char> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:17: note: in a call to non-static member function 'boost::AssignableConcept<std::__cxx11::basic_string<char> >::~AssignableConcept()' 143 | BOOST_concept(Assignable,(TT)) | ^~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: note: in expansion of macro 'BOOST_concept' 143 | BOOST_concept(Assignable,(TT)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from 'struct boost::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from 'struct boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/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::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:17: note: in a call to non-static member function 'boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >::~BinaryFunctionConcept()' 349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second)) | ^~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: note: in expansion of macro 'BOOST_concept' 349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<vinecopulib::BicopFamily>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::BicopFamily> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from 'struct boost::AssignableConcept<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/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::AssignableConcept<vinecopulib::BicopFamily>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::AssignableConcept<vinecopulib::BicopFamily>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = vinecopulib::BicopFamily]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>]': /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from 'struct boost::BinaryFunction<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from 'struct boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/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::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BinaryFunctionConcept<std::less<vinecopulib::BicopFamily>, bool, vinecopulib::BicopFamily, vinecopulib::BicopFamily>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<vinecopulib::BicopFamily, std::less<vinecopulib::BicopFamily> >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<vinecopulib::BicopFamily>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<vinecopulib::BicopFamily>; Return = bool; First = vinecopulib::BicopFamily; Second = vinecopulib::BicopFamily]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 351 | BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); } | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::__cxx11::basic_string<char> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::__cxx11::basic_string<char> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from 'struct boost::AssignableConcept<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/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::AssignableConcept<std::__cxx11::basic_string<char> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::AssignableConcept<std::__cxx11::basic_string<char> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = std::__cxx11::basic_string<char>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >]': /data/gannet/ripley/R/test-dev/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::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from 'struct boost::BinaryFunction<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from 'struct boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/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::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BinaryFunctionConcept<std::less<std::__cxx11::basic_string<char> >, bool, std::__cxx11::basic_string<char>, std::__cxx11::basic_string<char> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from 'struct boost::bimaps::set_of<std::__cxx11::basic_string<char>, std::less<std::__cxx11::basic_string<char> > >::lazy_concept_checked' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from 'struct boost::bimaps::detail::manage_bimap_key<std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from 'class boost::bimaps::detail::bimap_core<vinecopulib::BicopFamily, std::__cxx11::basic_string<char>, mpl_::na, mpl_::na, mpl_::na>' /data/gannet/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from 'class boost::bimaps::bimap<vinecopulib::BicopFamily, std::__cxx11::basic_string<char> >' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/bicop/implementation/family.ipp:13:20: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<std::__cxx11::basic_string<char> >; Return = bool; First = std::__cxx11::basic_string<char>; Second = std::__cxx11::basic_string<char>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 351 | BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); } | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >::~RandomAccessIteratorConcept()' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ In file included from /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/beta.hpp:1721, from /data/gannet/ripley/R/test-dev/BH/include/boost/math/distributions/beta.hpp:29, from /data/gannet/ripley/R/test-dev/BH/include/boost/math/distributions.hpp:17, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/misc/tools_stats.hpp:9, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/rvine_structure.ipp:8, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/rvine_structure.hpp:186, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/class.hpp:11: /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/ibeta_inverse.hpp: In instantiation of 'boost::math::detail::temme_root_finder<T>::temme_root_finder(T, T) [with T = double]': /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/ibeta_inverse.hpp:304:7: required from 'T boost::math::detail::temme_method_2_ibeta_inverse(T, T, T, T, T, const Policy&) [with T = double; Policy = boost::math::policies::policy<boost::math::policies::promote_float<false>, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy>]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/ibeta_inverse.hpp:615:48: required from 'T boost::math::detail::ibeta_inv_imp(T, T, T, T, const Policy&, T*) [with T = double; Policy = boost::math::policies::policy<boost::math::policies::promote_float<false>, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy>]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/ibeta_inverse.hpp:992:30: required from 'boost::math::tools::promote_args_t<T1, T2, T3, T4> boost::math::ibeta_inv(T1, T2, T3, T4*, const Policy&) [with T1 = double; T2 = double; T3 = double; T4 = double; Policy = policies::policy<policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy>; tools::promote_args_t<T1, T2, T3, T4> = double]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/t_distribution_inv.hpp:439:17: required from 'T boost::math::detail::fast_students_t_quantile_imp(T, T, const Policy&, const std::false_type*) [with T = double; Policy = boost::math::policies::policy<boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy>; std::false_type = std::integral_constant<bool, false>]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/t_distribution_inv.hpp:458:63: required from 'T boost::math::detail::fast_students_t_quantile_imp(T, T, const Policy&, const std::true_type*) [with T = double; Policy = boost::math::policies::policy<boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy>; std::true_type = std::integral_constant<bool, true>]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/t_distribution_inv.hpp:541:94: required from 'T boost::math::detail::fast_students_t_quantile(T, T, const Policy&) [with T = double; Policy = boost::math::policies::policy<boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy, boost::math::policies::default_policy>]' /data/gannet/ripley/R/test-dev/BH/include/boost/math/distributions/students_t.hpp:262:56: required from 'RealType boost::math::quantile(const students_t_distribution<RealType, Policy>&, const RealType&) [with RealType = double; Policy = policies::policy<policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy, policies::default_policy>]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/misc/tools_stats.hpp:93:60: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/math/special_functions/detail/ibeta_inverse.hpp:29:15: warning: unused variable 'x_extrema' [-Wunused-variable] 29 | const T x_extrema = 1 / (1 + a); | ^~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:603:11: required from 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:514:9: required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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> {}; | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11: required from 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11: required from 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double> >; Value = double; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function 'boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >::~IncidenceGraphConcept()' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro 'BOOST_concept' 75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G > | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]': /data/gannet/ripley/R/test-dev/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 = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/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 /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21, from /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:10, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/tools_select.hpp:207, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/class.ipp:12: /data/gannet/ripley/R/test-dev/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 = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' 37 | void constraints() | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]': /data/gannet/ripley/R/test-dev/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 = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/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 /data/gannet/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27, from /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/tools_select.hpp:9: /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' 205 | void constraints() { | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 66 | BOOST_CONCEPT_USAGE(Graph) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 87 | BOOST_CONCEPT_USAGE(IncidenceGraph) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from 'void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/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<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function 'boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >::~CopyConstructibleConcept()' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro 'BOOST_concept' 165 | BOOST_concept(CopyConstructible,(TT)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >::value' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' 147 | void constraints() { | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >::value' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:65:52: warning: 'this' pointer is null [-Wnonnull] 65 | static void failed() { ((Model*)0)->constraints(); } | ~~~~~~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' 179 | void constraints() { | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/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>' /data/gannet/ripley/R/test-dev/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>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >::value' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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)) | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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<long unsigned int*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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<long unsigned int*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]': /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:354:5: required from 'boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from 'static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from 'static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function 'boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro 'BOOST_concept' 597 | BOOST_concept(RandomAccessIterator,(TT)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/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( | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/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> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/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> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/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> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> >' /data/gannet/ripley/R/test-dev/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>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from 'void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from 'struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from 'struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 167 | BOOST_CONCEPT_USAGE(CopyConstructible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >::value' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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)) | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >; Key = long unsigned int]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>]' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >::value' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int> >' /data/gannet/ripley/R/test-dev/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<vinecopulib::tools_select::VertexProperties, long unsigned int> >, long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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)) | ^~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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 | ^ /data/gannet/ripley/R/test-dev/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) \ | ^~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro 'BOOST_concept' 206 | BOOST_concept(Convertible,(X)(Y)) | ^~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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>' /data/gannet/ripley/R/test-dev/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>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]': /data/gannet/ripley/R/test-dev/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*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]': /data/gannet/ripley/R/test-dev/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*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]': /data/gannet/ripley/R/test-dev/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<long unsigned int*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from 'struct boost::ForwardIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 543 | BOOST_CONCEPT_USAGE(ForwardIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from 'struct boost::BidirectionalIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 571 | BOOST_CONCEPT_USAGE(BidirectionalIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from 'struct boost::Comparable<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 253 | BOOST_CONCEPT_USAGE(Comparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from 'struct boost::RandomAccessIterator<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from 'struct boost::RandomAccessIteratorConcept<long unsigned int*>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 601 | BOOST_CONCEPT_USAGE(RandomAccessIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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(); } | ^ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9: required from 'boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: required from 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from 'struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from 'struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/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( | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/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> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/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> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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> >]': /data/gannet/ripley/R/test-dev/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> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >' /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/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> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/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>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:206:3: required from 'struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/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' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from 'struct boost::DefaultConstructible<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 137 | BOOST_CONCEPT_USAGE(DefaultConstructible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]': /data/gannet/ripley/R/test-dev/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> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<long unsigned int>' /data/gannet/ripley/R/test-dev/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>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/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() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from 'void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int> >; SourceIterator = long unsigned int*]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from 'struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 145 | BOOST_CONCEPT_USAGE(Assignable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from 'struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 233 | BOOST_CONCEPT_USAGE(EqualityComparable) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from 'struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 512 | BOOST_CONCEPT_USAGE(InputIterator) | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from 'struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>)>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]' 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp: In instantiation of 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: required from 'boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: required from 'boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > >, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: required from 'boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: warning: 'this' pointer is null [-Wnonnull] 50 | static void failed() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of 'boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]': /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:50:47: required from 'static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from 'struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of 'template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from 'const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >::value' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from 'struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >' /data/gannet/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from 'void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double> >, boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from 'void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<vinecopulib::tools_select::VertexProperties, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from 'void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from 'void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, vinecopulib::tools_select::VertexProperties, boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, vinecopulib::tools_select::EdgeProperties>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]' /data/gannet/ripley/R/test-dev/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from 'void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, vinecopulib::tools_select::VertexProperties, property<edge_weight_t, double, vinecopulib::tools_select::EdgeProperties> >; PredecessorMap = long unsigned int*]' /data/gannet/ripley/R/test-dev/rvinecopulib/include/vinecopulib/vinecop/implementation/tools_select.ipp:896:29: required from here /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:20:48: warning: 'this' pointer is null [-Wnonnull] 20 | ~usage_requirements() { ((Model*)0)->~Model(); } | ~~~~~~~~~~~~~~~~~~~^~ /data/gannet/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function 'boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]' 37 | ~model() | ^ /data/gannet/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro 'BOOST_CONCEPT_USAGE' 208 | BOOST_CONCEPT_USAGE(Convertible) { | ^~~~~~~~~~~~~~~~~~~ g++-13 -std=gnu++17 -shared -L/usr/local/gcc13/lib64 -L/usr/local/lib64 -L/usr/local/clang18/lib/x86_64-unknown-linux-gnu -o svines.so RcppExports.o wrappers_svine.o -latomic -lpthread make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/svines/src' make[1]: Entering directory '/data/gannet/ripley/R/packages/tests-devel/svines/src' make[1]: Leaving directory '/data/gannet/ripley/R/packages/tests-devel/svines/src' installing to /data/gannet/ripley/R/packages/tests-devel/svines.Rcheck/00LOCK-svines/00new/svines/libs ** R ** data *** moving datasets to lazyload DB ** inst ** byte-compile and prepare package for lazy loading ** help *** installing help indices *** copying figures ** building package indices ** 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 (svines)