* installing *source* package ‘dgraphs’ ...
** this is package ‘dgraphs’ version ‘0.4.1’
** package ‘dgraphs’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
specified C++17
using C compiler: ‘gcc (GCC) 16.2.1 20261029 (Red Hat 16.2.1-3)’
using C++ compiler: ‘g++ (GCC) 16.2.1 20261029 (Red Hat 16.2.1-3)’
using C++17
make[1]: Entering directory '/data/localhost/ripley/R/packages/tests-devel/dgraphs/src'
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 fermat_implicit.cpp -o fermat_implicit.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 fermat_knn.cpp -o fermat_knn.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 linf_simplex.cpp -o linf_simplex.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 -ffp-contract=off -fno-fast-math -c quadform_geodesics_solver.cpp -o quadform_geodesics_solver.o
quadform_geodesics_solver.cpp: In member function ‘bool qgn::Solver::sample(const qgn::Point&, double, qgn::Path&)’:
quadform_geodesics_solver.cpp:333:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
333 | for (const auto& v : unique) candidates.push_back(v.second); return true;
| ^~~
quadform_geodesics_solver.cpp:333:66: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
333 | for (const auto& v : unique) candidates.push_back(v.second); return true;
| ^~~~~~
quadform_geodesics_solver.cpp: In member function ‘qgn::IndexPath qgn::Solver::shortest(const qgn::EdgeTable&, const qgn::Batch&, int, int)’:
quadform_geodesics_solver.cpp:345:7: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
345 | if (u == n) break; if (u == static_cast<size_t>(to)) return paths[u]; done[u] = true;
| ^~
quadform_geodesics_solver.cpp:345:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
345 | if (u == n) break; if (u == static_cast<size_t>(to)) return paths[u]; done[u] = true;
| ^~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 -ffp-contract=off -fno-fast-math -c quadform_geodesics_solver_rcpp.cpp -o quadform_geodesics_solver_rcpp.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_methods.cpp -o quadform_geodesics_methods.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_continuous.cpp -o quadform_geodesics_continuous.o
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/fusion/functional/invocation/detail/that_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/fusion/functional/invocation/invoke.hpp:52,
from /data/localhost/ripley/R/test-dev/BH/include/boost/fusion/functional/adapter/fused.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/fusion/functional/generation/make_fused.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/fusion/include/make_fused.hpp:11,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/resize.hpp:30,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/state_wrapper.hpp:26,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/ublas_wrapper.hpp:33,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint.hpp:25,
from quadform_geodesics_continuous.cpp:3:
/data/localhost/ripley/R/test-dev/BH/include/boost/get_pointer.hpp:48:40: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
48 | template<class T> T * get_pointer(std::auto_ptr<T> const& p)
| ^~~~~~~~
In file included from /usr/include/c++/16/memory:80,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/ublas/fwd.hpp:18,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/ublas/detail/config.hpp:299,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/ublas/exception.hpp:19,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/ublas/storage.hpp:26,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/ublas/vector.hpp:21,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/ublas_wrapper.hpp:23:
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
quadform_geodesics_continuous.cpp: In lambda function:
quadform_geodesics_continuous.cpp:207:11: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
207 | for(int k=0;k<4;++k)v[k]=s[k];auto f=g.rhs(v,lambda,nullptr,budget);
| ^~~
quadform_geodesics_continuous.cpp:207:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
207 | for(int k=0;k<4;++k)v[k]=s[k];auto f=g.rhs(v,lambda,nullptr,budget);
| ^~~~
quadform_geodesics_continuous.cpp: In function ‘void qgc::polygon(const std::array<double, 4>&, const qgn::Domain&, const Bezier&, double, int, Budget&, qgn::Path&, double&)’:
quadform_geodesics_continuous.cpp:264:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
264 | if(!edge.ok)throw Unresolved{"length_evaluation_failed"};fine+=edge.length;
| ^~
quadform_geodesics_continuous.cpp:264:62: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
264 | if(!edge.ok)throw Unresolved{"length_evaluation_failed"};fine+=edge.length;
| ^~~~
quadform_geodesics_continuous.cpp: In function ‘qgm::Result qgc::publish(const std::array<double, 4>&, const Geometry&, Curve, qgn::Point, qgn::Point, Budget&)’:
quadform_geodesics_continuous.cpp:292:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
292 | if(i==1)q[0]=from;if(i+1==curve.y.size())q[3]=to;
| ^~
quadform_geodesics_continuous.cpp:292:23: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
292 | if(i==1)q[0]=from;if(i+1==curve.y.size())q[3]=to;
| ^~
In file included from /data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/SparseLU:35,
from /data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/Sparse:29,
from /data/localhost/ripley/R/test-dev/RcppEigen/include/RcppEigenForward.h:29,
from /data/localhost/ripley/R/test-dev/RcppEigen/include/RcppEigen.h:25,
from quadform_geodesics_continuous.cpp:2:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h: In instantiation of ‘void Eigen::internal::SparseLUImpl<Scalar, StorageIndex>::heap_relax_snode(Eigen::Index, IndexVector&, Eigen::Index, IndexVector&, IndexVector&) [with Scalar = double; StorageIndex = int; Eigen::Index = long int; IndexVector = Eigen::Matrix<int, -1, 1>]’:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:669:27: required from ‘void Eigen::SparseLU<_MatrixType, _OrderingType>::factorize(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]’
669 | Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/SparseLU/SparseLU.h:187:7: required from ‘void Eigen::SparseLU<_MatrixType, _OrderingType>::compute(const MatrixType&) [with _MatrixType = Eigen::SparseMatrix<double, 0, int>; _OrderingType = Eigen::COLAMDOrdering<int>; MatrixType = Eigen::SparseMatrix<double, 0, int>]’
187 | factorize(matrix);
| ^~~~~~~~~
quadform_geodesics_continuous.cpp:156:29: required from here
156 | budget.poll();lu.compute(jac);if(lu.info()!=Eigen::Success)return false;
| ~~~~~~~~~~^~~~~
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h:78:9: warning: variable ‘nsuper_et_post’ set but not used [-Wunused-but-set-variable=]
78 | Index nsuper_et_post = 0; // Number of relaxed snodes in postordered etree
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h:79:9: warning: variable ‘nsuper_et’ set but not used [-Wunused-but-set-variable=]
79 | Index nsuper_et = 0; // Number of relaxed snodes in the original etree
| ^~~~~~~~~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_boundary.cpp -o quadform_geodesics_boundary.o
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
from /data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:19,
from /data/localhost/ripley/R/test-dev/BH/include/boost/range/size_type.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:21,
from /data/localhost/ripley/R/test-dev/BH/include/boost/range/functions.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/range.hpp:18,
from /data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/resize.hpp:24:
/data/localhost/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<const double*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const double*>’
127 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31:
/data/localhost/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<const double*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:106:7: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/iterator/iterator_concepts.hpp:106:7: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
37 | ~model()
| ^
/data/localhost/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/localhost/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::range_detail::IncrementableIteratorConcept<const double*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::range_detail::IncrementableIteratorConcept<const double*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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<const double*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<const double*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:154:13: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:154:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<const double*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
37 | ~model()
| ^
/data/localhost/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/localhost/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::range_detail::SinglePassIteratorConcept<const double*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::range_detail::SinglePassIteratorConcept<const double*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9: required from ‘struct boost::SinglePassRangeConcept<const std::array<double, 12> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::array<double, 12> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = const double*]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
160 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: required from ‘struct boost::SinglePassRangeConcept<const std::array<double, 12> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::array<double, 12> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::SinglePassRangeConcept<const std::array<double, 12> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘OutputIterator boost::range::copy(const SinglePassRange&, OutputIterator) [with SinglePassRange = std::array<double, 12>; OutputIterator = double*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:38:27: required from ‘void boost::numeric::odeint::detail::do_copying(const Container1&, Container2&, std::integral_constant<bool, true>) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
38 | boost::range::copy( from , boost::begin( to ) );
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:61:27: required from ‘static void boost::numeric::odeint::copy_impl_sfinae<Container1, Container2, Enabler>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>; Enabler = void]’
61 | detail::do_copying( from , to , is_range_type() );
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::array<double, 12>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
286 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 4> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: required from ‘struct boost::SinglePassRangeConcept<const std::array<double, 4> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 4> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 4> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 4> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const std::array<double, 4> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/equal.hpp:174:13: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; DerivInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:215:27: required from here
215 | stepper.try_step(system,y,t,dt);++budget.steps;}
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::SinglePassRangeConcept<const std::array<double, 4> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 4> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/algorithm/equal.hpp:174:13: required from ‘OutputIterator boost::range::copy(const SinglePassRange&, OutputIterator) [with SinglePassRange = std::array<double, 4>; OutputIterator = double*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:38:27: required from ‘void boost::numeric::odeint::detail::do_copying(const Container1&, Container2&, std::integral_constant<bool, true>) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
38 | boost::range::copy( from , boost::begin( to ) );
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:61:27: required from ‘static void boost::numeric::odeint::copy_impl_sfinae<Container1, Container2, Enabler>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>; Enabler = void]’
61 | detail::do_copying( from , to , is_range_type() );
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; DerivInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:215:27: required from here
215 | stepper.try_step(system,y,t,dt);++budget.steps;}
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::array<double, 4>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
286 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<const double*>]’:
/data/localhost/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<const double*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:127:16: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const double*>’
127 | struct IncrementableIteratorConcept : CopyConstructible<Iterator>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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 ]
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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 = const double*]’
37 | ~model()
| ^
/data/localhost/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/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’:
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::incrementable_traversal_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag; Y = boost::iterators::incrementable_traversal_tag]’
37 | ~model()
| ^
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::IncrementableIteratorConcept<const double*>]’:
/data/localhost/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::range_detail::IncrementableIteratorConcept<const double*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::IncrementableIteratorConcept<Iterator>::~IncrementableIteratorConcept() [with Iterator = const double*]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
138 | BOOST_CONCEPT_USAGE(IncrementableIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<const double*>]’:
/data/localhost/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<const double*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
149 | struct SinglePassIteratorConcept
| ^~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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 = const double*]’
37 | ~model()
| ^
/data/localhost/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/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’:
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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::random_access_traversal_tag, boost::iterators::single_pass_traversal_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/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::random_access_traversal_tag; Y = boost::iterators::single_pass_traversal_tag]’
37 | ~model()
| ^
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::range_detail::SinglePassIteratorConcept<const double*>]’:
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const double*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::range_detail::SinglePassIteratorConcept<const double*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::range_detail::SinglePassIteratorConcept<const double*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::range_detail::SinglePassIteratorConcept<Iterator>::~SinglePassIteratorConcept() [with Iterator = const double*]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
160 | BOOST_CONCEPT_USAGE(SinglePassIteratorConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::array<double, 12> >]’:
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: required from ‘struct boost::SinglePassRangeConcept<const std::array<double, 12> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 12> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 12> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 12>; Container2 = std::array<double, 12>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; DerivInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::integrate(const Geometry&, const V2&, const V2&, double, Budget&, bool, V2*, M2*, double)::<lambda(const qgc::State&, qgc::State&, double)>; StateInOut = std::array<double, 12>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 12> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:79:33: required from here
79 | auto status=stepper.try_step(system,y,t,dt);++budget.steps;
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::array<double, 12>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
286 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::SinglePassRangeConcept<const std::array<double, 4> >]’:
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 4> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: required from ‘struct boost::SinglePassRangeConcept<const std::array<double, 4> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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::SinglePassRangeConcept<const std::array<double, 4> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 4> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const std::array<double, 4> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:71:58: required from ‘static void boost::numeric::odeint::copy_impl<Container1, Container2>::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
71 | copy_impl_sfinae< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/util/copy.hpp:79:47: required from ‘void boost::numeric::odeint::copy(const Container1&, Container2&) [with Container1 = std::array<double, 4>; Container2 = std::array<double, 4>]’
79 | copy_impl< Container1 , Container2 >::copy( from , to );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:721:41: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, DerivInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; DerivInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
721 | boost::numeric::odeint::copy( m_xnew.m_v , x );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:902:24: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step_v1(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
902 | return try_step( system , x , m_dxdt.m_v , t , dt );
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/numeric/odeint/stepper/controlled_runge_kutta.hpp:619:27: required from ‘boost::numeric::odeint::controlled_step_result boost::numeric::odeint::controlled_runge_kutta<ErrorStepper, ErrorChecker, StepAdjuster, Resizer, boost::numeric::odeint::explicit_error_stepper_fsal_tag>::try_step(System, StateInOut&, time_type&, time_type&) [with System = qgc::subdivide(const Geometry&, Curve&, double, Budget&, const std::vector<bool>&, bool)::<lambda(const S&, S&, double)>; StateInOut = std::array<double, 4>; ErrorStepper = boost::numeric::odeint::runge_kutta_dopri5<std::array<double, 4> >; ErrorChecker = boost::numeric::odeint::default_error_checker<double, boost::numeric::odeint::array_algebra, boost::numeric::odeint::default_operations>; StepAdjuster = boost::numeric::odeint::default_step_adjuster<double, double>; Resizer = boost::numeric::odeint::initially_resizer; time_type = double]’
619 | return try_step_v1( system , x , t , dt );
| ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
quadform_geodesics_continuous.cpp:215:27: required from here
215 | stepper.try_step(system,y,t,dt);++budget.steps;}
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const std::array<double, 4>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
286 | BOOST_CONCEPT_USAGE(SinglePassRangeConcept)
| ^~~~~~~~~~~~~~~~~~~
quadform_geodesics_boundary.cpp: In function ‘qgm::Result qgb::solve(const std::array<double, 4>&, const qgn::Domain&, qgn::Point, qgn::Point, const Options&)’:
quadform_geodesics_boundary.cpp:125:3: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
125 | for(auto e:codes)s.best.numbers[e.first]=e.second;for(auto e:lengths)s.best.numbers[e.first]=e.second;
| ^~~
quadform_geodesics_boundary.cpp:125:53: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
125 | for(auto e:codes)s.best.numbers[e.first]=e.second;for(auto e:lengths)s.best.numbers[e.first]=e.second;
| ^~~
quadform_geodesics_boundary.cpp:133:3: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
133 | if(reversed)std::reverse(s.best.path.begin(),s.best.path.end());return s.best;
| ^~
quadform_geodesics_boundary.cpp:133:67: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
133 | if(reversed)std::reverse(s.best.path.begin(),s.best.path.end());return s.best;
| ^~~~~~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_reference.cpp -o quadform_geodesics_reference.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_mesh.cpp -o quadform_geodesics_mesh.o
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from quadform_geodesics_reference.cpp:5:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp:63:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
63 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
In file included from /usr/include/c++/16/memory:80,
from vendor/geodesic/geodesic_runtime.h:8,
from quadform_geodesics_reference.cpp:4:
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/vector_property_map.hpp:14,
from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:598,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:27:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/detail/shared_count.hpp:294:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
294 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:354:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
354 | explicit shared_ptr( std::auto_ptr<Y> & r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:365:22: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
365 | shared_ptr( std::auto_ptr<Y> && r ): px(r.get()), pn()
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:423:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
423 | shared_ptr & operator=( std::auto_ptr<Y> & r )
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:430:34: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
430 | shared_ptr & operator=( std::auto_ptr<Y> && r )
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/shared_ptr.hpp:432:38: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
432 | this_type( static_cast< std::auto_ptr<Y> && >( r ) ).swap( *this );
| ^~~~~~~~
/usr/include/c++/16/bits/unique_ptr.h:58:28: note: declared here
58 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/concept/assert.hpp:35,
from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:19:
/data/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:31,
from /data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:20:
/data/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/mpl/aux_/integral_wrapper.hpp:22,
from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/int.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/lambda_fwd.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/aux_/na_spec.hpp:18,
from /data/localhost/ripley/R/test-dev/BH/include/boost/mpl/if.hpp:19,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_traits.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:24:
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:545:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:573:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’:
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’:
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<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<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<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<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
from quadform_geodesics_reference.cpp:6:
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
37 | void constraints()
| ^~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<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<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’:
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
37 | ~model()
| ^
/data/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’:
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’:
/data/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/data/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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 ]
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long unsigned int; typename std::iterator_traits<_Iterator>::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
245 | return make_iterator_property_map(array_holder.get(), index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>]’
273 | return helper::build(g, index, array_holder);
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’:
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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<qgr::Visitor, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, boost::edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >]’
37 | ~model()
| ^
/data/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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<boost::no_property, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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<boost::no_property, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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 ]
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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 ]
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/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*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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/localhost/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> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp: In instantiation of ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’:
/data/localhost/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<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:517:12: warning: variable ‘j’ set but not used [-Wunused-but-set-variable=]
517 | TT j(i);
| ^
/data/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/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, no_property, property<edge_weight_t, double> >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, double*, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<qgr::Visitor, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<no_property, long unsigned int>, long unsigned int, long unsigned int&>, 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>, edge_weight_t>, long unsigned int*, double*, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<no_property, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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 ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/data/localhost/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/localhost/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/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/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>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:515:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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> > >, boost::property<boost::edge_weight_t, double> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double> > >, boost::property<boost::edge_weight_t, double> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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, boost::no_property, boost::property<boost::edge_weight_t, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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/localhost/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/localhost/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> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/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>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/data/localhost/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’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/data/localhost/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> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; SourceInputIter = long unsigned int*; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<G>::vertex_descriptor, 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<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; DijkstraVisitor = qgr::Visitor; PredecessorMap = long unsigned int*; DistanceMap = double*; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<no_property, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = qgr::Visitor; Tag = graph_visitor_t; Base = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<G>::traversal_category = undir_adj_list_traversal_tag]’
434 | dijkstra_shortest_paths(g, &s, &s + 1, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
435 | index_map, compare, combine, inf, zero, vis);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/data/localhost/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<G>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >; DistanceMap = 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>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>; Params = boost::bgl_named_params<qgr::Visitor, boost::graph_visitor_t, boost::bgl_named_params<double*, boost::vertex_distance_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > >; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, no_property, property<edge_weight_t, double> >; Param = qgr::Visitor; Tag = graph_visitor_t; Rest = bgl_named_params<double*, vertex_distance_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
quadform_geodesics_reference.cpp:148:41: required from here
148 | try{boost::dijkstra_shortest_paths(g,source,boost::predecessor_map(parent.data()).distance_map(distance.data()).visitor(Visitor(&budget,target,&settled)));}catch(const Reached&){}
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/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/localhost/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/localhost/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) {
| ^~~~~~~~~~~~~~~~~~~
In file included from quadform_geodesics_mesh.cpp:2:
vendor/geodesic/geodesic_algorithm_exact.h: In member function ‘unsigned int geodesic::GeodesicAlgorithmExact::intersect_intervals(geodesic::interval_pointer, geodesic::IntervalWithStop*)’:
vendor/geodesic/geodesic_algorithm_exact.h:443:22: warning: ‘mid_map’ may be used uninitialized [-Wmaybe-uninitialized]
443 | if (mid_map[0] == OLD) // first interval in the map is already the old one
| ~~~~~~~~~^
vendor/geodesic/geodesic_algorithm_exact.h:433:13: note: ‘mid_map’ declared here
433 | MapType mid_map[3];
| ^~~~~~~
vendor/geodesic/geodesic_algorithm_exact.h: In member function ‘virtual void geodesic::GeodesicAlgorithmExact::trace_back(const geodesic::SurfacePoint&, std::vector<geodesic::SurfacePoint>&)’:
vendor/geodesic/geodesic_algorithm_exact.h:1221:45: warning: ‘interval’ may be used uninitialized [-Wmaybe-uninitialized]
1221 | edge_pointer e = interval->edge();
| ^
vendor/geodesic/geodesic_algorithm_exact.h:1211:30: note: ‘interval’ was declared here
1211 | interval_pointer interval;
| ^~~~~~~~
vendor/geodesic/geodesic_algorithm_exact.h:1223:13: warning: ‘position’ may be used uninitialized [-Wmaybe-uninitialized]
1223 | if (position < local_epsilon) {
| ^~
vendor/geodesic/geodesic_algorithm_exact.h:1213:20: note: ‘position’ was declared here
1213 | double position;
| ^~~~~~~~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 quadform_geodesics_methods_rcpp.cpp -o quadform_geodesics_methods_rcpp.o
quadform_geodesics_methods_rcpp.cpp: In function ‘Rcpp::List rcpp_quadform_geodesics_method(Rcpp::NumericMatrix, Rcpp::NumericVector, Rcpp::NumericVector, Rcpp::List, std::string, Rcpp::List)’:
quadform_geodesics_methods_rcpp.cpp:73:9: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
73 | if(!std::isfinite(p[0])||!std::isfinite(p[1])||!d.inside(p))Rcpp::stop("initial_path must be finite and inside the domain");b.initial_path.push_back(p);}
| ^~
quadform_geodesics_methods_rcpp.cpp:73:133: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
73 | if(!std::isfinite(p[0])||!std::isfinite(p[1])||!d.inside(p))Rcpp::stop("initial_path must be finite and inside the domain");b.initial_path.push_back(p);}
| ^
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 SEXP_cpp_conversion_utils.cpp -o SEXP_cpp_conversion_utils.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 Eigen_utils.cpp -o Eigen_utils.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 adaptive_radius_graph_ann.cpp -o adaptive_radius_graph_ann.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 bidirectional_dijkstra.cpp -o bidirectional_dijkstra.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 cpp_mstrees.cpp -o cpp_mstrees.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 dgraphs_init.cpp -o dgraphs_init.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 geometric_edge_pruning.cpp -o geometric_edge_pruning.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 geodesic_iknn_graphs.cpp -o geodesic_iknn_graphs.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 geodesic_stats.cpp -o geodesic_stats.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 geodesic_stats_r.cpp -o geodesic_stats_r.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_core_endpoints.cpp -o graph_core_endpoints.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_endpoint_geometry_rcpp.cpp -o graph_endpoint_geometry_rcpp.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_endpoint_geometry_rcpp_wrappers.cpp -o graph_endpoint_geometry_rcpp_wrappers.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_spectrum.cpp -o graph_spectrum.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_conn_components.cpp -o graph_conn_components.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_maximal_packing.cpp -o graph_maximal_packing.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_maximal_packing_r.cpp -o graph_maximal_packing_r.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 graph_utils_native.cpp -o graph_utils_native.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 kNN.cpp -o kNN.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 knn_search_result_native.cpp -o knn_search_result_native.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 local_geodesic_pruning.cpp -o local_geodesic_pruning.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 mknn_graphs.cpp -o mknn_graphs.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 mst_completion_graphs.cpp -o mst_completion_graphs.o
In file included from /data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/Core:337,
from /data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/Dense:1,
from ../inst/include/dgraphs/Eigen_utils.h:8,
from graph_spectrum.cpp:1:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h: In function ‘static void Eigen::internal::selfadjoint_product_impl<Lhs, LhsMode, false, Rhs, 0, true>::run(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Block<Eigen::Matrix<double, -1, 1>, -1, 1, false>; Lhs = Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>; int LhsMode = 17; Rhs = Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, -1, 1> >, const Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, 1, true>, -1, 1, false> >]’:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:229:7: warning: ‘result’ may be used uninitialized [-Wmaybe-uninitialized]
227 | internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
228 | int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
229 | (
| ^
230 | lhs.rows(), // size
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
231 | &lhs.coeffRef(0,0), lhs.outerStride(), // lhs info
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
232 | actualRhsPtr, // rhs info
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
233 | actualDestPtr, // result info
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
234 | actualAlpha // scale factor
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
235 | );
| ~
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/SelfadjointMatrixVector.h:41:6: note: by argument 4 of type ‘const double*’ to ‘static void Eigen::internal::selfadjoint_matrix_vector_product<Scalar, Index, StorageOrder, UpLo, ConjugateLhs, ConjugateRhs, Version>::run(Index, const Scalar*, Index, const Scalar*, Scalar*, Scalar) [with Scalar = double; Index = long int; int StorageOrder = 0; int UpLo = 1; bool ConjugateLhs = false; bool ConjugateRhs = false; int Version = 0]’ declared here
41 | void selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Version>::run(
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 mst_completion_graphs_r.cpp -o mst_completion_graphs_r.o
In file included from /data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/Core:341:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h: In function ‘static void Eigen::internal::trmv_selector<Mode, 1>::run(const Lhs&, const Rhs&, Dest&, const typename Dest::Scalar&) [with Lhs = Eigen::Transpose<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, -1, false> >; Rhs = Eigen::Transpose<const Eigen::CwiseBinaryOp<Eigen::internal::scalar_product_op<double, double>, const Eigen::CwiseNullaryOp<Eigen::internal::scalar_constant_op<double>, const Eigen::Matrix<double, 1, -1> >, const Eigen::Transpose<const Eigen::Block<const Eigen::Block<const Eigen::Block<Eigen::Matrix<double, -1, -1>, -1, -1, false>, -1, 1, true>, -1, 1, false> > > >; Dest = Eigen::Transpose<Eigen::Block<Eigen::Block<Eigen::Matrix<double, -1, -1, 1, -1, -1>, 1, -1, true>, 1, -1, false> >; int Mode = 6]’:
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:332:12: warning: ‘result’ may be used uninitialized [-Wmaybe-uninitialized]
327 | internal::triangular_matrix_vector_product
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
328 | <Index,Mode,
| ~~~~~~~~~~~~
329 | LhsScalar, LhsBlasTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
330 | RhsScalar, RhsBlasTraits::NeedToConjugate,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
331 | RowMajor>
| ~~~~~~~~~
332 | ::run(actualLhs.rows(),actualLhs.cols(),
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
333 | actualLhs.data(),actualLhs.outerStride(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
334 | actualRhsPtr,1,
| ~~~~~~~~~~~~~~~
335 | dest.data(),dest.innerStride(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
336 | actualAlpha);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppEigen/include/Eigen/src/Core/products/TriangularMatrixVector.h:105:24: note: by argument 5 of type ‘const double*’ to ‘static void Eigen::internal::triangular_matrix_vector_product<Index, Mode, LhsScalar, ConjLhs, RhsScalar, ConjRhs, 1, Version>::run(Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, const ResScalar&) [with Index = long int; int Mode = 6; LhsScalar = double; bool ConjLhs = false; RhsScalar = double; bool ConjRhs = false; int Version = 0]’ declared here
105 | EIGEN_DONT_INLINE void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 mstree_total_length.cpp -o mstree_total_length.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 path_grid.cpp -o path_grid.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 progress_utils.cpp -o progress_utils.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 pruning_long_edges.cpp -o pruning_long_edges.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 prune_long_edges.cpp -o prune_long_edges.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 set_wgraph.cpp -o set_wgraph.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 shortest_path_utils.cpp -o shortest_path_utils.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 sknn_graphs.cpp -o sknn_graphs.o
gcc -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -Werror=implicit-function-declaration -Wstrict-prototypes -c kernels.c -o kernels.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 iknn_graphs.cpp -o iknn_graphs.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 linf_simplex_knn.cpp -o linf_simplex_knn.o
gcc -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -fpic -g -O2 -Wall -pedantic -mtune=native -Wp,-D_FORTIFY_SOURCE=3 -fexceptions -fstack-protector-strong -fstack-clash-protection -fcf-protection -Werror=implicit-function-declaration -Wstrict-prototypes -c mstree.c -o mstree.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/ANN.cpp -o ANN/ANN.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/bd_fix_rad_search.cpp -o ANN/bd_fix_rad_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/bd_pr_search.cpp -o ANN/bd_pr_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/bd_search.cpp -o ANN/bd_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/bd_tree.cpp -o ANN/bd_tree.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_dump.cpp -o ANN/kd_dump.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_fix_rad_search.cpp -o ANN/kd_fix_rad_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_pr_search.cpp -o ANN/kd_pr_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_search.cpp -o ANN/kd_search.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_split.cpp -o ANN/kd_split.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_tree.cpp -o ANN/kd_tree.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I. -IANN -I../inst/include/dgraphs -I../inst/include -DR_NO_REMAP -D_Alignof=__alignof__ -DDLL_API= -DEIGEN_DONT_PARALLELIZE -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/nloptr/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/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 ANN/kd_util.cpp -o ANN/kd_util.o
g++ -std=gnu++17 -shared -L/usr/local/lib64 -o dgraphs.so RcppExports.o fermat_implicit.o fermat_knn.o linf_simplex.o quadform_geodesics_solver.o quadform_geodesics_solver_rcpp.o quadform_geodesics_methods.o quadform_geodesics_continuous.o quadform_geodesics_boundary.o quadform_geodesics_reference.o quadform_geodesics_mesh.o quadform_geodesics_methods_rcpp.o SEXP_cpp_conversion_utils.o Eigen_utils.o adaptive_radius_graph_ann.o bidirectional_dijkstra.o cpp_mstrees.o dgraphs_init.o geometric_edge_pruning.o geodesic_iknn_graphs.o geodesic_stats.o geodesic_stats_r.o graph_core_endpoints.o graph_endpoint_geometry_rcpp.o graph_endpoint_geometry_rcpp_wrappers.o graph_spectrum.o graph_conn_components.o graph_maximal_packing.o graph_maximal_packing_r.o graph_utils_native.o kNN.o knn_search_result_native.o local_geodesic_pruning.o mknn_graphs.o mst_completion_graphs.o mst_completion_graphs_r.o mstree_total_length.o path_grid.o progress_utils.o pruning_long_edges.o prune_long_edges.o set_wgraph.o shortest_path_utils.o sknn_graphs.o kernels.o iknn_graphs.o linf_simplex_knn.o mstree.o ANN/ANN.o ANN/bd_fix_rad_search.o ANN/bd_pr_search.o ANN/bd_search.o ANN/bd_tree.o ANN/kd_dump.o ANN/kd_fix_rad_search.o ANN/kd_pr_search.o ANN/kd_search.o ANN/kd_split.o ANN/kd_tree.o ANN/kd_util.o -llapack -L/data/localhost/ripley/R/R-devel/lib -lRblas -lgfortran -lm -latomic_asneeded -lquadmath
make[1]: Leaving directory '/data/localhost/ripley/R/packages/tests-devel/dgraphs/src'
make[1]: Entering directory '/data/localhost/ripley/R/packages/tests-devel/dgraphs/src'
make[1]: Leaving directory '/data/localhost/ripley/R/packages/tests-devel/dgraphs/src'
installing to /data/localhost/ripley/R/packages/tests-devel/dgraphs.Rcheck/00LOCK-dgraphs/00new/dgraphs/libs
** R
** inst
** byte-compile and prepare package for lazy loading
** help
*** installing help indices
*** copying figures
** building package indices
** installing vignettes
** testing if installed package can be loaded from temporary location
** checking absolute paths in shared objects and dynamic libraries
** testing if installed package can be loaded from final location
** testing if installed package keeps a record of temporary installation path
* DONE (dgraphs)